Loading theory "HOL-Eisbach.Eisbach" (required by "Winding_Number_Eval.Winding_Number_Eval" via "HOL-Eisbach.Eisbach_Tools") Loading theory "Sturm_Tarski.PolyMisc" (required by "Winding_Number_Eval.Winding_Number_Eval" via "Winding_Number_Eval.Cauchy_Index_Theorem" via "Sturm_Tarski.Sturm_Tarski") signature PARSE_TOOLS = sig val is_real_val: ('a, 'b) parse_val -> bool val name_term: (term, string) parse_val parser val parse_term_val: 'a parser -> (term, 'a) parse_val parser val parse_thm_val: 'a parser -> (thm, 'a) parse_val parser datatype ('a, 'b) parse_val = Parse_Val of 'b * ('a -> unit) | Real_Val of 'a val parse_val_cases: ('a -> 'b) -> ('b, 'a) parse_val -> 'b * ('b -> unit) val the_parse_fun: ('a, 'b) parse_val -> 'a -> unit val the_parse_val: ('a, 'b) parse_val -> 'b val the_real_val: ('a, 'b) parse_val -> 'a end structure Parse_Tools: PARSE_TOOLS signature METHOD_CLOSURE = sig val apply_method: Proof.context -> string -> term list -> thm list list -> (Proof.context -> Method.method) list -> Proof.context -> thm list -> context_tactic val method: binding -> (binding * typ option * mixfix) list -> binding list -> binding list -> binding list -> Token.src -> local_theory -> string * local_theory val method_cmd: binding -> (binding * string option * mixfix) list -> binding list -> binding list -> binding list -> Token.src -> local_theory -> string * local_theory end structure Method_Closure: METHOD_CLOSURE ### theory "Sturm_Tarski.PolyMisc" ### 0.153s elapsed time, 0.304s cpu time, 0.000s GC time Loading theory "Winding_Number_Eval.Missing_Analysis" (required by "Winding_Number_Eval.Winding_Number_Eval" via "Winding_Number_Eval.Cauchy_Index_Theorem") structure Eisbach_Rule_Insts: sig end ### theory "Winding_Number_Eval.Missing_Analysis" ### 0.183s elapsed time, 0.368s cpu time, 0.000s GC time Loading theory "Winding_Number_Eval.Missing_Topology" (required by "Winding_Number_Eval.Winding_Number_Eval" via "Winding_Number_Eval.Cauchy_Index_Theorem" via "Winding_Number_Eval.Missing_Transcendental") ### ML warning (line 170 of "~~/src/HOL/Eisbach/match_method.ML"): ### Pattern is not exhaustive. ### ML warning (line 187 of "~~/src/HOL/Eisbach/match_method.ML"): ### Pattern is not exhaustive. ### ML warning (line 309 of "~~/src/HOL/Eisbach/match_method.ML"): ### Pattern is not exhaustive. signature MATCH_METHOD = sig val focus_params: Proof.context -> term list val focus_schematics: Proof.context -> Envir.tenv end structure Match_Method: MATCH_METHOD ### theory "HOL-Eisbach.Eisbach" ### 0.561s elapsed time, 1.120s cpu time, 0.000s GC time Loading theory "HOL-Eisbach.Eisbach_Tools" (required by "Winding_Number_Eval.Winding_Number_Eval") val try_map = fn: 'a Seq.seq -> 'a Seq.seq -> 'a Seq.seq val uncurry_rule = fn: thm -> thm val curry_rule = fn: thm -> thm ### theory "HOL-Eisbach.Eisbach_Tools" ### 0.053s elapsed time, 0.108s cpu time, 0.000s GC time Loading theory "Sturm_Tarski.Sturm_Tarski" (required by "Winding_Number_Eval.Winding_Number_Eval" via "Winding_Number_Eval.Cauchy_Index_Theorem") ### theory "Winding_Number_Eval.Missing_Topology" ### 0.603s elapsed time, 1.308s cpu time, 0.000s GC time Loading theory "Winding_Number_Eval.Missing_Algebraic" (required by "Winding_Number_Eval.Winding_Number_Eval" via "Winding_Number_Eval.Cauchy_Index_Theorem" via "Winding_Number_Eval.Missing_Transcendental") Found termination order: "length <*mlex*> {}" ### theory "Sturm_Tarski.Sturm_Tarski" ### 1.522s elapsed time, 3.064s cpu time, 0.184s GC time ### theory "Winding_Number_Eval.Missing_Algebraic" ### 2.227s elapsed time, 4.436s cpu time, 0.184s GC time Loading theory "Winding_Number_Eval.Missing_Transcendental" (required by "Winding_Number_Eval.Winding_Number_Eval" via "Winding_Number_Eval.Cauchy_Index_Theorem") ### theory "Winding_Number_Eval.Missing_Transcendental" ### 0.311s elapsed time, 0.620s cpu time, 0.000s GC time Loading theory "Winding_Number_Eval.Cauchy_Index_Theorem" (required by "Winding_Number_Eval.Winding_Number_Eval") ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### ((\x. x) \ ?a) (at ?a within ?s) ### Ignoring duplicate introduction (intro) ### ((\x. ?k) \ ?k) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. ereal (?f x)) \ ereal ?x) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. - ?f x) \ - ?x) ?F ### Ignoring duplicate introduction (intro) ### \\?c\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?x \ 0; (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?y \ - \; ?x \ - \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Ignoring duplicate introduction (intro) ### \\?y\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F Proofs for inductive predicate(s) "finite_Psegments" Proving monotonicity ... Proving the introduction rules ... Proving the elimination rules ... Proving the induction rule ... Proving the simplification rules ... ### theory "Winding_Number_Eval.Cauchy_Index_Theorem" ### 4.277s elapsed time, 8.488s cpu time, 0.624s GC time Loading theory "Winding_Number_Eval.Winding_Number_Eval" ### Ignoring duplicate introduction (intro) ### ((\x. x) \ ?a) (at ?a within ?s) ### Ignoring duplicate introduction (intro) ### ((\x. ?k) \ ?k) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. ereal (?f x)) \ ereal ?x) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. - ?f x) \ - ?x) ?F ### Ignoring duplicate introduction (intro) ### \\?c\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?x \ 0; (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?y \ - \; ?x \ - \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Ignoring duplicate introduction (intro) ### \\?y\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### theory "Winding_Number_Eval.Winding_Number_Eval" ### 1.322s elapsed time, 2.652s cpu time, 0.000s GC time ### Metis: Unused theorems: "List.list.inject" ### Rule already declared as introduction (intro) ### ((\x. x) \ ?a) (at ?a within ?s) ### Rule already declared as introduction (intro) ### ((\x. ?k) \ ?k) ?F ### Rule already declared as introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. ereal (?f x)) \ ereal ?x) ?F ### Rule already declared as introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. - ?f x) \ - ?x) ?F ### Rule already declared as introduction (intro) ### \\?c\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Rule already declared as introduction (intro) ### \?x \ 0; (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Rule already declared as introduction (intro) ### \?y \ - \; ?x \ - \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Rule already declared as introduction (intro) ### \\?y\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Ignoring duplicate rewrite rule: ### inverse ?a1 \ (1::?'a1) / ?a1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 ^ ?n1 \ inverse (?a1 ^ ?n1) ### Ignoring duplicate rewrite rule: ### ((1::?'a1) / ?a1) ^ ?n1 \ (1::?'a1) / ?a1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### (?a1 / ?b1) ^ ?n1 \ ?a1 ^ ?n1 / ?b1 ^ ?n1 ### Metis: Unused theorems: "local.assms_3" ### Ignoring duplicate rewrite rule: ### inverse ?a1 \ (1::?'a1) / ?a1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 ^ ?n1 \ inverse (?a1 ^ ?n1) ### Ignoring duplicate rewrite rule: ### ((1::?'a1) / ?a1) ^ ?n1 \ (1::?'a1) / ?a1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### (?a1 / ?b1) ^ ?n1 \ ?a1 ^ ?n1 / ?b1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 \ (1::?'a1) / ?a1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 ^ ?n1 \ inverse (?a1 ^ ?n1) ### Ignoring duplicate rewrite rule: ### ((1::?'a1) / ?a1) ^ ?n1 \ (1::?'a1) / ?a1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### (?a1 / ?b1) ^ ?n1 \ ?a1 ^ ?n1 / ?b1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 \ (1::?'a1) / ?a1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 ^ ?n1 \ inverse (?a1 ^ ?n1) ### Ignoring duplicate rewrite rule: ### ((1::?'a1) / ?a1) ^ ?n1 \ (1::?'a1) / ?a1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### (?a1 / ?b1) ^ ?n1 \ ?a1 ^ ?n1 / ?b1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### sgn (?a1 / ?b1) \ sgn ?a1 / sgn ?b1 ### Ignoring duplicate introduction (intro) ### ((\x. x) \ ?a) (at ?a within ?s) ### Ignoring duplicate introduction (intro) ### ((\x. ?k) \ ?k) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. ereal (?f x)) \ ereal ?x) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. - ?f x) \ - ?x) ?F ### Ignoring duplicate introduction (intro) ### \\?c\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?x \ 0; (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?y \ - \; ?x \ - \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Ignoring duplicate introduction (intro) ### \\?y\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Ignoring duplicate introduction (intro) ### ((\x. x) \ ?a) (at ?a within ?s) ### Ignoring duplicate introduction (intro) ### ((\x. ?k) \ ?k) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. ereal (?f x)) \ ereal ?x) ?F ### Ignoring duplicate introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. - ?f x) \ - ?x) ?F ### Ignoring duplicate introduction (intro) ### \\?c\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?x \ 0; (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Ignoring duplicate introduction (intro) ### \?y \ - \; ?x \ - \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Ignoring duplicate introduction (intro) ### \\?y\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Metis: Unused theorems: "Cauchy_Index_Theorem.sgnx_able_poly_3", "Cauchy_Index_Theorem.sgnx_able_poly_4" ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f *** Undefined fact: "isCont_inverse" (line 2371 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") *** At command "by" (line 2371 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") ### Ignoring duplicate elimination (elim) ### \filterlim ?f at_top ?F; filterlim ?f at_bot ?F; ### ?F \ bot\ ### \ False ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f *** Undefined fact: "at_within_closed_interval" (line 2646 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") *** At command "by" (line 2646 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rewrite rule not in simpset: ### Complex ?a1 ?b1 \ complex_of_real ?a1 + \ * complex_of_real ?b1 ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate rewrite rule: ### path (\t. ?g1 t - ?z1) \ path ?g1 ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate rewrite rule: ### path (\t. ?g1 t - ?z1) \ path ?g1 ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate introduction (intro) ### open {} ### Ignoring duplicate introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### closed {} ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### closed UNIV ### Ignoring duplicate introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Ignoring duplicate introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Ignoring duplicate introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Ignoring duplicate introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Ignoring duplicate introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Ignoring duplicate introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Ignoring duplicate introduction (intro) ### closed ?S \ open (- ?S) ### Ignoring duplicate introduction (intro) ### open ?S \ closed (- ?S) ### Ignoring duplicate introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Ignoring duplicate introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### ((\x. x) \ ?a) (at ?a within ?s) ### Rule already declared as introduction (intro) ### ((\x. ?k) \ ?k) ?F ### Rule already declared as introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. ereal (?f x)) \ ereal ?x) ?F ### Rule already declared as introduction (intro) ### (?f \ ?x) ?F \ ### ((\x. - ?f x) \ - ?x) ?F ### Rule already declared as introduction (intro) ### \\?c\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Rule already declared as introduction (intro) ### \?x \ 0; (?f \ ?x) ?F\ ### \ ((\x. ?c * ?f x) \ ?c * ?x) ?F ### Rule already declared as introduction (intro) ### \?y \ - \; ?x \ - \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Rule already declared as introduction (intro) ### \\?y\ \ \; ### (?f \ ?x) ?F\ ### \ ((\x. ?f x + ?y) \ ?x + ?y) ?F ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Rule already declared as introduction (intro) ### open {} ### Rule already declared as introduction (intro) ### \open ?S; open ?T\ \ open (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. open (?B x) \ ### open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. open T\ ### \ open (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. open (?B x)\ ### \ open (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### closed {} ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### closed UNIV ### Rule already declared as introduction (intro) ### \closed ?S; closed ?T\ ### \ closed (?S \ ?T) ### Rule already declared as introduction (intro) ### \x\?A. closed (?B x) \ ### closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \S\?K. closed S \ closed (\?K) ### Rule already declared as introduction (intro) ### \finite ?S; \T\?S. closed T\ ### \ closed (\?S) ### Rule already declared as introduction (intro) ### \finite ?A; \x\?A. closed (?B x)\ ### \ closed (\x\?A. ?B x) ### Rule already declared as introduction (intro) ### \open ?S; closed ?T\ \ open (?S - ?T) ### Rule already declared as introduction (intro) ### \closed ?S; open ?T\ \ closed (?S - ?T) ### Rule already declared as introduction (intro) ### closed ?S \ open (- ?S) ### Rule already declared as introduction (intro) ### open ?S \ closed (- ?S) ### Rule already declared as introduction (intro) ### continuous_on ?s (linepath ?a ?b) ### Rule already declared as introduction (intro) ### (\i. continuous_on UNIV (\x. ?f x i)) \ ### continuous_on UNIV ?f ### Ignoring duplicate rewrite rule: ### inverse ?a1 \ (1::?'a1) / ?a1 ### Ignoring duplicate rewrite rule: ### inverse ?a1 ^ ?n1 \ inverse (?a1 ^ ?n1) ### Ignoring duplicate rewrite rule: ### ((1::?'a1) / ?a1) ^ ?n1 \ (1::?'a1) / ?a1 ^ ?n1 ### Ignoring duplicate rewrite rule: ### (?a1 / ?b1) ^ ?n1 \ ?a1 ^ ?n1 / ?b1 ^ ?n1 isabelle document -o 'pdf' -n 'outline' -t '/proof,/ML' /media/data/jenkins/workspace/afp-repo-afp/browser_info/AFP/Count_Complex_Roots/outline 2>&1 isabelle document -o 'pdf' -n 'document' -t '' /media/data/jenkins/workspace/afp-repo-afp/browser_info/AFP/Count_Complex_Roots/document 2>&1 This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex) restricted \write18 enabled. entering extended mode LaTeX2e <2016/02/01> Babel <3.9q> and hyphenation patterns for 81 language(s) loaded. (./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./isabelle.sty (./comment.sty Excluding comment 'comment') Including comment 'isadelimtheory' Including comment 'isatagtheory' Including comment 'isadelimproof' Including comment 'isatagproof' Including comment 'isadelimML' Including comment 'isatagML' Including comment 'isadelimvisible' Including comment 'isatagvisible' Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible') (./isabelletags.sty) (./isabellesym.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty For additional information on amsmath, use the `?' option. (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty)) (./pdfsetup.sty (/usr/share/texlive/texmf-dist/tex/latex/graphics/color.sty (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg) (/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty)))) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty)) (/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty) (/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def) (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg) (/usr/share/texlive/texmf-dist/tex/latex/url/url.sty)) Package hyperref Message: Driver (autodetected): hpdftex. (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty)) No file root.aux. (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) LaTeX Warning: Citation `eisermann2012fundamental' on page 1 undefined on input line 21. LaTeX Warning: Citation `rahman2002analytic' on page 1 undefined on input line 21. (./session.tex) No file root.bbl. [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] (./root.aux) Package rerunfilecheck Warning: File `root.out' has changed. (rerunfilecheck) Rerun to get outlines right (rerunfilecheck) or use package `bookmark'. LaTeX Warning: There were undefined references. ) Output written on root.pdf (1 page, 49783 bytes). Transcript written on root.log. This is BibTeX, Version 0.99d (TeX Live 2015/Debian) The top-level auxiliary file: root.aux The style file: abbrv.bst Database file #1: root.bib Warning--there's a number but no series in rahman2002analytic (There was 1 warning) This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex) restricted \write18 enabled. entering extended mode LaTeX2e <2016/02/01> Babel <3.9q> and hyphenation patterns for 81 language(s) loaded. (./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./isabelle.sty (./comment.sty Excluding comment 'comment') Including comment 'isadelimtheory' Including comment 'isatagtheory' Including comment 'isadelimproof' Including comment 'isatagproof' Including comment 'isadelimML' Including comment 'isatagML' Including comment 'isadelimvisible' Including comment 'isatagvisible' Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible') (./isabelletags.sty) (./isabellesym.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty For additional information on amsmath, use the `?' option. (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty)) (./pdfsetup.sty (/usr/share/texlive/texmf-dist/tex/latex/graphics/color.sty (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg) (/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty)))) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty)) (/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty) (/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def) (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg) (/usr/share/texlive/texmf-dist/tex/latex/url/url.sty)) Package hyperref Message: Driver (autodetected): hpdftex. (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty)) (./root.aux) (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty)) (./root.out) (./root.out) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) LaTeX Warning: Citation `eisermann2012fundamental' on page 1 undefined on input line 21. LaTeX Warning: Citation `rahman2002analytic' on page 1 undefined on input line 21. (./session.tex) (./root.bbl) [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.m ap}] (./root.aux) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on root.pdf (1 page, 74057 bytes). Transcript written on root.log. This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex) restricted \write18 enabled. entering extended mode LaTeX2e <2016/02/01> Babel <3.9q> and hyphenation patterns for 81 language(s) loaded. (./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./isabelle.sty (./comment.sty Excluding comment 'comment') Including comment 'isadelimtheory' Including comment 'isatagtheory' Including comment 'isadelimproof' Including comment 'isatagproof' Including comment 'isadelimML' Including comment 'isatagML' Including comment 'isadelimvisible' Including comment 'isatagvisible' Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible') (./isabelletags.sty) (./isabellesym.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty For additional information on amsmath, use the `?' option. (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty)) (./pdfsetup.sty (/usr/share/texlive/texmf-dist/tex/latex/graphics/color.sty (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg) (/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty)))) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty)) (/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty) (/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def) (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg) (/usr/share/texlive/texmf-dist/tex/latex/url/url.sty)) Package hyperref Message: Driver (autodetected): hpdftex. (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty)) (./root.aux) (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty)) (./root.out) (./root.out) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) (./session.tex) (./root.bbl) [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] (./root.aux ) ) Output written on root.pdf (1 page, 73742 bytes). Transcript written on root.log. This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex) restricted \write18 enabled. entering extended mode LaTeX2e <2016/02/01> Babel <3.9q> and hyphenation patterns for 81 language(s) loaded. (./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./isabelle.sty (./comment.sty Excluding comment 'comment') Including comment 'isadelimtheory' Including comment 'isatagtheory' Including comment 'isadelimproof' Including comment 'isatagproof' Including comment 'isadelimML' Including comment 'isatagML' Including comment 'isadelimvisible' Including comment 'isatagvisible' Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible') (./isabelletags.sty Including comment 'isadelimproof' Excluding comment 'isatagproof' Including comment 'isadelimML' Excluding comment 'isatagML') (./isabellesym.sty ) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty For additional information on amsmath, use the `?' option. (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty)) (./pdfsetup.sty (/usr/share/texlive/texmf-dist/tex/latex/graphics/color.sty (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg) (/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty)))) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty)) (/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty) (/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def) (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg) (/usr/share/texlive/texmf-dist/tex/latex/url/url.sty)) Package hyperref Message: Driver (autodetected): hpdftex. (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty)) No file root.aux. (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) LaTeX Warning: Citation `eisermann2012fundamental' on page 1 undefined on input line 21. LaTeX Warning: Citation `rahman2002analytic' on page 1 undefined on input line 21. (./session.tex) No file root.bbl. [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] (./root.aux) Package rerunfilecheck Warning: File `root.out' has changed. (rerunfilecheck) Rerun to get outlines right (rerunfilecheck) or use package `bookmark'. LaTeX Warning: There were undefined references. ) Output written on root.pdf (1 page, 49783 bytes). Transcript written on root.log. This is BibTeX, Version 0.99d (TeX Live 2015/Debian) The top-level auxiliary file: root.aux The style file: abbrv.bst Database file #1: root.bib Warning--there's a number but no series in rahman2002analytic (There was 1 warning) This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex) restricted \write18 enabled. entering extended mode LaTeX2e <2016/02/01> Babel <3.9q> and hyphenation patterns for 81 language(s) loaded. (./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./isabelle.sty (./comment.sty Excluding comment 'comment') Including comment 'isadelimtheory' Including comment 'isatagtheory' Including comment 'isadelimproof' Including comment 'isatagproof' Including comment 'isadelimML' Including comment 'isatagML' Including comment 'isadelimvisible' Including comment 'isatagvisible' Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible') (./isabelletags.sty Including comment 'isadelimproof' Excluding comment 'isatagproof' Including comment 'isadelimML' Excluding comment 'isatagML') (./isabellesym.sty ) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty For additional information on amsmath, use the `?' option. (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty)) (./pdfsetup.sty (/usr/share/texlive/texmf-dist/tex/latex/graphics/color.sty (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg) (/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty)))) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty)) (/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty) (/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def) (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg) (/usr/share/texlive/texmf-dist/tex/latex/url/url.sty)) Package hyperref Message: Driver (autodetected): hpdftex. (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty)) (./root.aux) (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty)) (./root.out) (./root.out) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) LaTeX Warning: Citation `eisermann2012fundamental' on page 1 undefined on input line 21. LaTeX Warning: Citation `rahman2002analytic' on page 1 undefined on input line 21. (./session.tex) (./root.bbl) [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.m ap}] (./root.aux) LaTeX Warning: There were undefined references. LaTeX Warning: Label(s) may have changed. Rerun to get cross-references right. ) Output written on root.pdf (1 page, 74057 bytes). Transcript written on root.log. This is pdfTeX, Version 3.14159265-2.6-1.40.16 (TeX Live 2015/Debian) (preloaded format=pdflatex) restricted \write18 enabled. entering extended mode LaTeX2e <2016/02/01> Babel <3.9q> and hyphenation patterns for 81 language(s) loaded. (./root.tex (/usr/share/texlive/texmf-dist/tex/latex/base/article.cls Document Class: article 2014/09/29 v1.4h Standard LaTeX document class (/usr/share/texlive/texmf-dist/tex/latex/base/size11.clo)) (./isabelle.sty (./comment.sty Excluding comment 'comment') Including comment 'isadelimtheory' Including comment 'isatagtheory' Including comment 'isadelimproof' Including comment 'isatagproof' Including comment 'isadelimML' Including comment 'isatagML' Including comment 'isadelimvisible' Including comment 'isatagvisible' Excluding comment 'isadeliminvisible' Excluding comment 'isataginvisible') (./isabelletags.sty Including comment 'isadelimproof' Excluding comment 'isatagproof' Including comment 'isadelimML' Excluding comment 'isatagML') (./isabellesym.sty ) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsmath.sty For additional information on amsmath, use the `?' option. (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amstext.sty (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsgen.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsbsy.sty) (/usr/share/texlive/texmf-dist/tex/latex/amsmath/amsopn.sty)) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amssymb.sty (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/amsfonts.sty)) (./pdfsetup.sty (/usr/share/texlive/texmf-dist/tex/latex/graphics/color.sty (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/color.cfg) (/usr/share/texlive/texmf-dist/tex/latex/pdftex-def/pdftex.def (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/infwarerr.sty) (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/ltxcmds.sty)))) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-hyperref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/hobsub-generic.sty)) (/usr/share/texlive/texmf-dist/tex/latex/graphics/keyval.sty) (/usr/share/texlive/texmf-dist/tex/generic/ifxetex/ifxetex.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/auxhook.sty) (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/kvoptions.sty) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/pd1enc.def) (/usr/share/texlive/texmf-dist/tex/latex/latexconfig/hyperref.cfg) (/usr/share/texlive/texmf-dist/tex/latex/url/url.sty)) Package hyperref Message: Driver (autodetected): hpdftex. (/usr/share/texlive/texmf-dist/tex/latex/hyperref/hpdftex.def (/usr/share/texlive/texmf-dist/tex/latex/oberdiek/rerunfilecheck.sty)) (./root.aux) (/usr/share/texlive/texmf-dist/tex/context/base/supp-pdf.mkii [Loading MPS to PDF converter (version 2006.09.02).] ) (/usr/share/texlive/texmf-dist/tex/latex/hyperref/nameref.sty (/usr/share/texlive/texmf-dist/tex/generic/oberdiek/gettitlestring.sty)) (./root.out) (./root.out) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsa.fd) (/usr/share/texlive/texmf-dist/tex/latex/amsfonts/umsb.fd) (./session.tex) (./root.bbl) [1{/var/lib/texmf/fonts/map/pdftex/updmap/pdftex.map}] (./root.aux ) ) Output written on root.pdf (1 page, 73742 bytes). Transcript written on root.log. *** Undefined fact: "at_within_closed_interval" (line 2646 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") *** At command "by" (line 2646 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") *** Undefined fact: "isCont_inverse" (line 2371 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy") *** At command "by" (line 2371 of "~~/afp/thys/Winding_Number_Eval/Cauchy_Index_Theorem.thy")