[isabelle-dev] Unnamed declarations
Florian Haftmann
florian.haftmann at informatik.tu-muenchen.de
Wed May 23 11:08:43 CEST 2018
Hi all,
the AFP submission guidelines explicitly demand »Only named lemmas
should carry attributes such as [simp]«
(https://www.isa-afp.org/submitting.html)
However, a cursory search reveals a considerable amount of such
declarations (see attached files for isabelle: 083120125148 / afp:
41a62ac437db), even when conceding that many of these might be false
positives.
In the context of a recent discussion demanding more discipline
(https://lists.cam.ac.uk/mailman/htdig/cl-isabelle-users/2018-April/msg00058.html)
I am quite uncertain what to do about this. Maybe it is enough to
polish only a certain class of declarations (e.g. transfer_rule).
Suggestions welcome,
Florian
--
PGP available:
http://isabelle.in.tum.de/~haftmann/pgp/florian_haftmann_at_informatik_tu_muenchen_de
-------------- next part --------------
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Rules/Blast.thy:32:lemma [iff]: "(xs at ys = []) = (xs=[] & ys=[])"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/CodeGen/CodeGen.thy:118:lemma [simp]: "\<forall>vs. exec (xs at ys) s vs = exec ys s (exec xs s vs)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Inductive/Even.thy:205:lemma [iff]: "((Suc (Suc n)) \<in> even) = (n \<in> even)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Inductive/AB.thy:32:lemma [simp]: "(x \<noteq> a) = (x = b) \<and> (x \<noteq> b) = (x = a)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Inductive/Star.thy:41:lemma [intro]: "(x,y) \<in> r \<Longrightarrow> (x,y) \<in> r*"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Fun/fun0.thy:175:lemma [simp]: "gcd m 0 = m"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Fun/fun0.thy:179:lemma [simp]: "n \<noteq> 0 \<Longrightarrow> gcd m n = gcd n (m mod n)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Misc/Plus.thy:13:lemma [simp]: "\<forall>m. add m n = m+n"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Misc/Tree2.thy:17:lemma [simp]: "\<forall>xs. flatten2 t xs = flatten t @ xs"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/CTL/CTL.thy:410:lemma [iff]: "apath s \<in> Paths s";
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Recdef/Nested2.thy:5:lemma [simp]: "t \<in> set ts \<longrightarrow> size t < Suc(size_term_list ts)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Recdef/simplification.thy:81:lemma [simp]: "gcd (m, 0) = m"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Recdef/simplification.thy:85:lemma [simp]: "n \<noteq> 0 \<Longrightarrow> gcd(m, n) = gcd(n, m mod n)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:130:lemma [simp]:
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:159:lemma [simp]: "\<forall>t e. normal(normif b t e) = (normal t \<and> normal e)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:203:lemma [simp]:
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:212:lemma [simp]: "\<forall>t e. normal2 t & normal2 e --> normal2(normif2 b t e)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Trie/Trie.thy:56:lemma [simp]: "lookup (Trie None []) as = None"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Trie/Trie.thy:189:lemma [simp]: "\<forall> a v b. assoc (overwrite a v ps) b = assoc ((a,v)#ps) b"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Trie/Trie.thy:225:lemma [simp]: "lookupm (Triem None (\<lambda>c. None)) as = None"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Advanced/Partial.thy:127:lemma [simp]:
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Datatype/Nested.thy:122:lemma [simp]: "\<forall> ys. trevs (xs @ ys) = (trevs ys) @ (trevs xs)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Datatype/Nested.thy:132:lemma [simp]: "subst s (App f ts) = App f (map (subst s) ts)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Protocol/Message.thy:14:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/src/FOL/FOL.thy:369:lemma [simp]: "((P \<longrightarrow> R) \<longleftrightarrow> (Q \<longrightarrow> R)) \<longleftrightarrow> ((P \<longleftrightarrow> Q) \<or> R)"
/srv/data/tum/isabelle/devel/src/FOL/FOL.thy:372:lemma [simp]: "((P \<longrightarrow> Q) \<longleftrightarrow> (P \<longrightarrow> R)) \<longleftrightarrow> (P \<longrightarrow> (Q \<longleftrightarrow> R))"
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:372:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:383:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:394:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:398:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:416:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:440:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:449:lemma [z3_rule]: (* for def-axiom *)
/srv/data/tum/isabelle/devel/src/HOL/String.thy:170:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:174:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:178:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:182:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:611:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:616:lemma [code_computation_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Typerep.thy:80:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Typerep.thy:85:lemma [code nbe]:
/srv/data/tum/isabelle/devel/src/HOL/HOLCF/IOA/NTP/Impl.thy:80:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/HOLCF/IOA/NTP/Impl.thy:87:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/HOLCF/IOA/Storage/Action.thy:13:lemma [cong]: "\<And>x. x = y \<Longrightarrow> case_action a b c x = case_action a b c y"
/srv/data/tum/isabelle/devel/src/HOL/Fields.thy:292:lemma [divide_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Fields.thy:1073:lemma [divide_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate.thy:537:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate.thy:541:lemma [code nbe]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate.thy:545:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate.thy:549:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:132:lemma [simp]: "fields (E, Object) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:135:lemma [simp]: "fields (E, Xcpt NullPointer) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:138:lemma [simp]: "fields (E, Xcpt ClassCast) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:141:lemma [simp]: "fields (E, Xcpt OutOfMemory) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:144:lemma [simp]: "fields (E, test_name) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:409:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:452:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/Typing_Framework_JVM.thy:42:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/Typing_Framework_JVM.thy:174:lemma [iff]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/Typing_Framework_JVM.thy:180:lemma [intro]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/JVMType.thy:94:lemma [simp]: "Err.le r (OK a) (OK b) = r a b"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/DFA/LBVComplete.thy:20:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/J/Example.thy:354:lemma [simp]: "fst ObjectC = Object" by (simp add: ObjectC_def)
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/JVM/JVMDefensive.thy:131:lemma [dest!]:
/srv/data/tum/isabelle/devel/src/HOL/Nonstandard_Analysis/NSA.thy:949:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:71:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:90:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:138:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:142:lemma [code nbe]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:155:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:238:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:282:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Enum.thy:291:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Auth/Message.thy:16:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Ordered_Euclidean_Space.thy:222:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Sigma_Algebra.thy:1578:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:677:lemma [measurable]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:935:lemma [measurable (raw)]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:1659:lemma [measurable(raw)]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:1666:lemma [measurable(raw)]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Measurable.thy:183:lemma [measurable (raw generic)]:
/srv/data/tum/isabelle/devel/src/HOL/Rat.thy:931:lemma [code abstype]: "Frct (quotient_of q) = q"
/srv/data/tum/isabelle/devel/src/HOL/Rat.thy:947:lemma [code_unfold]: "numeral k = Rat.of_int (numeral k)"
/srv/data/tum/isabelle/devel/src/HOL/Rat.thy:950:lemma [code_unfold]: "- numeral k = Rat.of_int (- numeral k)"
/srv/data/tum/isabelle/devel/src/HOL/Rat.thy:1046:lemma [code]: "of_rat p = (let (a, b) = quotient_of p in of_int a / of_int b)"
/srv/data/tum/isabelle/devel/src/HOL/Rat.thy:1107:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:168:lemma [simp]: "attributes (Val (att, text)) = att"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:171:lemma [simp]: "attributes (Env att dir) = att"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:174:lemma [simp]: "attributes (map_attributes f file) = f (attributes file)"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:178:lemma [simp]: "map_attributes f (Val (att, text)) = Val (f att, text)"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:181:lemma [simp]: "map_attributes f (Env att dir) = Env (f att) dir"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Nested_Environment.thy:561:lemma [code nbe]: "HOL.equal (x :: (_, _, _) env) x \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Relation.thy:1102:lemma [pred_set_conv]: "inv_imagep (\<lambda>x y. (x, y) \<in> r) f = (\<lambda>x y. (x, y) \<in> inv_image r f)"
/srv/data/tum/isabelle/devel/src/HOL/Codegenerator_Test/Candidates.thy:55:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Random_Pred.thy:20:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Random.thy:182:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Examples/Hotel_Example.thy:175:lemma [code]: "no_Check_in s r = list_all (%x. case x of Check_in g r' c => r \<noteq> r' | _ => True) s"
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Examples/Hotel_Example.thy:182:lemma [code]: "feels_safe s r = list_ex (%(s3, s2, s1, g, c, c'). no_Check_in (s3 @ s2) r &
/srv/data/tum/isabelle/devel/src/HOL/List.thy:23:lemma [case_names Nil Cons, cases type: list]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:28:lemma [case_names Nil Cons, induct type: list]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:2462:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6599:lemma [measure_function]: "is_measure f \<Longrightarrow> is_measure (size_list f)"
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6602:lemma [measure_function]: "is_measure f \<Longrightarrow> is_measure (size_option f)"
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6769:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6773:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6784:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6788:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6940:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6963:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:7128:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:7158:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:7190:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/List.thy:7207:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Corec_Examples/Tests/Iterate_GPV.thy:38:lemma [friend_of_corec_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Corec_Examples/Tests/Iterate_GPV.thy:42:lemma [friend_of_corec_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:80:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:84:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:88:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:92:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:100:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:104:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:108:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:207:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:211:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:265:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:269:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:276:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:280:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:284:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:345:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:359:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:377:lemma [code_computation_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:810:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:814:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:818:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:826:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:834:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:878:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:882:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:927:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:931:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:941:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:945:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:949:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:977:lemma [measure_function]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1027:lemma [code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1033:lemma [code abstype]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1037:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1041:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1045:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1049:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1053:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1057:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1061:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1065:lemma [code, code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1071:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1075:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1079:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1083:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1087:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1091:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1095:lemma [code nbe]: "HOL.equal n (n::natural) \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1098:lemma [code]: "m \<le> n \<longleftrightarrow> integer_of_natural m \<le> integer_of_natural n"
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:1101:lemma [code]: "m < n \<longleftrightarrow> integer_of_natural m < integer_of_natural n"
/srv/data/tum/isabelle/devel/src/HOL/Divides.thy:1261:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Divides.thy:1266:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Real.thy:1585:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Real.thy:1591:lemma [code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Real.thy:1619:lemma [code nbe]: "HOL.equal x x \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Real.thy:1732:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Real_Vector_Spaces.thy:175:lemma [vector_add_divide_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Nominal/Nominal.thy:379:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:362:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:369:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:376:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:383:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:390:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:394:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:401:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Array.thy:409:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Imperative_HOL/Ref.thy:271:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Fibonacci.thy:32:lemma [simp]: "fib (Suc n) > 0"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Higher_Order_Logic.thy:248:lemma [trans]: "x = y \<Longrightarrow> P y \<Longrightarrow> P x"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Higher_Order_Logic.thy:251:lemma [trans]: "P x \<Longrightarrow> x = y \<Longrightarrow> P y"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:265:lemma [trans]: "\<turnstile> P c Q \<Longrightarrow> P' \<subseteq> P \<Longrightarrow> \<turnstile> P' c Q"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:267:lemma [trans] : "P' \<subseteq> P \<Longrightarrow> \<turnstile> P c Q \<Longrightarrow> \<turnstile> P' c Q"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:270:lemma [trans]: "Q \<subseteq> Q' \<Longrightarrow> \<turnstile> P c Q \<Longrightarrow> \<turnstile> P c Q'"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:272:lemma [trans]: "\<turnstile> P c Q \<Longrightarrow> Q \<subseteq> Q' \<Longrightarrow> \<turnstile> P c Q'"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:275:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:278:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:282:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:285:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:331:lemma [trans, intro?]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:339:lemma [intro?]: "\<turnstile> (P \<inter> b) c P \<Longrightarrow> \<turnstile> P (While b P c) (P \<inter> -b)"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:342:lemma [intro?]: "\<turnstile> (P \<inter> b) c P \<Longrightarrow> \<turnstile> P (While b undefined c) (P \<inter> -b)"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:346:lemma [intro?]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:351:lemma [intro?]:
/srv/data/tum/isabelle/devel/src/HOL/Rings.thy:656:lemma [field_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Rings.thy:666:lemma [field_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Rings.thy:1685:lemma [nitpick_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/SMT_Examples/SMT_Examples.thy:376:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:25:lemma [iff]: "Path h 0 xs y = (xs = [] \<and> y = 0)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:28:lemma [simp]: "x\<noteq>0 \<Longrightarrow> Path h x as z =
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:32:lemma [simp]: "\<And>x. Path f x (as at bs) z = (\<exists>y. Path f x as y \<and> Path f y bs z)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:45:lemma [simp]: "List h x [] = (x = 0)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:48:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:52:lemma [simp]: "List h 0 as = (as = [])"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Examples.thy:159:lemma [simp]: "1 \<le> i \<Longrightarrow> fac (i - Suc 0) * i = fac i"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:33:lemma [iff]: "Path h Null xs y = (xs = [] \<and> y = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:39:lemma [simp]: "Path h (Ref a) as z =
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:46:lemma [simp]: "\<And>x. Path f x (as at bs) z = (\<exists>y. Path f x as y \<and> Path f y bs z)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:88:lemma [simp]: "List h x [] = (x = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:91:lemma [simp]: "List h x (a#as) = (x = Ref a \<and> List h (h a) as)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:94:lemma [simp]: "List h Null as = (as = [])"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:156:lemma [simp]: "islist h Null"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:159:lemma [simp]: "islist h (Ref a) = islist h (h a)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:162:lemma [simp]: "list h Null = []"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:171:lemma [simp]: "islist h (h a) \<Longrightarrow> a \<notin> set(list h (h a))"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:52:lemma [iff]: "Path h Null xs y = (xs = [] \<and> y = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:58:lemma [simp]: "a \<noteq> Null \<Longrightarrow> Path h a as z =
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:65:lemma [simp]: "\<And>x. Path f x (as at bs) z = (\<exists>y. Path f x as y \<and> Path f y bs z)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:68:lemma [simp]: "\<And>x. u \<notin> set as \<Longrightarrow> Path (f(u := v)) x as y = Path f x as y"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:78:lemma [simp]: "List h x [] = (x = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:81:lemma [simp]: "List h x (a#as) = (x \<noteq> Null \<and> x = a \<and> List h (h a) as)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:84:lemma [simp]: "List h Null as = (as = [])"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:143:lemma [simp]: "islist h Null"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:146:lemma [simp]: "a \<noteq> Null \<Longrightarrow> islist h a = islist h (h a)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:149:lemma [simp]: "list h Null = []"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:158:lemma [simp]: "islist h (h a) \<Longrightarrow> a \<notin> set(list h (h a))"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:99:lemma [simp]: " \<lbrakk>m l\<rbrakk> \<Longrightarrow> (l,x) \<in> (R | m)\<^sup>* = (l=x)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:124:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:130:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:136:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:142:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:160:lemma [simp]: "\<And>t. \<lbrakk> x \<notin> set xs; Ref x\<noteq>t \<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:166:lemma [simp]: "\<And>t. \<lbrakk> x \<notin> set xs; Ref x\<noteq>t \<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:172:lemma [simp]: "\<And>t. \<lbrakk> x \<notin> set xs; Ref x\<noteq>t \<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:184:lemma [simp]: "\<And>x. x \<notin> set xs \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:190:lemma [simp]: "\<And>x. x \<notin> set xs \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:230:lemma [simp]: "({} = insert a A \<inter> B) = (a \<notin> B & {} = A \<inter> B)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:232:lemma [simp]: "({} = A \<inter> insert b B) = (b \<notin> A & {} = A \<inter> B)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:234:lemma [simp]: "({} = A \<inter> (B \<union> C)) = ({} = A \<inter> B & {} = A \<inter> C)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:341:lemma [simp]: "ispath f p p"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:343:lemma [simp]: "path f p p = []"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:345:lemma [simp]: "ispath f p q \<Longrightarrow> a \<notin> set(path f p q) \<Longrightarrow> ispath (f(a := r)) p q"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:347:lemma [simp]: "ispath f p q \<Longrightarrow> a \<notin> set(path f p q) \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:353:lemma [simp]: "ispath (f(a := q)) p (Ref a) \<Longrightarrow> ispath (f(a := q)) p q"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:355:lemma [simp]: "ispath (f(a := q)) p (Ref a) \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:358:lemma [simp]: "ispath f p (Ref a) \<Longrightarrow> f a = Ref b \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:361:lemma [simp]: "ispath f p (Ref a) \<Longrightarrow> f a = Null \<Longrightarrow> islist f p"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:363:lemma [simp]: "ispath f p (Ref a) \<Longrightarrow> f a = Null \<Longrightarrow> list f p = path f p (Ref a) @ [a]"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:366:lemma [simp]: "islist f p \<Longrightarrow> distinct (list f p)"
/srv/data/tum/isabelle/devel/src/HOL/Transfer.thy:195:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Transfer.thy:200:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:147:lemma [simp]: "undefined3 (In1l x) = In1 undefined"
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:150:lemma [simp]: "undefined3 (In1r x) = \<diamondsuit>"
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:153:lemma [simp]: "undefined3 (In2 x) = In2 undefined"
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:156:lemma [simp]: "undefined3 (In3 x) = In3 undefined"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:74:lemma [simp]: "wp\<^sub>t SKIP Q = Q"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:77:lemma [simp]: "wp\<^sub>t (x ::= e) Q = (\<lambda>s. Q(s(x := aval e s)))"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:80:lemma [simp]: "wp\<^sub>t (c\<^sub>1;;c\<^sub>2) Q = wp\<^sub>t c\<^sub>1 (wp\<^sub>t c\<^sub>2 Q)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:86:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX2.thy:81:lemma [simp]: "wp\<^sub>t SKIP Q = Q"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX2.thy:84:lemma [simp]: "wp\<^sub>t (x ::= e) Q = (\<lambda>l s. Q l (s(x := aval e s)))"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX2.thy:90:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/IMP/ACom.thy:157:lemma [simp]: "shift (\<lambda>p. a) n = (\<lambda>p. a)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Abs_Int0.thy:80:lemma [simp]: "(Some x < Some y) = (x < y)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Collecting_Examples.thy:16:lemma [code]: "compact(set xs) = set(remdups xs)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Abs_Int2_ivl.thy:141:lemma [simp]: fixes x :: "'a::linorder extended" shows "(\<not> x < Pinf) = (x = Pinf)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Abs_Int2_ivl.thy:143:lemma [simp]: fixes x :: "'a::linorder extended" shows "(\<not> Minf < x) = (x = Minf)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/BExp.thy:29:lemma [simp]: "bval (less a1 a2) s = (aval a1 s < aval a2 s)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:116:lemma [simp]: "wp\<^sub>t SKIP Q = Q"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:119:lemma [simp]: "wp\<^sub>t (x ::= e) Q = (\<lambda>s. Q(s(x := aval e s)))"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:122:lemma [simp]: "wp\<^sub>t (c\<^sub>1;;c\<^sub>2) Q = wp\<^sub>t c\<^sub>1 (wp\<^sub>t c\<^sub>2 Q)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:128:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Induct/QuoNestedDataType.thy:179:lemma [simp]: "exprel``{U} \<in> Exp"
/srv/data/tum/isabelle/devel/src/HOL/Induct/QuoDataType.thy:162:lemma [simp]: "msgrel``{U} \<in> Msg"
/srv/data/tum/isabelle/devel/src/HOL/Induct/Infinitely_Branching_Tree.thy:89:lemma [simp]: "(j, Succ j) \<in> brouwer_order"
/srv/data/tum/isabelle/devel/src/HOL/Induct/Infinitely_Branching_Tree.thy:92:lemma [simp]: "(f n, Lim f) \<in> brouwer_order"
/srv/data/tum/isabelle/devel/src/HOL/Induct/Com.thy:85:lemma [pred_set_conv]:
/srv/data/tum/isabelle/devel/src/HOL/Induct/Com.thy:90:lemma [pred_set_conv]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:429:lemma [presburger, algebra]: "m mod 2 = (1::nat) \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:430:lemma [presburger, algebra]: "m mod 2 = Suc 0 \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:431:lemma [presburger, algebra]: "m mod (Suc (Suc 0)) = (1::nat) \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:432:lemma [presburger, algebra]: "m mod (Suc (Suc 0)) = Suc 0 \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:433:lemma [presburger, algebra]: "m mod 2 = (1::int) \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:442:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:470:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:476:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:481:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:486:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Transitive_Closure.thy:737:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Transitive_Closure.thy:742:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Transitive_Closure.thy:1158:lemma [code]: "ntrancl (Suc n) r = (let r' = ntrancl n r in r' \<union> r' O r)"
/srv/data/tum/isabelle/devel/src/HOL/Decision_Procs/Rat_Pair.thy:477:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy:344:lemma [simp]: "isnpoly (C (-1, 1))"
/srv/data/tum/isabelle/devel/src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy:400:lemma [simp]: "isnpoly 0\<^sub>p"
/srv/data/tum/isabelle/devel/src/HOL/Probability/SPMF.thy:18:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Product_Type.thy:40:lemma [code]: "HOL.equal False P \<longleftrightarrow> \<not> P"
/srv/data/tum/isabelle/devel/src/HOL/Product_Type.thy:179:lemma [code]: "HOL.equal u v \<longleftrightarrow> True" for u v :: unit
/srv/data/tum/isabelle/devel/src/HOL/Word/Bit_Representation.thy:675:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Word/Word.thy:177:lemma [code abstype]: "Word (uint w) = w"
/srv/data/tum/isabelle/devel/src/HOL/Word/Word.thy:399:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Word_Type.thy:142:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Word_Type.thy:149:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Reflection_Examples.thy:102:lemma [measure_function]: "is_measure fmsize" ..
/srv/data/tum/isabelle/devel/src/HOL/ex/Reflection_Examples.thy:149:lemma [measure_function]: "is_measure num_size" ..
/srv/data/tum/isabelle/devel/src/HOL/ex/Reflection_Examples.thy:270:lemma [measure_function]: "is_measure linaformsize" ..
/srv/data/tum/isabelle/devel/src/HOL/ex/Tarski.thy:427:lemma [simp]: "f \<in> pset cl \<rightarrow> pset cl \<and> monotone f (pset cl) (order cl)"
/srv/data/tum/isabelle/devel/src/HOL/ex/Transfer_Debug.thy:50:lemma [transfer_rule]: "bi_unique A \<Longrightarrow> rel_fun A (rel_fun (pcr_fset A) (=)) (\<in>) (|\<in>|)"
/srv/data/tum/isabelle/devel/src/HOL/ex/CTL.thy:31:lemma [intro!]: "p \<inter> p \<rightarrow> q \<subseteq> q" unfolding imp_def by auto
/srv/data/tum/isabelle/devel/src/HOL/ex/CTL.thy:32:lemma [intro!]: "p \<subseteq> (q \<rightarrow> p)" unfolding imp_def by rule
/srv/data/tum/isabelle/devel/src/HOL/ex/Residue_Ring.thy:75:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Residue_Ring.thy:79:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Residue_Ring.thy:83:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Executable_Relation.thy:36:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Executable_Relation.thy:40:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Executable_Relation.thy:44:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Executable_Relation.thy:48:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Executable_Relation.thy:52:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Executable_Relation.thy:59:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Serbian.thy:189:lemma [simp]: "azb2abc_aux (abc2azb_aux x) = [x]"
/srv/data/tum/isabelle/devel/src/HOL/ex/Serbian.thy:192:lemma [simp]: "abc2azb (Ž # xs) = Ж # abc2azb xs"
/srv/data/tum/isabelle/devel/src/HOL/ex/Serbian.thy:195:lemma [simp]: "abc2azb (J # xs) = Ј # abc2azb xs"
/srv/data/tum/isabelle/devel/src/HOL/ex/Erdoes_Szekeres.thy:68:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Normalization_by_Evaluation.thy:29:lemma [code nbe]: "add2 (add2 n m) k = add2 n (add2 m k)"
/srv/data/tum/isabelle/devel/src/HOL/ex/Normalization_by_Evaluation.thy:31:lemma [code]: "add2 n (S m) = S (add2 n m)"
/srv/data/tum/isabelle/devel/src/HOL/ex/Normalization_by_Evaluation.thy:33:lemma [code]: "add2 n Z = n"
/srv/data/tum/isabelle/devel/src/HOL/ex/Quicksort.thy:18:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/ZF/LProd.thy:119:lemma [simp, intro]:
/srv/data/tum/isabelle/devel/src/HOL/ZF/LProd.thy:128:lemma [simp, intro]:
/srv/data/tum/isabelle/devel/src/HOL/Nitpick.thy:59:lemma [nitpick_simp]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Quickcheck_Examples.thy:276:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:200:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:204:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:231:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:235:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:306:lemma [code_pred_intro odd_Suc]: "ya_even x ==> ya_odd (Suc x)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:309:lemma [code_pred_intro even_Suc]:"ya_odd x ==> ya_even (Suc x)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Predicate_Compile_Tests.thy:686:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Specialisation_Examples.thy:34:lemma [code_pred_inline]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Examples.thy:37:lemma [code_pred_def]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:11:lemma [code_pred_inline]: "insert == (%y A x. y = x | A x)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:14:lemma [code_pred_inline]: "(-) == (%A B x. A x \<and> \<not> B x)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:22:lemma [code_pred_def]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:32:lemma [code_pred_def]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:42:lemma [code_pred_def]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:52:lemma [code_pred_def]:
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:62:lemma [code_pred_def]: "no_Check_in s r = (\<not> (\<exists>g c. List.member s (Check_in g r c)))"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Prolog.thy:65:lemma [code_pred_def]: "feels_safe s r =
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Small_Generator.thy:9:lemma [code_pred_inline]: "insert == (%y A x. y = x | A x)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Hotel_Example_Small_Generator.thy:12:lemma [code_pred_inline]: "(-) == (%A B x. A x \<and> \<not> B x)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Context_Free_Grammar_Example.thy:44:lemma [code_pred_def]: "filter_a [] = []"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Context_Free_Grammar_Example.thy:47:lemma [code_pred_def]: "filter_a (x#xs) = (if x = a then x # filter_a xs else filter_a xs)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Context_Free_Grammar_Example.thy:54:lemma [code_pred_def]: "filter_b [] = []"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Context_Free_Grammar_Example.thy:57:lemma [code_pred_def]: "filter_b (x#xs) = (if x = b then x # filter_b xs else filter_b xs)"
/srv/data/tum/isabelle/devel/src/HOL/Predicate_Compile_Examples/Lambda_Example.thy:77:lemma [code_pred_inline]: "(x::nat) + 1 = Suc x"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:149:lemma [simp]: "avl t \<Longrightarrow> ht t = height t"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:164:lemma [simp]: "height(node l a r) = max (height l) (height r) + 1"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:465:lemma [simp]: "ht (fib_tree h) = h"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:468:lemma [simp]: "height (fib_tree h) = h"
/srv/data/tum/isabelle/devel/src/HOL/Proofs/Lambda/InductTermi.thy:61:lemma [simp, THEN not_sym, simp]: "Var n \<degree>\<degree> ss \<noteq> Abs r \<degree> s \<degree>\<degree> ts"
/srv/data/tum/isabelle/devel/src/HOL/Proofs/Lambda/InductTermi.thy:64:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Number_Theory/Eratosthenes.thy:358:lemma [code]: "smallest_prime_between m n = List.find (\<lambda>p. p \<ge> m) (primes_upto n)"
/srv/data/tum/isabelle/devel/src/HOL/Number_Theory/Eratosthenes.thy:386:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Number_Theory/Eratosthenes.thy:393:lemma [code]: "smallest_prime_beyond n = smallest_prime_beyond_aux 2 n"
/srv/data/tum/isabelle/devel/src/HOL/Computational_Algebra/Polynomial.thy:404:lemma [code]: "coeff p = nth_default 0 (coeffs p)"
/srv/data/tum/isabelle/devel/src/HOL/Computational_Algebra/Polynomial.thy:423:lemma [code abstract]: "coeffs 0 = []"
/srv/data/tum/isabelle/devel/src/HOL/Computational_Algebra/Polynomial.thy:426:lemma [code abstract]: "coeffs (pCons a p) = a ## coeffs p"
/srv/data/tum/isabelle/devel/src/HOL/Computational_Algebra/Polynomial.thy:452:lemma [code nbe]: "HOL.equal (p :: _ poly) p \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Computational_Algebra/Polynomial.thy:783:lemma [code]: "p - q = p + - q"
/srv/data/tum/isabelle/devel/src/HOL/Num.thy:1405:lemma [code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Option.thy:17:lemma [case_names None Some, cases type: option]:
/srv/data/tum/isabelle/devel/src/HOL/Option.thy:22:lemma [case_names None Some, induct type: option]:
/srv/data/tum/isabelle/devel/src/HOL/Limits.thy:1871:lemma [trans]: "X = Y \<Longrightarrow> Y \<longlonglongrightarrow> z \<Longrightarrow> X \<longlonglongrightarrow> z"
/srv/data/tum/isabelle/devel/src/HOL/Orderings.thy:1566:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Nat.thy:485:lemma [code]: "0 \<le> n \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Nat.thy:1523:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:118:lemma [fundef_cong]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:123:lemma [fundef_cong]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:207:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:267:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:289:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Lazy_Sequence.thy:77:lemma [code nbe]:
/srv/data/tum/isabelle/devel/src/HOL/UNITY/Extend.thy:301:lemma [iff]: "(extend_act h act = extend_act h act') = (act = act')"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1535:lemma [induct_simp]: "(\<And>x. induct_equal x t \<Longrightarrow> PROP P x) \<equiv> PROP P t"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1546:lemma [induct_simp]: "(\<And>x. induct_equal t x \<Longrightarrow> PROP P x) \<equiv> PROP P t"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1557:lemma [induct_simp]: "(induct_false \<Longrightarrow> P) \<equiv> Trueprop induct_true"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1561:lemma [induct_simp]: "(induct_true \<Longrightarrow> PROP P) \<equiv> PROP P"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1571:lemma [induct_simp]: "(PROP P \<Longrightarrow> induct_true) \<equiv> Trueprop induct_true"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1575:lemma [induct_simp]: "(\<And>x::'a::{}. induct_true) \<equiv> Trueprop induct_true"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1579:lemma [induct_simp]: "induct_implies induct_true P \<equiv> P"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1582:lemma [induct_simp]: "x = x \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1850:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1857:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1864:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1873:lemma [code nbe]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:14:lemma [import_const T]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:18:lemma [import_const "/\\"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:22:lemma [import_const "==>"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:26:lemma [import_const "!"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:30:lemma [import_const "?"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:34:lemma [import_const "\\/"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:38:lemma [import_const F]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:42:lemma [import_const "~"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:46:lemma [import_const "?!"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:50:lemma [import_const "_FALSITY_"]: "False = False"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:59:lemma [import_const COND]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:63:lemma [import_const o]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:67:lemma [import_const I]: "id = (\<lambda>x::'A. x)"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:70:lemma [import_type 1 one_ABS one_REP]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:74:lemma [import_const one]: "() = (SOME x::unit. True)"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:77:lemma [import_const mk_pair]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:81:lemma [import_type prod ABS_prod REP_prod]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:85:lemma [import_const ","]: "Pair = (\<lambda>(x::'A) y::'B. Abs_prod (Pair_Rep x y))"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:88:lemma [import_const FST]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:92:lemma [import_const SND]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:100:lemma [import_const ONE_ONE : inj]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:104:lemma [import_const ONTO : surj]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:126:lemma [import_const NUMERAL]: "id = (\<lambda>x :: nat. x)"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:131:lemma [import_const BIT0]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:21:lemma [code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:27:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:31:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:35:lemma [code abstype]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:39:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:43:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:53:lemma [code_computation_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:60:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:64:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:68:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:72:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:76:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:80:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:84:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:88:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:92:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:96:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:100:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:106:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:110:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:114:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:142:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:146:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:156:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Nat.thy:161:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Mapping.thy:120:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Mapping.thy:223:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Library/AList_Mapping.thy:115:lemma [code nbe]: "HOL.equal (x :: ('a, 'b) mapping) x \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:43:lemma [simp]: "x \<noteq> Some () \<longleftrightarrow> x = None"
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:566:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:724:lemma [code drop: Gcd_fin, code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:736:lemma [code drop: "Gcd :: _ \<Rightarrow> nat", code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:740:lemma [code drop: "Gcd :: _ \<Rightarrow> int", code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:744:lemma [code drop: Lcm_fin,code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:759:lemma [code drop: "Lcm :: _ \<Rightarrow> nat", code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:763:lemma [code drop: "Lcm :: _ \<Rightarrow> int", code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Dlist.thy:131:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Dlist.thy:150:lemma [code nbe]: "HOL.equal (dxs :: 'a::equal dlist) dxs \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_Product.thy:89:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_Product.thy:94:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_Product.thy:101:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Binary_Nat.thy:24:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Binary_Nat.thy:29:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Binary_Nat.thy:33:lemma [code_abbrev]: "Numeral1 = (1::nat)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Binary_Nat.thy:36:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Bit.thy:60:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Bit.thy:84:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Lattice_Constructions.thy:251:lemma [simp]: "Bot \<le> y"
/srv/data/tum/isabelle/devel/src/HOL/Library/Lattice_Constructions.thy:254:lemma [simp]: "y \<le> Top"
/srv/data/tum/isabelle/devel/src/HOL/Library/Saturated.thy:159:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Saturated.thy:169:lemma [code abstract]:
/srv/data/tum/isabelle/devel/src/HOL/Library/FSet.thy:1344:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:19:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:23:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:27:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:31:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:35:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:48:lemma [code_computation_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:56:lemma [code, symmetric, code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:60:lemma [code, symmetric, code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:64:lemma [code_post]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:68:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:72:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:76:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:80:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:86:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:90:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:94:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:98:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:103:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:107:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:111:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:142:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:152:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Target_Int.thy:157:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Debug.thy:18:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Debug.thy:28:lemma [code, code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Extended_Real.thy:272:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Extended_Real.thy:938:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:166:lemma [code]: "real_of_int = real_of_integer \<circ> integer_of_int"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:169:lemma [code_unfold del]: "0 \<equiv> (of_rat 0 :: real)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:172:lemma [code_unfold del]: "1 \<equiv> (of_rat 1 :: real)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:175:lemma [code_unfold del]: "numeral k \<equiv> (of_rat (numeral k) :: real)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:178:lemma [code_unfold del]: "- numeral k \<equiv> (of_rat (- numeral k) :: real)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:194:lemma [code]: "Ratreal r = case_prod Realfract (quotient_of r)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Real_Approx_By_Float.thy:204:lemma [code]: "inverse r = 1 / r" for r :: real
/srv/data/tum/isabelle/devel/src/HOL/Library/Order_Continuity.thy:62:lemma [order_continuous_intros]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Order_Continuity.thy:228:lemma [order_continuous_intros]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Predicate_Compile_Alternative_Defs.thy:21:lemma [code_pred_inline]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Predicate_Compile_Alternative_Defs.thy:175:lemma [code_pred_inline]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Predicate_Compile_Alternative_Defs.thy:251:lemma [code_pred_simp]: "\<not> False == True"
/srv/data/tum/isabelle/devel/src/HOL/Library/Predicate_Compile_Alternative_Defs.thy:254:lemma [code_pred_simp]: "\<not> True == False"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3375:lemma [code]: "{#} = mset []"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3378:lemma [code]: "add_mset x (mset xs) = mset (x # xs)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3381:lemma [code]: "Multiset.is_empty (mset xs) \<longleftrightarrow> List.null xs"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3387:lemma [code]: "image_mset f (mset xs) = mset (map f xs)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3390:lemma [code]: "filter_mset f (mset xs) = mset (filter f xs)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3393:lemma [code]: "mset xs - mset ys = mset (fold remove1 ys xs)"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3396:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3409:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3421:lemma [code]: "count (mset xs) x = fold (\<lambda>y. if x = y then Suc else id) xs 0"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3432:lemma [code]: \<comment> \<open>not very efficient, but representation-ignorant!\<close>
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3486:lemma [code]: "mset xs \<subseteq># mset ys \<longleftrightarrow> subset_eq_mset_impl xs ys \<noteq> None"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3489:lemma [code]: "mset xs \<subset># mset ys \<longleftrightarrow> subset_eq_mset_impl xs ys = Some True"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3497:lemma [code]: "HOL.equal (mset xs) (mset ys) \<longleftrightarrow> subset_eq_mset_impl xs ys = Some False"
/srv/data/tum/isabelle/devel/src/HOL/Library/Multiset.thy:3508:lemma [code]: "prod_mset (mset xs) = fold times xs 1"
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_List.thy:169:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_List.thy:173:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_List.thy:182:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:56:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:60:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:64:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:68:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:72:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:76:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:80:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:84:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:96:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:111:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:115:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:130:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:134:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/IArray.thy:141:lemma [code]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Impl.thy:308:lemma [simp]: "inv1 t \<Longrightarrow> inv1l t" by (cases t) simp+
/srv/data/tum/isabelle/devel/src/HOL/Library/Code_Abstract_Nat.thy:26:lemma [code, code_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Mapping.thy:105:lemma [code nbe]:
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:41:lemma [simp]: "(\<forall>x<0. P(x))"
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:44:lemma [simp]: "~(\<exists>x<0. P(x))"
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:47:lemma [simp]: "(\<forall>x<succ(i). P(x)) <-> (Ord(i) \<longrightarrow> P(i) & (\<forall>x<i. P(x)))"
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:52:lemma [simp]: "(\<exists>x<succ(i). P(x)) <-> (Ord(i) & (P(i) | (\<exists>x<i. P(x))))"
/srv/data/tum/isabelle/devel/src/ZF/Nat_ZF.thy:215:lemma [iff]: "quasinat(0)"
/srv/data/tum/isabelle/devel/src/ZF/Nat_ZF.thy:218:lemma [iff]: "quasinat(succ(x))"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:158:lemma [simp]: "bool_of_o(True) = 1"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:161:lemma [simp]: "bool_of_o(False) = 0"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:164:lemma [simp,TC]: "bool_of_o(P) \<in> bool"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:167:lemma [simp]: "(bool_of_o(P) = 1) \<longleftrightarrow> P"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:170:lemma [simp]: "(bool_of_o(P) = 0) \<longleftrightarrow> ~P"
/srv/data/tum/isabelle/devel/src/ZF/equalities.thy:111:lemma [simp]: "cons(a,cons(a,B)) = cons(a,B)"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Relative.thy:1505:lemma [iff]: "quasilist(Nil)"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Relative.thy:1508:lemma [iff]: "quasilist(Cons(x,l))"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Formula.thy:90:lemma [simp]:
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Formula.thy:95:lemma [simp]:
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Formula.thy:281:lemma [TC]: "x \<in> nat ==> incr_var(x,nq) \<in> nat"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/AC_in_L.thy:424:lemma [simp]: "L_r(f,0) = 0"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/AC_in_L.thy:427:lemma [simp]: "L_r(f, succ(i)) = DPow_r(f, L_r(f,i), Lset(i))"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/AC_in_L.thy:432:lemma [simp]: "Limit(i) ==> L_r(f,i) = rlimit(i, L_r(f))"
/srv/data/tum/isabelle/devel/src/Benchmarks/Quickcheck_Benchmark/Needham_Schroeder_Base.thy:134:lemma [code]:
/srv/data/tum/isabelle/devel/src/Benchmarks/Quickcheck_Benchmark/Needham_Schroeder_Base.thy:169:lemma [code]:
/srv/data/tum/isabelle/devel/src/Benchmarks/Quickcheck_Benchmark/Needham_Schroeder_Base.thy:175:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:153:lemma [simp]: "\<not>quasi_sturm_seq []" by (simp add: quasi_sturm_seq_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:825:lemma [simp]: "sturm_aux p q = [] \<longleftrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:830:lemma [simp]: "hd (sturm p) = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:833:lemma [simp]: "p \<in> set (sturm p)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:836:lemma [simp]: "length (sturm p) \<ge> 2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:844:lemma [simp]: "degree (last (sturm p)) = 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:852:lemma [simp]: "sturm_aux p q ! 0 = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:854:lemma [simp]: "sturm_aux p q ! Suc 0 = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:857:lemma [simp]: "sturm p ! 0 = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:859:lemma [simp]: "sturm p ! Suc 0 = pderiv p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nested_Multisets_Ordinals/Unary_PCF.thy:233:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nested_Multisets_Ordinals/Multiset_More.thy:830:lemma [simp]: "mset (list_of_mset m) = m"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Free-Groups/C2.thy:15:lemma [simp]: "(\<otimes>\<^bsub>C2\<^esub>) = (=)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Free-Groups/C2.thy:18:lemma [simp]: "\<one>\<^bsub>C2\<^esub> = True"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Free-Groups/C2.thy:21:lemma [simp]: "carrier C2 = UNIV"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FeatherweightJava/Execute.thy:20:lemma [code_pred_intro]: "append [] xs xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FeatherweightJava/Execute.thy:23:lemma [code_pred_intro]: "append xs ys zs \<Longrightarrow> append (x#xs) ys (x#zs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FeatherweightJava/Execute.thy:93:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FeatherweightJava/Execute.thy:97:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Queues/PQ.thy:32:lemma [code abstype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Queues/Binomial_Queue.thy:413:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Queues/Binomial_Queue.thy:658:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Queues/Binomial_Queue.thy:663:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:144:lemma [expr_diseq]:"p \<noteq> And p q" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:145:lemma [expr_diseq]:"q \<noteq> And p q" by(induction q, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:146:lemma [expr_diseq]:"p \<noteq> Not p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:147:lemma [expr_diseq]:"p \<noteq> Or p q" by(rule sizeF_diseq, auto simp add: Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:148:lemma [expr_diseq]:"q \<noteq> Or p q" by(rule sizeF_diseq, auto simp add: Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:149:lemma [expr_diseq]:"p \<noteq> Implies p q" by(rule sizeF_diseq, auto simp add: Implies_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:150:lemma [expr_diseq]:"q \<noteq> Implies p q" by(rule sizeF_diseq, auto simp add: Implies_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:151:lemma [expr_diseq]:"p \<noteq> Equiv p q" by(rule sizeF_diseq, auto simp add: Equiv_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:152:lemma [expr_diseq]:"q \<noteq> Equiv p q" by(rule sizeF_diseq, auto simp add: Equiv_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:153:lemma [expr_diseq]:"p \<noteq> Exists x p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:154:lemma [expr_diseq]:"p \<noteq> Diamond a p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:155:lemma [expr_diseq]:"p \<noteq> InContext C p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Feedback_Arcs.thy:45:lemma [simp]: "s\<lparr> state.more := \<lparr> fas = foo \<rparr> \<rparr> = s \<lparr> fas := foo \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Feedback_Arcs.thy:212:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Nested_DFS.thy:41:lemma [simp]: "s\<lparr> state.more := \<lparr> lasso = foo, red = bar \<rparr> \<rparr> = s \<lparr> lasso := foo, red := bar \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Nested_DFS.thy:908:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/DFS_Find_Path.thy:27:lemma [simp]: "s\<lparr> state.more := \<lparr> ppath = foo \<rparr> \<rparr> = s \<lparr> ppath := foo \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/DFS_Find_Path.thy:624:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Reachable_Nodes.thy:240:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Cyc_Check.thy:32:lemma [simp]: "s\<lparr> state.more := \<lparr> break = foo \<rparr> \<rparr> = s \<lparr> break := foo \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Cyc_Check.thy:385:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:401:lemma [autoref_rules, param]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:441:lemma [autoref_op_pat_def]: "op_nos_on_stack_update f s
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:449:lemma [autoref_rules, param]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:493:lemma [autoref_op_pat_def]: "op_ns_on_stack_update f s
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:496:lemma [autoref_op_pat_def]: "op_ns_stack_update f s
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:529:lemma [autoref_rules, param]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:547:lemma [refine_transfer_post_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Misc/Impl_Rev_Array_Stack.thy:22:lemma [relator_props]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/SatSolverCode.thy:15:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/Trail.thy:118:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/MoreList.thy:872:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/MoreList.thy:876:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Markov_Models/MDP_Reachability_Problem.thy:35:lemma [measurable]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:84:lemma [simp]: "SKIP {S} \<sqsubseteq> c \<longleftrightarrow> (\<exists>S'. c = SKIP {S'} \<and> S \<sqsubseteq> S')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:87:lemma [simp]: "x ::= e {S} \<sqsubseteq> c \<longleftrightarrow> (\<exists>S'. c = x ::= e {S'} \<and> S \<sqsubseteq> S')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:90:lemma [simp]: "c1;;c2 \<sqsubseteq> c \<longleftrightarrow> (\<exists>c1' c2'. c = c1';;c2' \<and> c1 \<sqsubseteq> c1' \<and> c2 \<sqsubseteq> c2')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:93:lemma [simp]: "IF b THEN c1 ELSE c2 {S} \<sqsubseteq> c \<longleftrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:97:lemma [simp]: "{Inv} WHILE b DO c {P} \<sqsubseteq> w \<longleftrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:124:lemma [simp]: "(x \<sqsubseteq> None) = (x = None)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:127:lemma [simp]: "(Some x \<sqsubseteq> u) = (\<exists>y. u = Some y & x \<sqsubseteq> y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int2_ivl.thy:51:lemma [simp]: "is_empty(I l h) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int2_ivl.thy:55:lemma [simp]: "is_empty i \<Longrightarrow> \<gamma>_ivl i = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Bool_Func.thy:39:lemma [dest!,elim!]: "bf_False = bf_True \<Longrightarrow> False" "bf_True = bf_False \<Longrightarrow> False" unfolding fun_eq_iff by simp_all (* Occurs here and there as goal for sep_auto *)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Middle_Impl.thy:40:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Middle_Impl.thy:51:lemma [simp,intro!]: "bdd_sane emptymi"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/BDD_Code.thy:8:lemma [code del]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Level_Collapse.thy:164:lemma [sep_heap_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:59:lemma [sep_heap_rules]: "tmi' bdd = Some (p,bdd')
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:65:lemma [sep_heap_rules]: "fmi' bdd = Some (p,bdd')
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:71:lemma [sep_heap_rules]: "ifmi' v t e bdd = Some (p, bdd') \<Longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:96:lemma [sep_decon_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:115:lemma [sep_heap_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:136:lemma [sep_heap_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/QR_Decomposition/Examples_QR_Abstract_Symbolic.thy:24:lemma [code abstract]: "vec_nth (show_vec_real v) = (% i. show_real (v $ i))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/QR_Decomposition/Examples_QR_Abstract_Symbolic.thy:29:lemma[code abstract]: "vec_nth (show_matrix_real A) = (% i. show_vec_real (A $ i))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/QR_Decomposition/Miscellaneous_QR.thy:18:lemma [code abstract]: "vec_nth (a - b) = (%i. a$i - b$i)" by (metis vector_minus_component)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/QR_Decomposition/Miscellaneous_QR.thy:19:lemma [code abstract]: "vec_nth (c *\<^sub>R x) = (\<lambda>i. c *\<^sub>R (x$i))" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:47:lemma [simp]: "r <= s \<Longrightarrow> r < s+(1::real)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:49:lemma [simp]: "r < s \<Longrightarrow> r < s+(1::real)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:51:lemma [simp]: "r <= s \<Longrightarrow> \<not> s+(1::real) < r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:53:lemma [simp]: "(r < s-(1::real)) = (r+1 < s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:55:lemma [simp]: "(s-(1::real) < r) = (s < r+1)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:61:lemma [simp]: "\<lbrakk> p <\<cdot> b; x \<noteq> b \<rbrakk> \<Longrightarrow> p x < p b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:64:lemma [simp]: assumes top: "p <\<cdot> b" shows "\<not> p b < p c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:86:lemma [simp]: "extreme p b \<Longrightarrow> (\<not> p <\<cdot> b) = (b \<cdot>< p)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:91:lemma [simp]: "extreme p b \<Longrightarrow> (\<not> b \<cdot>< p) = (p <\<cdot> b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:113:lemma [simp]: "a \<noteq> b \<Longrightarrow> mktop p b a = p a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:116:lemma [simp]: "a \<noteq> b \<Longrightarrow> mkbot p b a = p a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:119:lemma [simp]: "a \<noteq> b \<Longrightarrow> p a < mktop p b b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:122:lemma [simp]: "a \<noteq> b \<Longrightarrow> mkbot p b b < p a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:125:lemma [simp]: "mktop p b <\<cdot> b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:128:lemma [simp]: "\<not> b \<cdot>< mktop p b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:131:lemma [simp]: "a \<noteq> b \<Longrightarrow> \<not> P p a < mkbot (P p) b b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simple_Firewall/Service_Matrix.thy:1208:lemma[code_unfold]: "simple_firewall_without_interfaces rs \<equiv>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Tools/Syntax_Match.thy:27:lemma [cong]: "syntax_fo_nomatch x y = syntax_fo_nomatch x y" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Tools/Syntax_Match.thy:28:lemma [cong]: "syntax_nomatch x y = syntax_nomatch x y" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Circ_List.thy:22:lemma [simp]: "cs_list l None = \<up>(l=[])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Circ_List.thy:25:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Open_List.thy:123:lemma [simp, sep_dflt_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Open_List.thy:183:lemma [simp, sep_dflt_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/AutoProj.thy:20:lemma [simp]: "start(q,d,f) = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/AutoProj.thy:23:lemma [simp]: "next(q,d,f) = d"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/AutoProj.thy:26:lemma [simp]: "fin(q,d,f) = f"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/DA.thy:25:lemma [simp]: "foldl2 f [] a = a \<and> foldl2 f (x#xs) a = foldl2 f xs (f x a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:327:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:338:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:348:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:359:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:371:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/BinomialHeap.thy:1041:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/BinomialHeap.thy:1045:lemma [simp, code abstype]: "Abs_BinomialHeap (Rep_BinomialHeap q) = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2200:lemma [simp]: "bs_meld x (Inl u) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2220:lemma [simp]: "bs_invar bs_empty" by (simp add: bs_empty_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2305:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2310:lemma [simp, code abstype]: "Abs_SkewBinomialHeap (Rep_SkewBinomialHeap q) = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DataRefinementIBP/DataRefinement.thy:106:lemma [simp]: "Disjunctive_fun R \<Longrightarrow> mono ((R i)::'a::complete_lattice \<Rightarrow> 'b::complete_lattice)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_Nat.thy:133:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_Nat.thy:151:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_Nat.thy:175:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Examples/Hamming_Stream.thy:70:lemma [partial_function_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Examples/Resumption.thy:87:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Examples/Resumption.thy:153:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/TLList.thy:757:lemma [simp, nitpick_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List_Prefix.thy:76:lemma [simp]: assumes "xs \<noteq> LNil" "ys \<noteq> LNil" "lhd xs = lhd ys"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:866:lemma [partial_function_mono]: "mono_llist F \<Longrightarrow> mono_llist (\<lambda>f. lmap g (F f))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:1252:lemma [simp, nitpick_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:1543:lemma [partial_function_mono]: "mono_llist F \<Longrightarrow> mono_llist (\<lambda>f. ltake n (F f))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:2132:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:3285:lemma [simp, code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/CAVA_Impl.thy:466:lemma [autoref_op_pat]: "cava_inter_impl_loc.dflt_inter \<equiv> op_dflt_inter"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/BoolProgs/BoolProgs.thy:244:lemma [simp]: "length (list_of_array a) = array_length a" by (cases a) auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/Nested_DFS/NDFS_SI_Statistics.thy:64:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/Nested_DFS/NDFS_SI.thy:1236:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/Nested_DFS/NDFS_SI.thy:1252:lemma [autoref_op_pat]: "NO_CYC \<equiv> OP NO_CYC :::\<^sub>i i_blue_wit" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:633:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:642:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:649:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:660:lemma [enres_breakdown]: "EWHILEIT I c (\<lambda>s. enres_lift (f s)) s = enres_lift (WHILEIT I c f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:684:lemma [enres_breakdown]: "EWHILET c (\<lambda>s. enres_lift (f s)) s = enres_lift (WHILET c f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:687:lemma [enres_breakdown]: "enfoldli l c (\<lambda>x s. enres_lift (f x s)) s = enres_lift (nfoldli l c f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:692:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:697:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:701:lemma [enres_breakdown]: "(if b then enres_lift m else enres_lift n) = enres_lift (if b then m else n)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:251:lemma [simp]: "islist Null h"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:254:lemma [simp]: "p\<noteq>Null \<Longrightarrow> islist (h p) h = islist p h"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:257:lemma [simp]: "list Null h = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:266:lemma [simp]: "islist (h p) h \<Longrightarrow> p \<notin> set(list (h p) h)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1194:lemma [trans] : "P' \<subseteq> P \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P' c Q,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1197:lemma [trans]: "Q \<subseteq> Q' \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P c Q',A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1200:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1204:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1208:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1212:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1216:lemma [intro?]: "\<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P Skip P,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1149:lemma [trans] : "P' \<subseteq> P \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P' c Q,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1152:lemma [trans]: "Q \<subseteq> Q' \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P c Q',A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1155:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1159:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1163:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1167:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1171:lemma [intro?]: "\<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P Skip P,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/Value.thy:15:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/Value.thy:23:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-restr.thy:134:lemma [simp]: "\<bottom>|\<^bsub>r\<^esub> = \<bottom>" by fixrec_simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-restr.thy:135:lemma [simp]: "f\<cdot>\<bottom> = \<bottom> \<Longrightarrow> f|\<^bsub>\<bottom>\<^esub> = \<bottom>" by fixrec_simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/HOLCF-Utils.thy:161:lemma [simp]: "cfun_comp\<cdot>f\<cdot>(\<rho>(x := v)) = (cfun_comp\<cdot>f\<cdot>\<rho>)(x := f\<cdot>v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/CValue.thy:26:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-Meet.thy:64:lemma [simp]: "C\<cdot>r \<sqinter> r = r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-Meet.thy:67:lemma [simp]: "r \<sqinter> C\<cdot>r = r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-Meet.thy:70:lemma [simp]: "C\<cdot>r \<sqinter> C\<cdot>r' = C\<cdot>(r \<sqinter> r')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:353:lemma [elim_format, elim!]: "x \<triangleleft>\<triangleright> \<bottom> \<Longrightarrow> x = \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:360:lemma [elim_format, elim!]: "x \<triangleleft>\<triangleright> CB\<cdot>b \<Longrightarrow> x = B\<cdot>b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:367:lemma [elim_format, elim!]: "\<bottom> \<triangleleft>\<triangleright> y \<Longrightarrow> y = \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:374:lemma [elim_format, elim!]: "B\<cdot>b \<triangleleft>\<triangleright> y \<Longrightarrow> y = CB\<cdot>b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/HOLCF-Meet.thy:183:lemma [simp]: "(r::'a::Finite_Meet_cpo) \<sqinter> (r \<sqinter> x) = r \<sqinter> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/Terms.thy:124:lemma [simp]: "size (heapToAssn \<Gamma>) = size_list (\<lambda> (v,e) . size e) \<Gamma>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KBPs/Trie2.thy:18:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KBPs/Trie2.thy:23:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Depth-First-Search/DFS.thy:40:lemma [simp]: "x \<notin> nodes_of g \<Longrightarrow> nexts g x = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Depth-First-Search/DFS.thy:43:lemma [simp]: "finite (nodes_of g - set ys)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Root_Balanced_Tree/Root_Balanced_Tree.thy:1915:lemma [code]: "bal_i n h = (h \<le> ceiling(c * log (real_of_integer 2) (n+1)))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Root_Balanced_Tree/Root_Balanced_Tree.thy:1927:lemma [code]: "(floor::real \<Rightarrow> int) = (\<lambda>x. int_of_integer (floor_integer x))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Root_Balanced_Tree/Root_Balanced_Tree.thy:1941:lemma [code_unfold del]: "0 \<equiv> real_of_rat 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Root_Balanced_Tree/Root_Balanced_Tree.thy:1943:lemma [code_unfold del]: "1 \<equiv> real_of_rat 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Root_Balanced_Tree/Root_Balanced_Tree.thy:1946:lemma [code_abbrev]: "real_of_integer (integer_of_nat x) = real x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Root_Balanced_Tree/Root_Balanced_Tree.thy:1949:lemma [code_abbrev]: "(\<lambda>x. int_of_integer (ceiling_integer x)) = (ceiling::real \<Rightarrow> int)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:135:lemma [simp]: "a \<notin> scf R1" by (rule pareto_efficiency) (simp_all add: eval_pareto R1.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:136:lemma [simp]: "a \<notin> scf R2" by (rule pareto_efficiency) (simp_all add: eval_pareto R2.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:137:lemma [simp]: "a \<notin> scf R3" by (rule pareto_efficiency) (simp_all add: eval_pareto R3.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:138:lemma [simp]: "a \<notin> scf R6" by (rule pareto_efficiency) (simp_all add: eval_pareto R6.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:139:lemma [simp]: "a \<notin> scf R7" by (rule pareto_efficiency) (simp_all add: eval_pareto R7.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:140:lemma [simp]: "b \<notin> scf R8" by (rule pareto_efficiency) (simp_all add: eval_pareto R8.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:141:lemma [simp]: "c \<notin> scf R9" by (rule pareto_efficiency) (simp_all add: eval_pareto R9.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:142:lemma [simp]: "a \<notin> scf R12" by (rule pareto_efficiency) (simp_all add: eval_pareto R12.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:143:lemma [simp]: "b \<notin> scf R14" by (rule pareto_efficiency) (simp_all add: eval_pareto R14.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:144:lemma [simp]: "c \<notin> scf R15" by (rule pareto_efficiency) (simp_all add: eval_pareto R15.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:145:lemma [simp]: "b \<notin> scf R16" by (rule pareto_efficiency) (simp_all add: eval_pareto R16.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:146:lemma [simp]: "c \<notin> scf R17" by (rule pareto_efficiency) (simp_all add: eval_pareto R17.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:147:lemma [simp]: "c \<notin> scf R18" by (rule pareto_efficiency) (simp_all add: eval_pareto R18.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:148:lemma [simp]: "b \<notin> scf R19" by (rule pareto_efficiency) (simp_all add: eval_pareto R19.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:149:lemma [simp]: "c \<notin> scf R20" by (rule pareto_efficiency) (simp_all add: eval_pareto R20.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:150:lemma [simp]: "c \<notin> scf R21" by (rule pareto_efficiency) (simp_all add: eval_pareto R21.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Formula_Derivatives/Presburger_Formula.thy:249:lemma [Presb_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example.thy:176:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:158:lemma [simp]: "pred_entailment P {}" by(simp add: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:159:lemma [simp]: "e \<in> P \<Longrightarrow> pred_entailment P {e}" by(blast intro: subset_entailment)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:160:lemma [simp]: "FF \<in> P \<Longrightarrow> pred_entailment P Q" by(auto simp: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:255:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_Swap_Add.thy:277:lemma [simp]: "pred_entailment P {}" by(simp add: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_Swap_Add.thy:278:lemma [simp]: "e \<in> P \<Longrightarrow> pred_entailment P {e}" by(blast intro: subset_entailment)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_Swap_Add.thy:279:lemma [simp]: "FF \<in> P \<Longrightarrow> pred_entailment P Q" by(auto simp: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Security.thy:156:lemma [simp]: "mem =\<^sup>l mem' \<Longrightarrow> mem =\<^bsub>mds\<^esub>\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Security.thy:159:lemma [simp]: "(\<forall> mds. mem =\<^bsub>mds\<^esub>\<^sup>l mem') \<Longrightarrow> mem =\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/Category.thy:412:lemma [simp]: "Category(UnitCategory)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/SetCat.thy:390:lemma [elim]: "\<lbrakk>LSCategory C ;
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/SetCat.thy:410:lemma [simp]: "LSCategory C \<Longrightarrow> Category C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/MonadicEquationalTheory.thy:427:lemma [simp]: "ZFAxioms T \<Longrightarrow> Axioms T" by (simp add: ZFAxioms_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/MonadicEquationalTheory.thy:820:lemma [simp]: "ZFAxioms T \<Longrightarrow> Category iC\<^bsub>CI T\<^esub>" by(simp add: CanonicalInterpretation_def CanonicalCatCat[of T])
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/MonadicEquationalTheory.thy:821:lemma [simp]: "ZFAxioms T \<Longrightarrow> Signature iS\<^bsub>CI T\<^esub>" by(simp add: CanonicalInterpretation_def Axioms.AxSig)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:40:lemma [simp]: "NatTrans \<eta> \<Longrightarrow> NatTransP \<eta>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:220:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NatTrans \<eta>1" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:221:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NatTrans \<eta>2" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:224:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatDom (\<eta>1 \<bullet>1 \<eta>2) = NTCatDom \<eta>1" by (auto simp add: NatTransComp'_def NTCatDom_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:225:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatCod (\<eta>1 \<bullet>1 \<eta>2) = NTCatCod \<eta>1" by (auto simp add: NatTransComp'_def NTCatCod_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:226:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatDom (\<eta>1 \<bullet> \<eta>2) = NTCatDom \<eta>1" by (auto simp add: NatTransComp_defs)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:227:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatCod (\<eta>1 \<bullet> \<eta>2) = NTCatCod \<eta>1" by (auto simp add: NatTransComp_defs)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:228:lemma [simp]: "NatTrans \<eta> \<Longrightarrow> Category(NTCatDom \<eta>)" by (simp add: NatTransP.NatTransFtor NTCatDom_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:229:lemma [simp]: "NatTrans \<eta> \<Longrightarrow> Category(NTCatCod \<eta>)" by (simp add: NatTransP.NatTransFtor2 NTCatCod_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:108:lemma [simp]: "`-p + p = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:111:lemma [simp]: "`p + (-p) = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:114:lemma [simp]: "`(-p) \<cdot> p = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:117:lemma [simp]: "`p \<cdot> (-p) = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:154:lemma [simp]: "`!p + p = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:157:lemma [simp]: "`p + !p = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:160:lemma [simp]: "`!p \<cdot> p = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:163:lemma [simp]: "`p \<cdot> !p = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:208:lemma [simp]: "`!p \<cdot> !p = !p`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:227:lemma [vcg]: "`\<lbrace>p \<cdot> t\<rbrace> c \<lbrace>p\<rbrace>` \<Longrightarrow> `!t \<cdot> p \<le> q` \<Longrightarrow> `\<lbrace>p\<rbrace> While t Do c End \<lbrace>q\<rbrace>`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/AVL-Trees/AVL.thy:124:lemma [simp]: "avl t \<Longrightarrow> ht t = height t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/AVL-Trees/AVL.thy:139:lemma [simp]: "height(mkt x l r) = max (height l) (height r) + 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:27:lemma [simp]: "{\<cdot>p} \<in> assertion"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:30:lemma [simp]: "abs_wpt ({\<cdot>p}) = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:35:lemma [simp]: "x \<in> assertion \<Longrightarrow> {\<cdot>Abs_Assertion x} = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:40:lemma [simp]: "x \<in> assertion \<Longrightarrow> {\<cdot>abs_wpt x} = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran.thy:143:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran.thy:241:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran.thy:245:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:198:lemma [simp]: "(x * \<top>) * y = x * \<top>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:201:lemma [simp]: "(x * \<bottom>) * y = x * \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:428:lemma [simp]: "x \<in> assertion \<Longrightarrow> y \<in> assertion \<Longrightarrow> x \<sqinter> y \<le> x * y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:462:lemma [simp]: "x \<in> assertion \<Longrightarrow> x * y \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:466:lemma [simp]: "x \<in> assertion \<Longrightarrow> y \<in> assertion \<Longrightarrow> x * y \<le> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:490:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<squnion> 1 = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:493:lemma [simp]: "x \<in> assertion \<Longrightarrow> 1 \<squnion> x = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:496:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<sqinter> 1 = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:499:lemma [simp]: "x \<in> assertion \<Longrightarrow> 1 \<sqinter> x = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:502:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<le> x * \<top>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:505:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<le> 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:555:lemma [simp]: "(neg_assert x) ^ o * y \<squnion> x * \<top> = (neg_assert x) ^ o * y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:559:lemma [simp]: " x * \<top> \<squnion> (neg_assert x) ^ o * y= (neg_assert x) ^ o * y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:621:lemma [simp]: "x \<in> assertion \<Longrightarrow> x * x = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:624:lemma [simp]: "x \<in> assertion \<Longrightarrow> (x ^ o) * (x ^ o) = x ^ o"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:628:lemma [simp]: "x \<in> assertion \<Longrightarrow> x * (x ^ o) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:638:lemma [simp]: "x \<in> assertion \<Longrightarrow> (x ^ o) * x = x ^ o"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:643:lemma [simp]: "\<bottom> \<in> assertion"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:646:lemma [simp]: "1 \<in> assertion"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:699:lemma [simp]: "x \<le> y \<Longrightarrow> x \<sqinter> y = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:757:lemma [simp]: "x \<le> 1 \<Longrightarrow> y * x \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:760:lemma [simp]: "x \<le> x * \<top>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:763:lemma [simp]: "x * \<bottom> \<le> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:920:lemma [simp]: "mono (\<lambda> (t::'a::mbt_algebra) . x * t \<sqinter> y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:21:lemma [simp]: "{\<cdot>p} * \<top> \<sqinter> [\<cdot>p] = {\<cdot>p}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:26:lemma [simp]: "[\<cdot>p] * x \<squnion> {\<cdot>-p} * \<top> = [\<cdot>p] * x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:29:lemma [simp]: "{\<cdot>p} * \<top> \<squnion> [\<cdot>-p] * x = [\<cdot>-p] * x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:110:lemma [simp]: "wp 1 = id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:21:lemma [simp]: "(x \<sqinter> y) \<sqinter> z \<le> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:24:lemma [simp]: "x \<sqinter> y \<sqinter> z \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:27:lemma [simp]: "x \<sqinter> (y \<sqinter> z) \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:30:lemma [simp]: "x \<sqinter> (y \<sqinter> z) \<le> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:36:lemma [simp]: "x \<le> x \<squnion> y \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:39:lemma [simp]: "y \<le> x \<squnion> y \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:42:lemma [simp]: "y \<le> x \<squnion> (y \<squnion> z)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:45:lemma [simp]: "z \<le> x \<squnion> (y \<squnion> z)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:51:lemma [simp]: "x \<sqinter> y \<le> x \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:54:lemma [simp]: "y \<sqinter> x \<le> x \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:57:lemma [simp]: "x \<sqinter> y \<le> z \<squnion> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:60:lemma [simp]: "y \<sqinter> x \<le> z \<squnion> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:207:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Conjunctive \<Longrightarrow> F \<in> Apply.conjunctive"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:213:lemma [simp]: "F \<in> Apply.conjunctive \<Longrightarrow> mono F"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:226:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Conjunctive \<Longrightarrow> F top = top"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:231:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Disjunctive \<Longrightarrow> F \<in> Apply.disjunctive"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:237:lemma [simp]: "F \<in> Apply.disjunctive \<Longrightarrow> mono F"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:251:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Disjunctive \<Longrightarrow> F bot = bot"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:44:lemma [simp]: "(a \<sqinter> b) + c = (a + c) \<sqinter> (b + c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:61:lemma [simp]: "(a \<sqinter> b) - c = (a - c) \<sqinter> (b - c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:73:lemma [simp]: "c + (a \<sqinter> b) = (c + a) \<sqinter> (c + b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:89:lemma [simp]: "- (a \<sqinter> b) = (- a) \<squnion> (- b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:105:lemma [simp]: "(a \<squnion> b) + c = (a + c) \<squnion> (b + c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:122:lemma [simp]: "c + (a \<squnion> b) = (c + a) \<squnion> (c + b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:138:lemma [simp]: "c - (a \<sqinter> b) = (c - a) \<squnion> (c - b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:141:lemma [simp]: "(a \<squnion> b) - c = (a - c) \<squnion> (b - c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:144:lemma [simp]: "- (a \<squnion> b) = (- a) \<sqinter> (- b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:155:lemma [simp]: "c - (a \<squnion> b) = (c - a) \<sqinter> (c - b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:70:lemma [simp]: "a_aux a b c \<le> e_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:76:lemma [simp]: "b_aux a b c \<le> e_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:81:lemma [simp]: "c_aux a b c \<le> e_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:86:lemma [simp]: "d_aux a b c \<le> a_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:89:lemma [simp]: "d_aux a b c \<le> b_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:94:lemma [simp]: "d_aux a b c \<le> c_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Factorization/Missing_List.thy:705:lemma [simp]: "set (union_list_sorted xs ys) = set xs \<union> set ys"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Factorization/Dvd_Int_Poly.thy:327:lemma [code_unfold]: "p dvd q \<longleftrightarrow> dvd_int_poly p q" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:37:lemma [simp]: "Node lt a rt \<noteq> lt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:40:lemma [simp]: "lt \<noteq> Node lt a rt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:43:lemma [simp]: "Node lt a rt \<noteq> rt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:46:lemma [simp]: "rt \<noteq> Node lt a rt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy_extended.thy:57:lemma [code]: "toy_instance_single.extend = (\<lambda>toy v. toy_instance_single_rec0 (co3 (\<lambda>f. f v) toy_instance_single_ext) toy)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy_extended.thy:61:lemma [code]: "toy_instance_single.make = co3 (\<lambda>f. f ()) toy_instance_single_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy_extended.thy:64:lemma [code]: "toy_instance_single.truncate = toy_instance_single_rec (co3 K toy_instance_single.make)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_META.thy:69:lemma [code]: "compiler_env_config.extend = (\<lambda>env v. compiler_env_config_rec0 (co14 (\<lambda>f. f v) compiler_env_config_ext) env)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_META.thy:73:lemma [code]: "compiler_env_config.make = co14 (\<lambda>f. f ()) compiler_env_config_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_META.thy:76:lemma [code]: "compiler_env_config.truncate = compiler_env_config_rec (co14 K compiler_env_config.make)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy.thy:107:lemma [code]: "toy_class_raw.extend = (\<lambda>toy v. toy_class_raw_rec0 (co4 (\<lambda>f. f v) toy_class_raw_ext) toy)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy.thy:111:lemma [code]: "toy_class_raw.make = co4 (\<lambda>f. f ()) toy_class_raw_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy.thy:114:lemma [code]: "toy_class_raw.truncate = toy_class_raw_rec (co4 K toy_class_raw.make)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy.thy:121:lemma [code]: "toy_association.extend = (\<lambda>toy v. toy_association_rec0 (co2 (\<lambda>f. f v) toy_association_ext) toy)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy.thy:125:lemma [code]: "toy_association.make = co2 (\<lambda>f. f ()) toy_association_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Isabelle_Meta_Model/toy_example/embedding/meta_toy/Parser_Toy.thy:128:lemma [code]: "toy_association.truncate = toy_association_rec (co2 K toy_association.make)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Lib/Misc.thy:2682:lemma [code]: "quicksort = quicksort_by_rel (\<le>) []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Tool/Autoref_Tool.thy:189:lemma [autoref_itype]: "CAST ::\<^sub>i I \<rightarrow>\<^sub>i I" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Parametricity/Relators.thy:922:lemma [rel2p]: "rel2p (\<langle>A\<rangle>set_rel) = rel_set (rel2p A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Parametricity/Relators.thy:926:lemma [p2rel]: "left_unique A \<Longrightarrow> p2rel (rel_set A) = (\<langle>p2rel A\<rangle>set_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_Skeleton.thy:36:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_GBG_Code.thy:354:lemma [autoref_op_pat]: "igb_graph.find_lasso_spec \<equiv> op_find_lasso_spec"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_GBG_Code.thy:359:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Find_Path_Impl.thy:352:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_Skeleton_Code.thy:86:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SIFUM_Type_Systems/Security.thy:72:lemma [simp]: "mem =\<^sup>l mem' \<Longrightarrow> mem =\<^bsub>mds\<^esub>\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SIFUM_Type_Systems/Security.thy:75:lemma [simp]: "(\<forall> mds. mem =\<^bsub>mds\<^esub>\<^sup>l mem') \<Longrightarrow> mem =\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Dynamic/BitVector.thy:19:lemma [dest!]: "xs \<preceq>\<^sub>b [] \<Longrightarrow> xs = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/While/Com.thy:57:lemma [dest]:"#:c = 0 \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG.thy:24:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (sourcenode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG.thy:27:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (targetnode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:28:lemma [simp]: "valid_node (_Entry_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:35:lemma [simp]: "valid_node (_Exit_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:52:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:56:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:60:lemma [simp]:"\<lbrakk>valid_edge a; targetnode a \<noteq> (_Exit_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:64:lemma [simp]:"\<lbrakk>valid_edge a; sourcenode a \<noteq> (_Entry_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG_wf.thy:34:lemma [dest!]: "V \<in> Use (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG_wf.thy:37:lemma [dest!]: "V \<in> Def (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/StaticIntra/PDG.thy:208:lemma [simp]: "PDG.PDG_BS sourcenode targetnode valid_edge Def Use
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/StaticIntra/PDG.thy:264:lemma [simp]: "PDG.PDG_BS sourcenode targetnode valid_edge Def Use
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:106:lemma [simp]: "Abs_wf_jvmprog (EP, Phi_EP)\<^bsub>wf\<^esub> = EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:118:lemma [simp]: "Abs_wf_jvmprog (EP, Phi_EP)\<^bsub>\<Phi>\<^esub> = Phi_EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:157:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:162:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Iptables_Semantics/Semantics.thy:582:lemma [code]: "sanity_wf_ruleset \<Gamma> =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Iptables_Semantics/Semantics_Ternary/Matching_Ternary.thy:246:lemma[code_unfold]: "remove_unknowns_generic \<gamma> a (MatchNot (MatchAnd m1 m2)) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/P2S2R.thy:161:lemma [simp]: "p2r bot = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:69:lemma [simp]: "p2pp P \<union> p2pp Q = p2pp (P \<squnion> Q)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:72:lemma [simp]: "p2pp P; p2pp Q = p2pp (P \<sqinter> Q)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:75:lemma [intro!]: "P \<le> Q \<Longrightarrow> \<lceil>P\<rceil> \<subseteq> \<lceil>Q\<rceil>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:78:lemma [simp]: "rdom \<lceil>P\<rceil> = \<lceil>P\<rceil>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Myhill-Nerode/Closures2.thy:101:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Myhill-Nerode/Myhill_2.thy:20:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Propositional_Proof_Systems/Tseytin.thy:187:lemma [code_unfold]: "freshnats.nfresh = nfresh_natcode"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Presburger-Automata/Exec.thy:11:lemma [code_unfold]: "(\<longrightarrow>) = (\<lambda>P. (\<or>) (\<not> P))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Verified-Prover/Prover.thy:715:lemma [simp]: "s_of_ns (ns_of_s s) = s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/XML/Xml.thy:108:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun2.thy:618:lemma [simp]: "nat_to_sch index_of_c_fst = Base_fst" by (unfold index_of_c_fst_def, rule nat_to_sch_srj)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun2.thy:622:lemma [simp]: "nat_to_sch index_of_c_snd = Base_snd" by (unfold index_of_c_snd_def, rule nat_to_sch_srj)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFinSet.thy:790:lemma [simp]: "set_to_nat (nat_to_set u) = u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:25:lemma [simp]: "c_len 0 = 0" by (simp add: c_len_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:279:lemma [simp]: "list_to_nat [] = 0" by (simp add: list_to_nat_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:281:lemma [simp]: "nat_to_list 0 = []" by (simp add: nat_to_list_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:320:lemma [simp]: "c_hd 0 = 0" by (simp add: c_hd_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:398:lemma [simp]: "c_tl 0 = 0" by (simp add: c_tl_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:255:lemma [simp]: "sgn1 0 = 0" by (simp add: sgn1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:256:lemma [simp]: "sgn1 (Suc y) = 1" by (simp add: sgn1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:257:lemma [simp]: "sgn2 0 = 1" by (simp add: sgn2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:258:lemma [simp]: "sgn2 (Suc y) = 0" by (simp add: sgn2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:259:lemma [simp]: "x \<noteq> 0 \<Longrightarrow> sgn1 x = 1" by (simp add: sgn1_def, cases x, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:260:lemma [simp]: "x \<noteq> 0 \<Longrightarrow> sgn2 x = 0" by (simp add: sgn2_def, cases x, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:867:lemma [simp]: "pr_conv_1_to_2 (pr_conv_2_to_1 f) = f" by(simp add: pr_conv_1_to_2_def pr_conv_2_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:868:lemma [simp]: "pr_conv_2_to_1 (pr_conv_1_to_2 f) = f" by(simp add: pr_conv_1_to_2_def pr_conv_2_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:869:lemma [simp]: "pr_conv_1_to_3 (pr_conv_3_to_1 f) = f" by(simp add: pr_conv_1_to_3_def pr_conv_3_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:870:lemma [simp]: "pr_conv_3_to_1 (pr_conv_1_to_3 f) = f" by(simp add: pr_conv_1_to_3_def pr_conv_3_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:871:lemma [simp]: "pr_conv_3_to_2 (pr_conv_2_to_3 f) = f" by(simp add: pr_conv_3_to_2_def pr_conv_2_to_3_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:872:lemma [simp]: "pr_conv_2_to_3 (pr_conv_3_to_2 f) = f" by(simp add: pr_conv_3_to_2_def pr_conv_2_to_3_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Boolean.thy:64:lemma [simp,code_unfold] : "(true \<doteq> false) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Boolean.thy:66:lemma [simp,code_unfold] : "(false \<doteq> true) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:90:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:94:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:99:lemma [simp,code_unfold]: "\<delta> \<zero> = true" by(simp add:OclInt0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:100:lemma [simp,code_unfold]: "\<upsilon> \<zero> = true" by(simp add:OclInt0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:101:lemma [simp,code_unfold]: "\<delta> \<one> = true" by(simp add:OclInt1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:102:lemma [simp,code_unfold]: "\<upsilon> \<one> = true" by(simp add:OclInt1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:103:lemma [simp,code_unfold]: "\<delta> \<two> = true" by(simp add:OclInt2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:104:lemma [simp,code_unfold]: "\<upsilon> \<two> = true" by(simp add:OclInt2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:105:lemma [simp,code_unfold]: "\<delta> \<six> = true" by(simp add:OclInt6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:106:lemma [simp,code_unfold]: "\<upsilon> \<six> = true" by(simp add:OclInt6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:107:lemma [simp,code_unfold]: "\<delta> \<eight> = true" by(simp add:OclInt8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:108:lemma [simp,code_unfold]: "\<upsilon> \<eight> = true" by(simp add:OclInt8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:109:lemma [simp,code_unfold]: "\<delta> \<nine> = true" by(simp add:OclInt9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:110:lemma [simp,code_unfold]: "\<upsilon> \<nine> = true" by(simp add:OclInt9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:91:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:95:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:100:lemma [simp,code_unfold]: "\<delta> \<zero>.\<zero> = true" by(simp add:OclReal0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:101:lemma [simp,code_unfold]: "\<upsilon> \<zero>.\<zero> = true" by(simp add:OclReal0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:102:lemma [simp,code_unfold]: "\<delta> \<one>.\<zero> = true" by(simp add:OclReal1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:103:lemma [simp,code_unfold]: "\<upsilon> \<one>.\<zero> = true" by(simp add:OclReal1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:104:lemma [simp,code_unfold]: "\<delta> \<two>.\<zero> = true" by(simp add:OclReal2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:105:lemma [simp,code_unfold]: "\<upsilon> \<two>.\<zero> = true" by(simp add:OclReal2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:106:lemma [simp,code_unfold]: "\<delta> \<six>.\<zero> = true" by(simp add:OclReal6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:107:lemma [simp,code_unfold]: "\<upsilon> \<six>.\<zero> = true" by(simp add:OclReal6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:108:lemma [simp,code_unfold]: "\<delta> \<eight>.\<zero> = true" by(simp add:OclReal8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:109:lemma [simp,code_unfold]: "\<upsilon> \<eight>.\<zero> = true" by(simp add:OclReal8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:110:lemma [simp,code_unfold]: "\<delta> \<nine>.\<zero> = true" by(simp add:OclReal9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:111:lemma [simp,code_unfold]: "\<upsilon> \<nine>.\<zero> = true" by(simp add:OclReal9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:82:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:86:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:91:lemma [simp,code_unfold]: "\<delta> \<a> = true" by(simp add:OclStringa_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:92:lemma [simp,code_unfold]: "\<upsilon> \<a> = true" by(simp add:OclStringa_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:108:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e None) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:114:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e None) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:120:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e \<lfloor>None\<rfloor>) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:126:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e \<lfloor>None\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Sequence.thy:121:lemma [simp,code_unfold]: "const Sequence{}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Sequence.thy:197:lemma [simp,code_unfold] : "(Sequence{}->including\<^sub>S\<^sub>e\<^sub>q(a)) = (Sequence{}->prepend\<^sub>S\<^sub>e\<^sub>q(a))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Sequence.thy:202:lemma [simp,code_unfold] : "((S->prepend\<^sub>S\<^sub>e\<^sub>q(a))->including\<^sub>S\<^sub>e\<^sub>q(b)) = ((S->including\<^sub>S\<^sub>e\<^sub>q(b))->prepend\<^sub>S\<^sub>e\<^sub>q(a))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:333:lemma [simp,code_unfold]: "const Set{}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1839:lemma [simp,code_unfold]: "Set{} ->size\<^sub>S\<^sub>e\<^sub>t() = \<zero>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1927:lemma [simp,code_unfold]: "Set{}->isEmpty\<^sub>S\<^sub>e\<^sub>t() = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1965:lemma [simp,code_unfold]: "Set{}->notEmpty\<^sub>S\<^sub>e\<^sub>t() = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1979:lemma [simp,code_unfold]: "Set{}->any\<^sub>S\<^sub>e\<^sub>t() = null"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2753:lemma [simp,code_unfold]: "\<delta> (Set{} ->size\<^sub>S\<^sub>e\<^sub>t()) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2757:lemma [simp,code_unfold]: "\<delta> ((X ->including\<^sub>S\<^sub>e\<^sub>t(x)) ->size\<^sub>S\<^sub>e\<^sub>t()) = (\<delta>(X->size\<^sub>S\<^sub>e\<^sub>t()) and \<upsilon>(x))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2812:lemma [simp,code_unfold]: "\<delta> ((X ->excluding\<^sub>S\<^sub>e\<^sub>t(x)) ->size\<^sub>S\<^sub>e\<^sub>t()) = (\<delta>(X->size\<^sub>S\<^sub>e\<^sub>t()) and \<upsilon>(x))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2866:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Bag.thy:329:lemma [simp,code_unfold]: "const Bag{}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Analysis/Analysis_UML.thy:1090:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1) = {oid0,oid1\<^cancel>\<open>,oid2\<close>,oid3,oid4,oid5\<^cancel>\<open>,oid6,oid7\<close>,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Analysis/Analysis_UML.thy:1093:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1') = {oid0,oid1,oid2,oid3\<^cancel>\<open>,oid4\<close>,oid5,oid6,oid7,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Analysis/Analysis_UML.thy:1108:lemma [code_unfold]: "((x::Person) \<doteq> y) = StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t x y" by(simp only: StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t_\<^sub>P\<^sub>e\<^sub>r\<^sub>s\<^sub>o\<^sub>n)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Analysis/Analysis_UML.thy:1109:lemma [code_unfold]: "((x::OclAny) \<doteq> y) = StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t x y" by(simp only: StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t_\<^sub>O\<^sub>c\<^sub>l\<^sub>A\<^sub>n\<^sub>y)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Design/Design_UML.thy:1048:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1) = {oid0,oid1\<^cancel>\<open>,oid2\<close>,oid3,oid4,oid5\<^cancel>\<open>,oid6,oid7\<close>,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Design/Design_UML.thy:1051:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1') = {oid0,oid1,oid2,oid3\<^cancel>\<open>,oid4\<close>,oid5,oid6,oid7,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Design/Design_UML.thy:1066:lemma [code_unfold]: "((x::Person) \<doteq> y) = StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t x y" by(simp only: StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t_\<^sub>P\<^sub>e\<^sub>r\<^sub>s\<^sub>o\<^sub>n)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Design/Design_UML.thy:1067:lemma [code_unfold]: "((x::OclAny) \<doteq> y) = StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t x y" by(simp only: StrictRefEq\<^sub>O\<^sub>b\<^sub>j\<^sub>e\<^sub>c\<^sub>t_\<^sub>O\<^sub>c\<^sub>l\<^sub>A\<^sub>n\<^sub>y)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:77:lemma [simp]: "false (a, b) = \<lfloor>\<lfloor>False\<rfloor>\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:80:lemma [simp]: "true (a, b) = \<lfloor>\<lfloor>True\<rfloor>\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:316:lemma [simp,code_unfold]: "(true \<triangleq> false) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:319:lemma [simp,code_unfold]: "(false \<triangleq> true) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BinarySearchTree/BinaryTree_TacticStyle.thy:107:lemma [simp]: "[| t ~= Tip; sorted t |] ==> sorted(rem t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Mapping_Impl.thy:132:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Examples/TwoSat_Ex.thy:164:lemma [simp]: "consistent {}" by (auto simp: consistent_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Collection_Eq.thy:86:lemma [code]: "CEQ(unit) = Some (\<lambda>_ _. True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/ITP-2013/Benchmark_Set_LC.thy:8:lemma [code_unfold del]: "card \<equiv> Cardinality.card'" by(simp)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/ITP-2013/Benchmark_Set_Default.thy:8:lemma [code]: "equal_class.equal A B \<longleftrightarrow> Cardinality.eq_set A B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/ITP-2013/Benchmark_Default.thy:6:lemma [code]: "test (set xs) P = length (remdups (filter P xs))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Set_Impl.thy:234:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Set_Impl.thy:287:lemma [code_unfold del, symmetric, code_post del]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Set_Impl.thy:291:lemma [code_unfold del, symmetric, code_post del]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Set_Impl.thy:294:lemma [code_unfold del, symmetric, code_post del]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Set_Impl.thy:1841:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Regular-Sets/Regular_Set.thy:29:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Lp/Functional_Spaces.thy:104:lemma [measurable]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Check_Monad.thy:39:lemma [code_unfold]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:151:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:155:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:159:lemma [code]: "Right x = sumbot (Inr x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:161:lemma [code]: "Left x = sumbot (Inl x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:163:lemma [code]: "return x = sumbot (Inr x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:165:lemma [code]: "error x = sumbot (Inl x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Certification_Monads/Strict_Sum.thy:167:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Lazy_Case/Lazy_Case.thy:36:lemma [code_unfold]: "HOL.If P t f = case_bool t f P" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:8:lemma [simp]: "is_terminal t \<Longrightarrow> is_symbol t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:11:lemma [simp]: "is_sentence []" by (auto simp add: is_sentence_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:13:lemma [simp]: "is_word []" by (auto simp add: is_word_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:15:lemma [simp]: "is_word u \<Longrightarrow> is_sentence u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:39:lemma [simp]: "leftderivations1 \<subseteq> derivations1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:234:lemma [simp]: "is_nonterminal N \<Longrightarrow> is_symbol N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:243:lemma [elim]: "Derives1 a i r b \<Longrightarrow> r \<in> \<RR>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Limit.thy:35:lemma[simp]: "funpower id n = id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Limit.thy:38:lemma[simp]: "limit id = id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/LocalLexingLemmas.thy:7:lemma[simp]: "setmonotone (Append Z k)" by (auto simp add: Append_def setmonotone_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/LocalLexingLemmas.thy:74:lemma[simp]: "Append {} k = id" by (auto simp add: Append_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/LocalLexingLemmas.thy:76:lemma[simp]: "k > length Doc \<Longrightarrow> \<P> k v = \<P> k 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jordan_Normal_Form/Gauss_Jordan_IArray_Impl.thy:33:lemma [code]: "mat_swaprows k l (mat_impl A) = (let nr = dim_row_impl A in
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jordan_Normal_Form/Gauss_Jordan_IArray_Impl.thy:76:lemma [code]: "mat_multrow_gen mul k a (mat_impl A) = mat_impl (mat_multrow_gen_impl mul k a A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Native_Word/More_Bits_Int.thy:66:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Native_Word/Uint.thy:326:lemma [code]: "wivs_mask_integer = 2 ^ dflt_size - 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Native_Word/Uint.thy:331:lemma [code]: "wivs_shift_integer = 2 ^ dflt_size"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Native_Word/Uint.thy:341:lemma [code]: "wivs_overflow_integer = 2 ^ (dflt_size - 1)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Native_Word/Uint.thy:346:lemma [code]: "wivs_least_integer = - (2 ^ (dflt_size - 1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:117:lemma [simp]: "wp\<^sub>t (Do f) Q = (\<lambda>s. (\<forall>t \<in> f s. Q t) \<and> f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:120:lemma [simp]: "wp\<^sub>t (c\<^sub>1;c\<^sub>2) R = wp\<^sub>t c\<^sub>1 (wp\<^sub>t c\<^sub>2 R)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:126:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:133:lemma [simp]: "wp\<^sub>t (LOCAL f;c;g) Q = (\<lambda>s. wp\<^sub>t c (Q o (g s)) (f s))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:35:lemma [iff]: "Do f \<down> s = (f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:43:lemma [iff]: "((c\<^sub>1;c\<^sub>2) \<down> s\<^sub>0) = (c\<^sub>1 \<down> s\<^sub>0 \<and> (\<forall>s\<^sub>1. s\<^sub>0 -c\<^sub>1\<rightarrow> s\<^sub>1 \<longrightarrow> c\<^sub>2 \<down> s\<^sub>1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:51:lemma [iff]: "(IF b THEN c\<^sub>1 ELSE c\<^sub>2 \<down> s) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:69:lemma [iff]: "(LOCAL f;c;g \<down> s) = (c \<down> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:92:lemma [simp]: "wp (Do f) Q = (\<lambda>s. \<forall>t \<in> f s. Q(t))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:98:lemma [simp]: "wp (c\<^sub>1;c\<^sub>2) R = wp c\<^sub>1 (wp c\<^sub>2 R)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:104:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:123:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Lang.thy:85:lemma [iff]: "(s -c;d\<rightarrow> u) = (\<exists>t. s -c\<rightarrow> t \<and> t -d\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Lang.thy:88:lemma [iff]: "(s -IF b THEN c ELSE d\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Lang.thy:94:lemma [iff]: "(s -LOCAL f; c; g\<rightarrow> u) = (\<exists>t. f s -c\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:27:lemma [iff]: "(Do f \<down> s) = (f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:35:lemma [iff]: "((c1;c2) \<down> s0) = (c1 \<down> s0 \<and> (\<forall>s1. s0 -c1\<rightarrow> s1 \<longrightarrow> c2 \<down> s1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:43:lemma [iff]: "(IF b THEN c1 ELSE c2 \<down> s) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:61:lemma [iff]: "(CALL \<down> s) = (body \<down> s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:64:lemma [iff]: "(LOCAL f;c;g \<down> s) = (c \<down> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:56:lemma [iff]: "(s -Do f\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:59:lemma [iff]: "(s -c;d\<rightarrow> u) = (\<exists>t. s -c\<rightarrow> t \<and> t -d\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:62:lemma [iff]: "(s -IF b THEN c ELSE d\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:74:lemma [iff]: "(s -CALL\<rightarrow> t) = (s -body\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:77:lemma [iff]: "(s -LOCAL f; c; g\<rightarrow> u) = (\<exists>t. f s -c\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:80:lemma [simp]: "\<not>b s \<Longrightarrow> s -WHILE b DO c\<rightarrow> s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:114:lemma [iff]: "(s -Do f-n\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:117:lemma [iff]: "(s -c1;c2-n\<rightarrow> u) = (\<exists>t. s -c1-n\<rightarrow> t \<and> t -c2-n\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:120:lemma [iff]: "(s -IF b THEN c ELSE d-n\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:126:lemma [iff]: "(s -CALL- 0\<rightarrow> t) = False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:129:lemma [iff]: "(s -CALL-Suc n\<rightarrow> t) = (s -body-n\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:133:lemma [iff]: "(s -LOCAL f; c; g-n\<rightarrow> u) = (\<exists>t. f s -c-n\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:79:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:85:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:91:lemma [iff]: "(\<Turnstile>\<^sub>t {P}CALL{Q}) = (\<Turnstile>\<^sub>t {P}body{Q})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:228:lemma [iff]: "\<not> ([],s) \<rightarrow> u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:345:lemma [iff]: "\<not> inf [] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:352:lemma [iff]: "\<not> inf [Do f] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:361:lemma [iff]: "inf ((c1;c2)#cs) s = inf (c1#c2#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:374:lemma [iff]: "inf ((IF b THEN c1 ELSE c2)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:393:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:415:lemma [iff]: "inf (CALL#cs) s = inf (body#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:429:lemma [iff]: "inf ((LOCAL f;c;g)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:28:lemma [iff]: "(Do f \<down> s) = (f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:36:lemma [iff]: "((c1;c2) \<down> s0) = (c1 \<down> s0 \<and> (\<forall>s1. s0 -c1\<rightarrow> s1 \<longrightarrow> c2 \<down> s1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:44:lemma [iff]: "(IF b THEN c1 ELSE c2 \<down> s) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:62:lemma [iff]: "(CALL p \<down> s) = (body p \<down> s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:65:lemma [iff]: "(LOCAL f;c;g \<down> s) = (c \<down> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:74:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:80:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:86:lemma [iff]: "(\<Turnstile>\<^sub>t {P}CALL p{Q}) = (\<Turnstile>\<^sub>t {P}body p{Q})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:246:lemma [iff]: "\<not> ([],s) \<rightarrow> u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:362:lemma [iff]: "\<not> inf [] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:369:lemma [iff]: "\<not> inf [Do f] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:378:lemma [iff]: "inf ((c1;c2)#cs) s = inf (c1#c2#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:391:lemma [iff]: "inf ((IF b THEN c1 ELSE c2)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:410:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:432:lemma [iff]: "inf (CALL p#cs) s = inf (body p#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:446:lemma [iff]: "inf ((LOCAL f;c;g)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:57:lemma [iff]: "(s -Do f\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:60:lemma [iff]: "(s -c;d\<rightarrow> u) = (\<exists>t. s -c\<rightarrow> t \<and> t -d\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:63:lemma [iff]: "(s -IF b THEN c ELSE d\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:70:lemma [iff]: "(s -CALL p\<rightarrow> t) = (s -body p\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:73:lemma [iff]: "(s -LOCAL f; c; g\<rightarrow> u) = (\<exists>t. f s -c\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:96:lemma [iff]: "(s -Do f-n\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:99:lemma [iff]: "(s -c1;c2-n\<rightarrow> u) = (\<exists>t. s -c1-n\<rightarrow> t \<and> t -c2-n\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:102:lemma [iff]: "(s -IF b THEN c ELSE d-n\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:108:lemma [iff]: "(s -CALL p- 0\<rightarrow> t) = False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:111:lemma [iff]: "(s -CALL p-Suc n\<rightarrow> t) = (s -body p-n\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:114:lemma [iff]: "(s -LOCAL f; c; g-n\<rightarrow> u) = (\<exists>t. f s -c-n\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MiniML/Type.thy:557:lemma [simp]: "new_tv n t \<Longrightarrow> new_tv (Suc n) t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dijkstra_Shortest_Path/Dijkstra_Impl_Adet.thy:151:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Well_Quasi_Orders/Kruskal_Examples.thy:19:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Well_Quasi_Orders/Kruskal_Examples.thy:125:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Well_Quasi_Orders/Kruskal_Examples.thy:130:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_While/Bernoulli.thy:56:lemma [simp]: assumes "0 \<le> p" "p \<le> 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Berlekamp_Zassenhaus/Finite_Field.thy:162:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Berlekamp_Zassenhaus/Finite_Field.thy:166:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FinFun/FinFun.thy:1256:lemma [code nbe]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FinFun/FinFunPred.thy:119:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Rank.thy:103:lemma [simp]: "rank 0 = 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Ordinal.thy:257:lemma [simp]: "succ k \<noteq> 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Finite_Automata.thy:77:lemma [simp]: "init (Reverse fsm) = final fsm"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Finite_Automata.thy:80:lemma [simp]: "final (Reverse fsm) = init fsm"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Impl/IICF_Array_List.thy:217:lemma [def_pat_rules]: "op_arl_empty_sz$N \<equiv> UNPROTECT (op_arl_empty_sz N)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Map.thy:71:lemma [synth_rules]: "\<lbrakk>INTF_OF_REL K TYPE('k); INTF_OF_REL V TYPE('v)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Multiset.thy:193:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Multiset.thy:202:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_List.thy:104:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Prio_Bag.thy:133:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:47:lemma [safe_constraint_rules]: "IS_BELOW_ID R \<Longrightarrow> IS_BELOW_ID (\<langle>R\<rangle>infty_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:59:lemma [sepref_monadify_arity]: "case_infty \<equiv> \<lambda>\<^sub>2f1 f2 x. SP case_infty$f1$(\<lambda>\<^sub>2x. f2$x)$x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:61:lemma [sepref_monadify_comb]: "case_infty$f1$f2$x \<equiv> (\<bind>)$(EVAL$x)$(\<lambda>\<^sub>2x. SP case_infty$f1$f2$x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:62:lemma [sepref_monadify_comb]: "EVAL$(case_infty$f1$(\<lambda>\<^sub>2x. f2 x)$x)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_NDFS.thy:28:lemma [sepref_fr_rules]: "hn_refine
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_NDFS.thy:40:lemma [sepref_fr_rules]: "hn_refine
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Graph.thy:19:lemma [pat_rules]: "((``))$E$(insert$u${}) \<equiv> op_graph_succ$E$u" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Graph.thy:60:lemma [intf_of_assn]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Intf_Util.thy:88:lemma [fcomp_norm_simps]: "CONSTRAINT (IS_PURE \<Phi>) P \<Longrightarrow> pure (the_pure P) = P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Intf_Util.thy:91:lemma [fcomp_norm_simps]: "CONSTRAINT (IS_PURE P) A \<Longrightarrow> P (the_pure A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Foreach.thy:224:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Foreach.thy:793:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Foreach.thy:814:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:28:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:37:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:150:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:164:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:174:lemma [safe_constraint_rules]: "IS_LEFT_TOTAL R \<Longrightarrow> IS_LEFT_TOTAL (\<langle>R\<rangle>list_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:185:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:198:lemma [safe_constraint_rules]: "IS_RIGHT_TOTAL R \<Longrightarrow> IS_RIGHT_TOTAL (\<langle>R\<rangle>list_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:209:lemma [constraint_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:216:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:226:lemma [constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:261:lemma [constraint_rules]: "\<lbrakk>single_valued R; single_valued (R\<inverse>)\<rbrakk> \<Longrightarrow> IS_PRES_EQ R"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:510:lemma [sepref_relprops_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:523:lemma [sepref_relprops_transform]: "single_valued (R\<inverse>) = IS_LEFT_UNIQUE R"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:913:lemma [pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1331:lemma [sepref_fr_rules]: "(return o Inl,RETURN o Inl) \<in> A\<^sup>d \<rightarrow>\<^sub>a sum_assn A B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1333:lemma [sepref_fr_rules]: "(return o Inr,RETURN o Inr) \<in> B\<^sup>d \<rightarrow>\<^sub>a sum_assn A B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1339:lemma [sepref_monadify_arity]: "case_sum \<equiv> \<lambda>\<^sub>2f1 f2 x. SP case_sum$(\<lambda>\<^sub>2x. f1$x)$(\<lambda>\<^sub>2x. f2$x)$x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1343:lemma [sepref_monadify_comb]: "case_sum$f1$f2$x \<equiv> (\<bind>) $(EVAL$x)$(\<lambda>\<^sub>2x. SP case_sum$f1$f2$x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1346:lemma [sepref_monadify_comb]: "EVAL$(case_sum$(\<lambda>\<^sub>2x. f1 x)$(\<lambda>\<^sub>2x. f2 x)$x)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:270:lemma [simp]: "final(Val v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:273:lemma [simp]: "final(throw e) = (\<exists>r. e = ref r)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:279:lemma [iff]: "finals []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:282:lemma [iff]: "finals (Val v # es) = finals es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:306:lemma [iff]: "finals (map Val vs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:309:lemma [iff]: "finals (throw e # es) = (\<exists>r. e = ref r)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Objects.thy:54:lemma [simp]: "obj_ty (C,S) = Class C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:29:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:283:lemma[simp]: "((e,s),e',s') \<in> Red P E = P,E \<turnstile> \<langle>e,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:286:lemma[simp]: "((es,s),es',s') \<in> Reds P E = P,E \<turnstile> \<langle>es,s\<rangle> [\<rightarrow>] \<langle>es',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:337:lemma [iff]: "\<not> P,E \<turnstile> \<langle>[],s\<rangle> [\<rightarrow>] \<langle>es',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:340:lemma [iff]: "\<not> P,E \<turnstile> \<langle>Val v,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:343:lemma [iff]: "\<not> P,E \<turnstile> \<langle>Throw r,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Progress.thy:150:lemma [iff]: "P,E,h \<turnstile> e\<^sub>1;;e\<^sub>2 :' T\<^sub>2 = (\<exists>T\<^sub>1. P,E,h \<turnstile> e\<^sub>1:' T\<^sub>1 \<and> P,E,h \<turnstile> e\<^sub>2:' T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Progress.thy:157:lemma [iff]: "P,E,h \<turnstile> Val v :' T = (P \<turnstile> typeof\<^bsub>h\<^esub> v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Progress.thy:164:lemma [iff]: "P,E,h \<turnstile> Var V :' T = (E V = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellTypeRT.thy:169:lemma [simp]: "\<forall>Ts. (P,E,h \<turnstile> es\<^sub>1 @ es\<^sub>2 [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Exceptions.thy:41:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:50:lemma [simp]: "(typeof v = Some Boolean) = (\<exists>b. v = Bool b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:53:lemma [simp]: "(typeof v = Some Integer) = (\<exists>i. v = Intg i)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:56:lemma [simp]: "(typeof v = Some NT) = (v = Null)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:59:lemma [simp]: "(typeof v = Some Void) = (v = Unit)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/TypeSafe.thy:221:lemma [iff]: "\<And>A. \<lbrakk> length Vs = length Ts; length vs = length Ts\<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Expr.thy:56:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Expr.thy:93:lemma [simp]: "fvs(es\<^sub>1 @ es\<^sub>2) = fvs es\<^sub>1 \<union> fvs es\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Expr.thy:96:lemma [simp]: "fvs(map Val vs) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Execute.thy:237:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Execute.thy:251:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Execute.thy:273:lemma [code_pred_intro]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Type.thy:47:lemma [iff]: "is_refT NT"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Type.thy:50:lemma [iff]: "is_refT(Class C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:115:lemma [iff]: "(P,E \<turnstile> [] [::] Ts) = (Ts = [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:122:lemma [iff]: "(P,E \<turnstile> e#es [::] T#Ts) = (P,E \<turnstile> e :: T \<and> P,E \<turnstile> es [::] Ts)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:129:lemma [iff]: "(P,E \<turnstile> (e#es) [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:137:lemma [iff]: "\<And>Ts. (P,E \<turnstile> es\<^sub>1 @ es\<^sub>2 [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:154:lemma [iff]: "P,E \<turnstile> Val v :: T = (typeof v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:161:lemma [iff]: "P,E \<turnstile> Var V :: T = (E V = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:168:lemma [iff]: "P,E \<turnstile> e\<^sub>1;;e\<^sub>2 :: T\<^sub>2 = (\<exists>T\<^sub>1. P,E \<turnstile> e\<^sub>1::T\<^sub>1 \<and> P,E \<turnstile> e\<^sub>2::T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:175:lemma [iff]: "(P,E \<turnstile> {V:T; e} :: T') = (is_type P T \<and> P,E(V\<mapsto>T) \<turnstile> e :: T')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:38:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> A = A \<and> A \<squnion> \<lfloor>{}\<rfloor> = A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:41:lemma [simp]: "\<lfloor>A\<rfloor> \<squnion> \<lfloor>B\<rfloor> = \<lfloor>A \<union> B\<rfloor> \<and> \<lfloor>A\<rfloor> \<ominus> a = \<lfloor>A - {a}\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:44:lemma [simp]: "None \<squnion> A = None \<and> A \<squnion> None = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:47:lemma [simp]: "a \<in>\<in> None \<and> None \<ominus> a = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Stern_Brocot/Bird_Tree.thy:68:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Stern_Brocot/Bird_Tree.thy:73:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Language_Semantics.thy:553:lemma [simp]: "(n::nat) < N \<Longrightarrow> 0 \<le> 1 / N" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Language_Semantics.thy:555:lemma [simp]: "(n::nat) < N \<Longrightarrow> 1 / N \<le> 1" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Language_Semantics.thy:557:lemma [simp]: "(n::nat) < N \<Longrightarrow> 0 \<le> 1 - 1 / N" by (simp add: divide_simps)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Concrete.thy:12:lemma [simp]: "\<And> l. l \<noteq> Hi \<longleftrightarrow> l = Lo" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Concrete.thy:18:lemma [dest]: "\<And> l A. \<lbrakk>l \<in> A; Lo \<notin> A\<rbrakk> \<Longrightarrow> l = Hi" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:54:lemma [autoref_op_pat_def]: "ST xs \<equiv> OP (ST xs)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:55:lemma [autoref_rules]: "(x, ST x) \<in> string_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:115:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:130:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:173:lemma [autoref_op_pat]: "(\<union>) \<equiv> OP op_union_phantom"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1070:lemma [autoref_rules]: "(euler_incr_fas', euler_incr_fas') \<in> nat_rel \<rightarrow> fas_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1110:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1236:lemma [autoref_op_pat_def]: "DIM('a) \<equiv> OP (op_DIM TYPE('a::executable_euclidean_space))" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1521:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2773:lemma [autoref_rules]: "(sgn, sgn) \<in> rnv_rel \<rightarrow> rnv_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2790:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2969:lemma [autoref_op_pat]: "fst ` X \<equiv> OP op_image_fst_colle $ X"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2972:lemma [autoref_op_pat]: "fst ` X \<equiv> OP op_image_fste $ X"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3048:lemma [autoref_op_pat]: "(`) flow1_of_vec1 \<equiv> OP op_image_flow1_of_vec1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3073:lemma [autoref_op_pat]: "(`) fst \<equiv> OP op_image_fst"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3124:lemma [autoref_op_pat]: "X \<times> UNIV \<equiv> OP op_times_UNIV $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3254:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3449:lemma [autoref_op_pat_def]: "embed1 ` X \<equiv> OP op_image_embed1 $ X"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3580:lemma [autoref_op_pat]: "(`) fst \<equiv> OP op_image_fst_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3617:lemma [autoref_op_pat]: "(`) flow1_of_vec1 \<equiv> OP op_image_flow1_of_vec1_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4581:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4592:lemma [autoref_rules]: "(RETURN, get_plane) \<in> \<langle>A\<rangle>plane_rel \<rightarrow> \<langle>\<langle>A\<rangle>sctn_rel\<rangle>nres_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4595:lemma [autoref_op_pat del]: "{} \<equiv> OP op_empty_default" "{} \<equiv> OP op_empty_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4713:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4964:lemma [autoref_rules]: "(adapt_stepsize_fa, adapt_stepsize_fa) \<in> rnv_rel \<rightarrow> rnv_rel \<rightarrow> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5061:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5107:lemma [autoref_rules]: "(max_intersection_step, max_intersection_step)\<in> (reach_optns_rel) \<rightarrow> rnv_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5246:lemma [autoref_op_pat]: "(\<subseteq>) \<equiv> OP op_subset_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5264:lemma [autoref_op_pat]: "(=) \<equiv> OP op_eq_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5280:lemma [autoref_itype]: "eq_spec ::\<^sub>i A \<rightarrow>\<^sub>i A \<rightarrow>\<^sub>i \<langle>i_bool\<rangle>\<^sub>ii_nres" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5304:lemma [autoref_op_pat_def del]: "get_inter p \<equiv> OP (get_inter p)" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5315:lemma [THEN order_trans, refine_vcg]: "select_with_inter ci a \<le> SPEC (\<lambda>_. True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5591:lemma [autoref_op_pat_def]: "GSPEC x \<equiv> OP (GSPEC x)" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:6230:lemma [autoref_op_pat]: "X \<times> UNIV \<equiv> OP op_times_UNIV_coll $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:6241:lemma [autoref_op_pat]: "X \<inter> Y \<times> UNIV \<equiv> OP op_inter_fst $ X $ Y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:7144:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:7822:lemma [le, refine_vcg]: "op_image_fst_ivl_coll X \<le> SPEC (\<lambda>R. R = fst ` X)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:7998:lemma [autoref_rules_raw del]: "(norm2_slp, norm2_slp) \<in> nat_rel \<rightarrow> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8002:lemma [autoref_rules]: "(norm2_slp, norm2_slp) \<in> nat_rel \<rightarrow> slp_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8027:lemma [autoref_rules_raw]: "DIM_precond TYPE(real) (Suc 0)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8029:lemma [autoref_rules]: "(ereal, ereal) \<in> rnv_rel \<rightarrow> ereal_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8111:lemma [autoref_rules]: "(\<infinity>, \<infinity>) \<in> ereal_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8512:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9185:lemma [autoref_op_pat]: "a \<times> b \<equiv> OP op_times_ivl $ a $ b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9197:lemma [autoref_op_pat_def]: "default_rep d \<equiv> OP (default_rep d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9270:lemma [autoref_itype]: "compact ::\<^sub>i A \<rightarrow>\<^sub>i i_bool"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9278:lemma [autoref_itype del]: "ivl_rep_of_set ::\<^sub>i i_appr \<rightarrow>\<^sub>i \<langle>\<langle>i_rnv, i_rnv\<rangle>\<^sub>ii_prod\<rangle>\<^sub>ii_nres"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9558:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Example_Utilities.thy:1899:lemma [code_computation_unfold]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Example_Utilities.thy:1902:lemma [code_computation_unfold]: "numeral x \<equiv> Float (Code_Target_Int.positive x) 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Example_Utilities.thy:2675:lemma [nth_list_eq_theorems]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Vector_List.thy:140:lemma [autoref_rules]: "(sum_list, sum_list) \<in> \<langle>rnv_rel\<rangle>list_rel \<rightarrow> rnv_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:114:lemma [autoref_op_pat_def]: "nres_of_nress P x \<equiv> (OP (nres_of_nress P) $ x)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:152:lemma [autoref_op_pat_def]: "PAR_IMAGE P \<equiv> OP (PAR_IMAGE P)" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:153:lemma [autoref_rules]: "(Parallel.map, Parallel.map) \<in> (A \<rightarrow> B) \<rightarrow> \<langle>A\<rangle>list_rel \<rightarrow> \<langle>B\<rangle>list_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:278:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:830:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:915:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:998:lemma [autoref_op_pat]: "(\<union>) \<equiv> OP op_union_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1145:lemma [autoref_op_pat]: "Union \<equiv> OP op_Union_default"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1164:lemma [autoref_op_pat]: "Union \<equiv> OP op_Union_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1193:lemma [autoref_itype]: "is_empty ::\<^sub>i A \<rightarrow>\<^sub>i i_bool"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1197:lemma [autoref_op_pat]: "is_empty \<equiv> OP op_coll_is_empty"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1222:lemma [autoref_op_pat]: "is_empty \<equiv> OP op_info_is_empty"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1341:lemma [autoref_op_pat_def]: "get_invar p \<equiv> OP (get_invar p)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1353:lemma [autoref_op_pat]: "mk_inter \<equiv> OP (mk_inter)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1355:lemma [autoref_op_pat]: "mk_inter \<equiv> OP (mk_inter_coll)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1469:lemma [autoref_op_pat]: "atLeastAtMost \<equiv> OP op_atLeastAtMost_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1577:lemma [autoref_op_pat]: "(\<inter>) \<equiv> OP op_inter_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1587:lemma [autoref_op_pat]: "(\<inter>) \<equiv> OP op_inter_ivl_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1890:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:2041:lemma [autoref_op_pat_def]: "concat ` listset xs \<equiv> OP op_concat_listset $ xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:2167:lemma [autoref_op_pat]: "atLeastAtMost \<equiv> OP op_atLeastAtMost_appr"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:2211:lemma [autoref_rules]: "(optns, optns) \<in> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3008:lemma [autoref_itype]: "op_set_isEmpty ::\<^sub>i \<langle>L, \<langle>A\<rangle>\<^sub>ii_ivl\<rangle>\<^sub>ii_coll \<rightarrow>\<^sub>i i_bool"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3356:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3396:lemma [autoref_op_pat_def]: "list_of_eucl ` X \<equiv> OP op_list_of_eucl_image $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3405:lemma [autoref_op_pat_def]: "eucl_of_list ` X \<equiv> OP op_eucl_of_list_image $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3417:lemma [autoref_op_pat_def]: "take n ` X \<equiv> OP op_take_image $ n $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3479:lemma [autoref_op_pat_def]: "drop n ` X \<equiv> OP op_drop_image $ n $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3670:lemma [autoref_op_pat_def]: "approx_slp_appr fas \<equiv> OP (approx_slp_appr fas)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3694:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3711:lemma [autoref_rules]: "(norm2_slp, norm2_slp) \<in> nat_rel \<rightarrow> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3740:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Transfer_Euclidean_Space_Vector.thy:367:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Transfer_Euclidean_Space_Vector.thy:489:lemma [transfer_rule]: "bi_total rel_ve"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Transfer_Euclidean_Space_Vector.thy:495:lemma [transfer_rule]: "bi_unique rel_ve"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics_Aform.thy:553:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Autoref_Misc.thy:202:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Autoref_Misc.thy:387:lemma [autoref_op_pat_def]: "x \<equiv> Autoref_Tagging.OP x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_Folds.thy:53:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_String.thy:8:lemma [autoref_itype]: "Char b0 b1 b2 b3 b4 b5 b6 b7 ::\<^sub>i I"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_String.thy:47:lemma [autoref_itype]: "String.empty_literal ::\<^sub>i I"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_String.thy:52:lemma [autoref_itype]: "String.Literal b0 b1 b2 b3 b4 b5 b6 s ::\<^sub>i I"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Weak_Set.thy:715:lemma [autoref_itype]: "isEmpty_spec::\<^sub>i A \<rightarrow>\<^sub>i \<langle>i_bool\<rangle>\<^sub>ii_nres"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/ODE_Auxiliarities.thy:36:lemma [simp]: "fstzero (a, b) = (a, 0)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/ODE_Auxiliarities.thy:42:lemma [simp]: "zerosnd (a, b) = (0, b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:43:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:48:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:55:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:64:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:73:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:312:lemma [simp]: "length conefield_propagation_slp = 51"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:379:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:384:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:413:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:679:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:961:lemma [autoref_rules]: includes autoref_syntax shows "(\<lambda>_. (), \<Gamma>\<^sub>i\<^sub>v) \<in> bool_rel \<rightarrow> ghost_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1103:lemma [autoref_rules]: "((), \<Gamma>\<^sub>v) \<in> ghost_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1146:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1152:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1292:lemma [simp]: "(x, x') \<in> aform.appr_rel \<Longrightarrow> aform.ncc x'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1335:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1407:lemma [autoref_rules_raw]: "DIM(real \<times> real \<times> real) = DIM((real, 3) vec)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1547:lemma [code]: "isinfloat (real_of_float x) = True"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1571:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1575:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1584:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1593:lemma [autoref_rules_raw]: "DIM_precond TYPE(real \<times> real \<times> real) (OP 3 ::: nat_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1747:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1752:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1795:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1822:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1871:lemma [autoref_op_pat_def del]: "aform.subset_spec_plane optns \<equiv> OP (aform.subset_spec_plane optns)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1875:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1996:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:2449:lemma [continuous_intros]: "isCont (lorenz_S::_\<Rightarrow>R3) x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:2652:lemma [simp]: "expansion (mirror_result res) = expansion res"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Complx/ex/SumArr.thy:239:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Definition.thy:111:lemma [mono]:"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Definition.thy:116:lemma [mono]: "case_prod f p = f (fst p) (snd p)" by (simp add: split_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:64:lemma [simp]: "(class_name cld dcl) = (class_name_f cld = dcl)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:73:lemma [simp]: "(superclass_name cld cl) = (superclass_name_f cld = cl)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:82:lemma [simp]: "(class_fields cld fds) = (class_fields_f cld = fds)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:91:lemma [simp]: "(class_methods cld fds) = (class_methods_f cld = fds)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:101:lemma [simp]: "(method_name md m) = (method_name_f md = m)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:116:lemma [simp]: "(distinct_names P) = (distinct_names_f P)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:134:lemma [simp]: "(find_cld P ctx fqn ctxcld_opt) = (find_cld_f P ctx fqn = ctxcld_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:162:lemma [simp]: "(find_type P ctx cl ty_opt) = (find_type_f P ctx cl = ty_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:218:lemma [simp]: "(find_path_rec P ctx cl path path_opt) = (find_path_rec_f P ctx cl path = path_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:235:lemma [simp]: "(find_path P ctx cl path_opt) = (find_path_f P ctx cl = path_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:247:lemma [simp]: "(find_path_ty P ty ctxclds_opt) = (find_path_ty_f P ty = ctxclds_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:280:lemma [simp]: "\<forall>fs. (fields_in_path ctxclds fs) = (fields_in_path_f ctxclds = fs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:304:lemma [simp]: "\<forall>fs_opt. (fields P ty fs_opt) = (fields_f P ty = fs_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:336:lemma [simp]: "\<forall>meths. (methods_in_path clds meths) = (methods_in_path_f clds = meths)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:363:lemma [simp]: "(methods P ty meths) = (methods_f P ty = Some meths)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:378:lemma [simp]: "(ftype_in_fds P ctx fds f ty_opt) = (ftype_in_fds_f P ctx fds f = ty_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:401:lemma [simp]: "(ftype_in_path P ctxclds f ty_opt) = (ftype_in_path_f P ctxclds f = ty_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:419:lemma [simp]: "(ftype P ty f ty') = (ftype_f P ty f = Some ty')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:433:lemma [simp]: "(find_meth_def_in_list mds m md_opt) = (find_meth_def_in_list_f mds m = md_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:451:lemma [simp]: "(find_meth_def_in_path ctxclds m ctxmeth_def_opt) = (find_meth_def_in_path_f ctxclds m = ctxmeth_def_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:466:lemma [simp]: "(find_meth_def P ty m ctxmd_opt) = (find_meth_def_f P ty m = ctxmd_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:535:lemma [simp]: "(mtype P ty m mty) = (mtype_f P ty m = Some mty)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:579:lemma [simp]: "(sty_one P ty ty') = (is_sty_one P ty ty' = Some True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:792:lemma [simp]: "(sty_many P tys tys') = (is_sty_many P tys tys' = Some True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:833:lemma [simp]: "(\<forall>x\<in>set s_s'_list. case x of (s_XXX, s_') \<Rightarrow> tr_s T s_XXX s_' \<and> tr_s_f T s_XXX = s_') \<longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:837:lemma [simp]: "(\<forall>x\<in>set y_y'_list. case_prod (\<lambda>y_XXX. (=) (case T y_XXX of None \<Rightarrow> y_XXX | Some x' \<Rightarrow> x')) x) \<longrightarrow> map (tr_x T) (map fst y_y'_list) = map snd y_y'_list"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:842:lemma [iff]: "length ss = length (tr_ss_f T ss)" by (induct ss, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1387:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1401:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1413:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1419:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1427:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:70:lemma [iff]: "(P \<turnstile> T \<le> Void) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:73:lemma [iff]: "(P \<turnstile> T \<le> Boolean) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:76:lemma [iff]: "(P \<turnstile> T \<le> Integer) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:79:lemma [iff]: "(P \<turnstile> Void \<le> T) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:82:lemma [iff]: "(P \<turnstile> Boolean \<le> T) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:85:lemma [iff]: "(P \<turnstile> Integer \<le> T) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:101:lemma [iff]: "(P \<turnstile> T \<le> NT) = (T = NT)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:506:lemma [simp]: "P \<turnstile> C has_fields FDTs \<Longrightarrow> fields P C = FDTs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/WellForm.thy:70:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/WellForm.thy:77:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/Exceptions.thy:58:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/Exceptions.thy:161:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/Value.thy:83:lemma [iff]: "is_Ref Null" by (simp add: is_Ref_def2)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:213:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:218:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:223:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:228:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:233:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:238:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:243:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:248:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:254:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:260:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:266:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:271:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:276:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:283:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:289:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/StartConfig.thy:145:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/BV/BCVExec.thy:51:lemma [code]: "states P mxs mxl = fst(sl P mxs mxl)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/DFA/LBVComplete.thy:18:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/DFA/SemilatAlg.thy:41:lemma [iff]: "{} {\<sqsubseteq>\<^bsub>r\<^esub>} B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/DFA/SemilatAlg.thy:44:lemma [iff]: "(A {\<sqsubseteq>\<^bsub>r\<^esub>} {}) = (A = {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/SmallStep.thy:451:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/SmallStep.thy:459:lemma [iff]: "\<not> extTA,P,t \<turnstile> \<langle>Throw a, s\<rangle> -ta\<rightarrow> \<langle>e', s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/WellTypeRT.thy:167:lemma [simp]: "(P,E,h \<turnstile> es\<^sub>1 @ es\<^sub>2 [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:193:lemma [simp]: "fvs(es @ es') = fvs es \<union> fvs es'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:196:lemma [simp]: "fvs(map Val vs) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:313:lemma [simp]: "(is_addr e) \<longleftrightarrow> (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:348:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:383:lemma [iff]: "finals []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:386:lemma [iff]: "finals (Val v # es) = finals es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:392:lemma [iff]: "finals (throw e # es) = (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:42:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> A = A \<and> A \<squnion> \<lfloor>{}\<rfloor> = A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:45:lemma [simp]: "\<lfloor>A\<rfloor> \<squnion> \<lfloor>B\<rfloor> = \<lfloor>A \<union> B\<rfloor> \<and> \<lfloor>A\<rfloor> \<ominus> a = \<lfloor>A - {a}\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:48:lemma [simp]: "None \<squnion> A = None \<and> A \<squnion> None = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:51:lemma [simp]: "a \<in>\<in> None \<and> None \<ominus> a = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:63:lemma [iff]: "A \<sqsubseteq> None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:66:lemma [simp]: "A \<sqsubseteq> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:69:lemma [iff]: "\<lfloor>A\<rfloor> \<sqsubseteq> \<lfloor>B\<rfloor> \<longleftrightarrow> A \<subseteq> B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:86:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> B = B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:89:lemma [simp]: "\<lfloor>{}\<rfloor> \<sqsubseteq> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Framework/FWSemantics.thy:102:lemma [iff]: "t \<in> final_threads s = final_thread s t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Framework/FWSemantics.thy:105:lemma [pred_set_conv]: "final_thread s = (\<lambda>t. t \<in> final_threads s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:47:lemma [simp]: "is_class (compP f P) C = is_class P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:51:lemma [simp]: "class (compP f P) C = map_option (\<lambda>c. snd(compC f (C,c))) (class P C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:87:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:141:lemma [simp]: "subcls1(compP f P) = subcls1 P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:144:lemma [simp]: "is_type (compP f P) T = is_type P T"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:154:lemma [simp]: "(compP f P \<turnstile> Ts [\<le>] Ts') = (P \<turnstile> Ts [\<le>] Ts')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:167:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:199:lemma [simp]: "fields (compP f P) C = fields P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:203:lemma [simp]: "(compP f P \<turnstile> C sees F:T (fm) in D) = (P \<turnstile> C sees F:T (fm) in D)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:207:lemma [simp]: "field (compP f P) F D = field P F D"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:213:lemma [iff]: "distinct_fst (classes (compP f P)) = distinct_fst (classes P)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:224:lemma [iff]: "distinct_fst (map (compM f) ms) = distinct_fst ms"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:233:lemma [iff]: "wf_syscls (compP f P) = wf_syscls P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:236:lemma [iff]: "wf_fdecl (compP f P) = wf_fdecl P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/CallExpr.thy:89:lemma [dest]: "\<lbrakk> inline_calls e es = map Val vs; calls es = \<lfloor>aMvs\<rfloor> \<rbrakk> \<Longrightarrow> is_val e"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:34:lemma [simp]: "pc < pc\<^sub>0 \<or> pc\<^sub>0+size(compE2 e) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxE2 e pc\<^sub>0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:37:lemma [simp]: "pc < pc0 \<or> pc0+size(compEs2 es) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxEs2 es pc0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:40:lemma [simp]: "pc1 + size(compE2 e1) \<le> pc2 \<Longrightarrow> pcs(compxE2 e1 pc1 d1) \<inter> pcs(compxE2 e2 pc2 d2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:43:lemma [simp]: "pc\<^sub>1 + size(compE2 e) \<le> pc\<^sub>2 \<Longrightarrow> pcs(compxE2 e pc\<^sub>1 d\<^sub>1) \<inter> pcs(compxEs2 es pc\<^sub>2 d\<^sub>2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:29:lemma [simp]: "index (xs @ [x]) x = size xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:33:lemma [simp]: "(index (xs @ [x]) y = size xs) = (x = y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:37:lemma [simp]: "x \<in> set xs \<Longrightarrow> xs ! index xs x = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:41:lemma [simp]: "x \<notin> set xs \<Longrightarrow> index xs x = size xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:57:lemma [simp]: "\<lbrakk> y \<in> set xs; x \<noteq> y \<rbrakk> \<Longrightarrow> index (xs @ [x]) y = index xs y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:78:lemma [simp]: "x \<in> set xs \<or> y \<in> set xs \<Longrightarrow> (index xs x = index xs y) = (x = y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:113:lemma [simp]: "hidden xs i \<Longrightarrow> hidden (xs@[x]) i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/JVMTau.thy:332:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/JVMTau.thy:419:lemma [simp]: fixes e :: "'addr expr1" and es :: "'addr expr1 list"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/J0J1Bisim.thy:743:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/J0J1Bisim.thy:801:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:655:lemma [iff]: "xcpt_app i P pc mxs [] \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:659:lemma [simp]: "xcpt_eff i P pc \<tau> [] = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1391:lemma [simp]: "app\<^sub>i (i, compP f P, pc, mpc, T, \<tau>) = app\<^sub>i (i, P, pc, mpc, T, \<tau>)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1405:lemma [simp]: "is_relevant_entry (compP f P) i = is_relevant_entry P i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1412:lemma [simp]: "relevant_entries (compP f P) i pc xt = relevant_entries P i pc xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1415:lemma [simp]: "app i (compP f P) mpc T pc mxl xt \<tau> = app i P mpc T pc mxl xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1420:lemma [simp]: "app i P mpc T pc mxl xt \<tau> \<Longrightarrow> eff i (compP f P) pc xt \<tau> = eff i P pc xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1426:lemma [simp]: "widen (compP f P) = widen P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1431:lemma [simp]: "compP f P \<turnstile> \<tau> \<le>' \<tau>' = P \<turnstile> \<tau> \<le>' \<tau>'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1434:lemma [simp]: "compP f P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s = P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CRDT/Ordered_List.thy:211:lemma [elim!, dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Perron_Frobenius/HMA_Connect.thy:242:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Perron_Frobenius/HMA_Connect.thy:248:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/Examples/Eg1.thy:186:lemma [simp]: "pred_entailment P {}" by(simp add: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/Examples/Eg1.thy:187:lemma [simp]: "e \<in> P \<Longrightarrow> pred_entailment P {e}" by(blast intro: subset_entailment)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/Examples/Eg1.thy:188:lemma [simp]: "FF \<in> P \<Longrightarrow> pred_entailment P Q" by(auto simp: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1290:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1312:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1316:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1320:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1328:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1361:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Call_Arity/TTree.thy:51:lemma [simp]: "downset {[]}" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Call_Arity/ArityAnalysisCorrDenotational.thy:12:lemma [simp]: "eq 0 v v' \<longleftrightarrow> v = v'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Call_Arity/SestoftCorrect.thy:263:lemma[simp]: "Arg x \<notin> range Dummy" "Upd x \<notin> range Dummy" "Alts e\<^sub>1 e\<^sub>2 \<notin> range Dummy" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LinearQuantifierElim/Thys/CertLin.thy:65:lemma [simp]: "(c#cs) \<odot>\<^sub>a (a#as) = (c *\<^sub>a a) + cs \<odot>\<^sub>a as"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/RSAPSS/EMSAPSS.thy:356:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InformationFlowSlicing_Inter/LiftingInter.thy:55:lemma [simp]:"\<not> lift_valid_edge valid_edge src trg knd E X (Node E,et,Node X)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LambdaMu/Reduction.thy:45:lemma [intro]: "c \<^sub>C\<longlonglongrightarrow> d \<Longrightarrow> c \<^sub>C\<longlonglongrightarrow>\<^sup>* d"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:750:lemma [code]: "isEmpty t = (case t of Empty \<Rightarrow> True | _ \<Rightarrow> False)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2069:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2073:lemma [simp, code abstype]: "Abs_FingerTree (Rep_FingerTree t) = t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2083:lemma [simp, code abstype]: "Abs_viewres (Rep_viewres x) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2101:lemma [code abstract]: "Rep_FingerTree (extract_viewres_t r) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2120:lemma [simp, code abstype]: "Abs_splitres (Rep_splitres x) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2131:lemma [code abstract]: "Rep_FingerTree (extract_splitres_l r) = (case
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2139:lemma [code abstract]: "Rep_FingerTree (extract_splitres_r r) = (case
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:109:lemma [simp]: "vertices ((f::face)\<^bsup>op\<^esup>) = (vertices f)\<^bsup>op\<^esup>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:111:lemma [simp]: "xs \<noteq> [] \<Longrightarrow> hd (rev xs)= last xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:223:lemma[simp]: "0 \<le> tri g v" by (simp add: tri_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:225:lemma[simp]: "0 \<le> quad g v" by (simp add: quad_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:227:lemma[simp]: "0 \<le> except g v" by (simp add: except_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Generator.thy:41:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Generator.thy:53:lemma [code]: "deleteAround g v ps =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/PlaneGraphIso.thy:36:lemma [iff]: "((x,y) \<in> {\<cong>}) = x \<cong> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/PlaneGraphIso.thy:634:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/PlaneGraphIso.thy:692:lemma [simp]: "m++m' ` (dom m' - A) = m' ` (dom m' - A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ScoreProps.thy:146:lemma [iff]: "separated g {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListAux.thy:23:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListAux.thy:86:lemma [simp]: "Not \<circ> (Not \<circ> P) = P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListAux.thy:112:lemma [simp]: "[f x. x <- xs, P x] = [f x. x <- [x \<leftarrow> xs. P x]]"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListSum.thy:18:lemma [simp]: "(\<Sum>\<^bsub>v \<in> V\<^esub> 0) = (0::nat)" by (induct V) simp_all
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/StackMark.thy:65:lemma [simp]: "R1_a \<in> Apply.Disjunctive"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/StackMark.thy:68:lemma [simp]: "R2_a \<in> Apply.Disjunctive" by (simp add: R2_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/StackMark.thy:76:lemma [simp]: "Disjunctive_fun R_a" by (simp add: Disjunctive_fun_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:41:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:205:lemma [simp]: "mono RR_a" by (simp add: RR_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:206:lemma [simp]: "RR_a \<in> Apply.Disjunctive" by (simp add: RR_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:207:lemma [simp]: "Disjunctive_fun R''_a" by (simp add: Disjunctive_fun_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:209:lemma [simp]: "mono_fun R''_a" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:211:lemma [simp]: "mono Q1''_a" by (simp add: Q1''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:212:lemma [simp]: "mono Q2''_a" by (simp add: Q2''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:213:lemma [simp]: "mono Q3''_a" by (simp add: Q3''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:214:lemma [simp]: "mono Q4''_a" by (simp add: Q4''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:215:lemma [simp]: "mono Q5''_a" by (simp add: Q5''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:216:lemma [simp]: "mono Q6''_a" by (simp add: Q6''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:218:lemma [simp]: "dmono LinkMark"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:323:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:331:lemma [simp]: "grd \<top> = \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:334:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:351:lemma [simp]: "mono QQ1_a" by (simp add: QQ1_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:352:lemma [simp]: "mono QQ2_a" by (simp add: QQ2_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:353:lemma [simp]: "mono QQ3_a" by (simp add: QQ3_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:354:lemma [simp]: "mono QQ4_a" by (simp add: QQ4_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:355:lemma [simp]: "mono QQ5_a" by (simp add: QQ5_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:356:lemma [simp]: "mono QQ6_a" by (simp add: QQ6_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:357:lemma [simp]: "mono QQ7_a" by (simp add: QQ7_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:358:lemma [simp]: "mono QQ8_a" by (simp add: QQ8_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:360:lemma [simp]: "dmono ClassicMark"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:175:lemma [simp]: "R1'_a \<in> Apply.Disjunctive" by (simp add: R1'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:177:lemma [simp]: "R2'_a \<in> Apply.Disjunctive" by (simp add: R2'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:185:lemma [simp]: "Disjunctive_fun R'_a" by (simp add: Disjunctive_fun_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:289:lemma [simp]: "Disjunctive_fun (r::('c \<Rightarrow> 'a::complete_lattice \<Rightarrow> 'b::complete_lattice))
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:307:lemma [simp]: "mono Q1'_a" by (simp add: Q1'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:308:lemma [simp]: "mono Q2'_a" by (simp add: Q2'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:309:lemma [simp]: "mono Q3'_a" by (simp add: Q3'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:310:lemma [simp]: "mono Q4'_a" by (simp add: Q4'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:311:lemma [simp]: "mono Q5'_a" by (simp add: Q5'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:313:lemma [simp]: "dmono StackMark_a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:178:lemma [simp]: "s \<bullet> t \<noteq> s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1543:lemma [simp]: "C_normal(\<Lambda> t) = C_normal t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1549:lemma [simp]: "C_normal(V x)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1553:lemma [simp]: "dterm (dterm\<^sub>M\<^sub>L v) = dterm\<^sub>M\<^sub>L v"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1772:lemma [simp]: "C_normal(term v \<bullet>\<bullet> ts) \<longleftrightarrow> C_normal\<^sub>M\<^sub>L v \<and> ts = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1775:lemma [simp]: "C_normal(\<Lambda> t \<bullet>\<bullet> ts) \<longleftrightarrow> C_normal t \<and> ts = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1778:lemma [simp]: "C_normal(C nm \<bullet>\<bullet> ts) \<longleftrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1782:lemma [simp]: "C_normal(V x \<bullet>\<bullet> ts) \<longleftrightarrow> (\<forall>t \<in> set ts. C_normal t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1802:lemma [simp]: "C_normal\<^sub>M\<^sub>L v \<Longrightarrow> C_normal\<^sub>M\<^sub>L(lift k v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1949:lemma [simp]: "C\<^sub>U_args(C nm \<bullet>\<bullet> ts) = ts"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:6:lemma [simp]: "safe [] = (%r. False)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:9:lemma [simp]: "safe (Exit g r # t) r' = safe t r'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:24:lemma [simp]: "\<not> safe (Check_in g r c # t) r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:31:lemma [simp]: "r \<noteq> r' \<Longrightarrow> safe (Check_in g r' c # t) r = safe t r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:48:lemma [simp]: "r \<noteq> r' \<Longrightarrow> safe (Enter g r' c # t) r = safe t r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:86:lemma [simp]: "safe t r \<Longrightarrow> safe (Enter g r c # t) r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:74:lemma [simp]: "A \<subseteq> filters \<Longrightarrow> \<Inter> A \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:97:lemma [simp]: "filterof X \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:160:lemma [simp]: "filterof X \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:268:lemma [simp]: "(a * b = 1) = (a = 1 \<and> b = 1)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:317:lemma [simp]: "(a l\<rightarrow> 1) = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:324:lemma [simp]: "(a r\<rightarrow> 1) = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:548:lemma [simp]: "H \<in> normalfilters \<Longrightarrow> H \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:34:lemma [simp]: "sup (Rep_G a - u + Rep_G b) 0 \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:51:lemma [simp]: "inf (Rep_G (b::'a G) - Rep_G a + u) u \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:67:lemma [simp]: "inf (u - Rep_G a + Rep_G b) u \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:97:lemma [simp]: "(u::'a) \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:100:lemma [simp]: "(1::'a G) * a = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:111:lemma [simp]: "a * (1::'a G) = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:121:lemma [simp]: "a l\<rightarrow> a = (1::'a G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:124:lemma [simp]: "a r\<rightarrow> a = (1::'a G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:127:lemma [simp]: "a \<in> G \<Longrightarrow> Rep_G (Abs_G a) = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:231:lemma [simp]: "0 \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:234:lemma [simp]: "0 \<le> (a::'a G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:320:lemma [simp]: "A \<in> subgroup \<Longrightarrow> 0 \<in> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:323:lemma [simp]: "A \<in> subgroup \<Longrightarrow> a \<in> A \<Longrightarrow> b \<in> A \<Longrightarrow> a + b \<in> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:682:lemma [simp]: "Rep_N a + Rep_N b \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:698:lemma [simp]: "inf (Rep_N b - Rep_N a) 0 \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:706:lemma [simp]: "inf (- Rep_N a + Rep_N b) 0 \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:714:lemma [simp]: "0 \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:780:lemma [simp]: "(1::'a N) * a = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:783:lemma [simp]: "a * (1::'a N) = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:786:lemma [simp]: "a l\<rightarrow> a = (1::'a N)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:789:lemma [simp]: "a r\<rightarrow> a = (1::'a N)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:1128:lemma [simp]: "(1, b) \<in> OrdSum"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:1131:lemma [simp]: "(a, 1) \<in> OrdSum"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:1221:lemma [simp]: "fst (Rep_OrdSum a) \<noteq> 1 \<Longrightarrow> (snd (Rep_OrdSum a) \<noteq> 1 = False)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoops.thy:808:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoops.thy:872:lemma [simp]: "m \<le> n \<Longrightarrow> a ^ n \<le> a ^ m"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoops.thy:878:lemma [simp]: "a ^ (2 ^ n) \<le> a ^ n"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:135:lemma [simp]: "0 l\<rightarrow> a = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:138:lemma [simp]: "0 r\<rightarrow> a = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:834:lemma [simp]: "(a l\<rightarrow> b) r\<rightarrow> b \<le> (b l\<rightarrow> a) r\<rightarrow> a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:855:lemma [simp]: "(a r\<rightarrow> b) l\<rightarrow> b \<le> (b r\<rightarrow> a) l\<rightarrow> a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Hoare_Time/Nielson_VCGi.thy:499:lemma [simp]: "support (\<lambda>a b. True) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Hoare_Time/Big_StepT_Partial.thy:311:lemma [simp]: "(Q ** $0) = Q" unfolding dollar_def sep_conj_def sep_disj_prod_def sep_disj_nat_def
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_Numbers/Real_Algebraic_Numbers.thy:3530:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_Numbers/Compare_Complex.thy:25:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_Numbers/Compare_Complex.thy:32:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:31:lemma [simp]: "obj_ty (C,fs) = Class C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:66:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some Boolean) = (\<exists>b. v = Bool b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:69:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some Integer) = (\<exists>i. v = Intg i)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:72:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some NT) = (v = Null)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:75:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some(Class C)) = (\<exists>a fs. v = Addr a \<and> h a = Some(C,fs))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:78:lemma [simp]: "h a = Some(C,fs) \<Longrightarrow> typeof\<^bsub>(h(a\<mapsto>(C,fs')))\<^esub> v = typeof\<^bsub>h\<^esub> v"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:30:lemma [iff]: "\<not> P \<turnstile> Object \<prec>\<^sup>1 C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:33:lemma [iff]: "(P \<turnstile> Object \<preceq>\<^sup>* C) = (C = Object)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:87:lemma [iff]: "(P \<turnstile> T \<le> Void) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:90:lemma [iff]: "(P \<turnstile> T \<le> Boolean) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:93:lemma [iff]: "(P \<turnstile> T \<le> Integer) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:96:lemma [iff]: "(P \<turnstile> Void \<le> T) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:99:lemma [iff]: "(P \<turnstile> Boolean \<le> T) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:102:lemma [iff]: "(P \<turnstile> Integer \<le> T) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:113:lemma [iff]: "(P \<turnstile> T \<le> NT) = (T = NT)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Exceptions.thy:46:lemma [simp]: "NullPointer \<in> sys_xcpts \<and> OutOfMemory \<in> sys_xcpts \<and> ClassCast \<in> sys_xcpts"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Type.thy:35:lemma [iff]: "is_refT NT"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Type.thy:38:lemma [iff]: "is_refT(Class C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:162:lemma [simp]: "fields E Object = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:165:lemma [simp]: "fields E NullPointer = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:168:lemma [simp]: "fields E ClassCast = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:171:lemma [simp]: "fields E OutOfMemory = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:174:lemma [simp]: "fields E test_name = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:478:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:516:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:536:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:542:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:547:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:552:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVNoTypeError.thy:28:lemma [iff]: "is_Ref Null" by (simp add: is_Ref_def2)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/DFA/LBVComplete.thy:18:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/DFA/SemilatAlg.thy:41:lemma [iff]: "{} {\<sqsubseteq>\<^bsub>r\<^esub>} B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/DFA/SemilatAlg.thy:44:lemma [iff]: "(A {\<sqsubseteq>\<^bsub>r\<^esub>} {}) = (A = {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:229:lemma [simp]: "final(Val v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:232:lemma [simp]: "final(throw e) = (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:238:lemma [iff]: "finals []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:241:lemma [iff]: "finals (Val v # es) = finals es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:264:lemma [iff]: "finals (map Val vs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:267:lemma [iff]: "finals (throw e # es) = (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:19:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:264:lemma [iff]: "\<not> P \<turnstile> \<langle>[],s\<rangle> [\<rightarrow>] \<langle>es',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:267:lemma [iff]: "\<not> P \<turnstile> \<langle>Val v,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:270:lemma [iff]: "\<not> P \<turnstile> \<langle>Throw a,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Progress.thy:93:lemma [iff]: "P,E,h \<turnstile> e\<^sub>1;;e\<^sub>2 :' T\<^sub>2 = (\<exists>T\<^sub>1. P,E,h \<turnstile> e\<^sub>1:' T\<^sub>1 \<and> P,E,h \<turnstile> e\<^sub>2:' T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Progress.thy:100:lemma [iff]: "P,E,h \<turnstile> Val v :' T = (typeof\<^bsub>h\<^esub> v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Progress.thy:107:lemma [iff]: "P,E,h \<turnstile> Var v :' T = (E v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:133:lemma [iff]: "(P,E,h \<turnstile> [] [:] Ts) = (Ts = [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:140:lemma [iff]: "(P,E,h \<turnstile> e#es [:] T#Ts) = (P,E,h \<turnstile> e : T \<and> P,E,h \<turnstile> es [:] Ts)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:147:lemma [iff]: "(P,E,h \<turnstile> (e#es) [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:155:lemma [simp]: "\<forall>Ts. (P,E,h \<turnstile> es\<^sub>1 @ es\<^sub>2 [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:172:lemma [iff]: "P,E,h \<turnstile> Val v : T = (typeof\<^bsub>h\<^esub> v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:179:lemma [iff]: "P,E,h \<turnstile> Var v : T = (E v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:186:lemma [iff]: "P,E,h \<turnstile> e\<^sub>1;;e\<^sub>2 : T\<^sub>2 = (\<exists>T\<^sub>1. P,E,h \<turnstile> e\<^sub>1:T\<^sub>1 \<and> P,E,h \<turnstile> e\<^sub>2:T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:193:lemma [iff]: "P,E,h \<turnstile> {V:T; e} : T' = (P,E(V\<mapsto>T),h \<turnstile> e : T')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/TypeSafe.thy:108:lemma [iff]: "\<And>A. \<lbrakk> length Vs = length Ts; length vs = length Ts\<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Equivalence.thy:659:lemma [simp]: "\<And>vs. length(upd_vals l Vs vs) = length Vs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Expr.thy:45:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Expr.thy:98:lemma [simp]: "fvs(es\<^sub>1 @ es\<^sub>2) = fvs es\<^sub>1 \<union> fvs es\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Expr.thy:101:lemma [simp]: "fvs(map Val vs) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:116:lemma [iff]: "(P,E \<turnstile> [] [::] Ts) = (Ts = [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:123:lemma [iff]: "(P,E \<turnstile> e#es [::] T#Ts) = (P,E \<turnstile> e :: T \<and> P,E \<turnstile> es [::] Ts)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:130:lemma [iff]: "(P,E \<turnstile> (e#es) [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:138:lemma [iff]: "\<And>Ts. (P,E \<turnstile> es\<^sub>1 @ es\<^sub>2 [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:155:lemma [iff]: "P,E \<turnstile> Val v :: T = (typeof v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:162:lemma [iff]: "P,E \<turnstile> Var V :: T = (E V = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:169:lemma [iff]: "P,E \<turnstile> e\<^sub>1;;e\<^sub>2 :: T\<^sub>2 = (\<exists>T\<^sub>1. P,E \<turnstile> e\<^sub>1::T\<^sub>1 \<and> P,E \<turnstile> e\<^sub>2::T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:176:lemma [iff]: "(P,E \<turnstile> {V:T; e} :: T') = (is_type P T \<and> P,E(V\<mapsto>T) \<turnstile> e :: T')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:40:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> A = A \<and> A \<squnion> \<lfloor>{}\<rfloor> = A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:43:lemma [simp]: "\<lfloor>A\<rfloor> \<squnion> \<lfloor>B\<rfloor> = \<lfloor>A \<union> B\<rfloor> \<and> \<lfloor>A\<rfloor> \<ominus> a = \<lfloor>A - {a}\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:46:lemma [simp]: "None \<squnion> A = None \<and> A \<squnion> None = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:49:lemma [simp]: "a \<in>\<in> None \<and> None \<ominus> a = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:53:lemma [simp]: "is_class (compP f P) C = is_class P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:57:lemma [simp]: "class (compP f P) C = map_option (\<lambda>c. snd(compC f (C,c))) (class P C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:93:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:144:lemma [simp]: "subcls1(compP f P) = subcls1 P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:154:lemma [simp]: "(compP f P \<turnstile> Ts [\<le>] Ts') = (P \<turnstile> Ts [\<le>] Ts')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:164:lemma [simp]: "is_type (compP f P) T = is_type P T"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:168:lemma [simp]: "(compP (f::'a\<Rightarrow>'b) P \<turnstile> C has_fields FDTs) = (P \<turnstile> C has_fields FDTs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:198:lemma [simp]: "fields (compP f P) C = fields P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:202:lemma [simp]: "(compP f P \<turnstile> C sees F:T in D) = (P \<turnstile> C sees F:T in D)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:206:lemma [simp]: "field (compP f P) F D = field P F D"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:212:lemma [iff]: "distinct_fst (compP f P) = distinct_fst P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:221:lemma [iff]: "distinct_fst (map (compM f) ms) = distinct_fst ms"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:230:lemma [iff]: "wf_syscls (compP f P) = wf_syscls P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:234:lemma [iff]: "wf_fdecl (compP f P) = wf_fdecl P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Compiler1.thy:34:lemma [simp]: "compEs\<^sub>1 Vs es = map (compE\<^sub>1 Vs) es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Compiler1.thy:46:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:28:lemma [simp]: "P,C,M,pc \<rhd> []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:32:lemma [simp]: "P,C,M,pc \<rhd> (i#is) = (P,C,M,pc \<triangleright> i \<and> P,C,M,pc + 1 \<rhd> is)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:40:lemma [simp]: "P,C,M,pc \<rhd> (is\<^sub>1 @ is\<^sub>2) = (P,C,M,pc \<rhd> is\<^sub>1 \<and> P,C,M,pc + size is\<^sub>1 \<rhd> is\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:54:lemma [simp]: "P,C,M,pc \<triangleright> i \<Longrightarrow> instrs_of P C M ! pc = i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:69:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:98:lemma [simp]: "pcs [] = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:102:lemma [simp]: "pcs (x#xt) = {fst x ..< fst(snd x)} \<union> pcs xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:106:lemma [simp]: "pcs(xt\<^sub>1 @ xt\<^sub>2) = pcs xt\<^sub>1 \<union> pcs xt\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:110:lemma [simp]: "pc < pc\<^sub>0 \<or> pc\<^sub>0+size(compE\<^sub>2 e) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxE\<^sub>2 e pc\<^sub>0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:114:lemma [simp]: "pc < pc\<^sub>0 \<or> pc\<^sub>0+size(compEs\<^sub>2 es) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxEs\<^sub>2 es pc\<^sub>0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:118:lemma [simp]: "pc\<^sub>1 + size(compE\<^sub>2 e\<^sub>1) \<le> pc\<^sub>2 \<Longrightarrow> pcs(compxE\<^sub>2 e\<^sub>1 pc\<^sub>1 d\<^sub>1) \<inter> pcs(compxE\<^sub>2 e\<^sub>2 pc\<^sub>2 d\<^sub>2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:122:lemma [simp]: "pc\<^sub>1 + size(compE\<^sub>2 e) \<le> pc\<^sub>2 \<Longrightarrow> pcs(compxE\<^sub>2 e pc\<^sub>1 d\<^sub>1) \<inter> pcs(compxEs\<^sub>2 es pc\<^sub>2 d\<^sub>2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:126:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:131:lemma [simp]: "\<lbrakk> x \<in> set xt; pc \<notin> pcs xt \<rbrakk> \<Longrightarrow> \<not> matches_ex_entry P D pc x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:135:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:148:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:167:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:200:lemma [simp]: "P,C,M \<rhd> xt/I,d \<Longrightarrow> P,C,M \<rhd> xt/I,Suc d"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Hidden.thy:19:lemma [simp]: "hidden xs i \<Longrightarrow> hidden (xs@[x]) i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:213:lemma [iff]: "OK None \<in> states P mxs mxl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:316:lemma [simp]: "shift 0 xt = xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:319:lemma [simp]: "shift n [] = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:322:lemma [simp]: "shift n (xt\<^sub>1 @ xt\<^sub>2) = shift n xt\<^sub>1 @ shift n xt\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:325:lemma [simp]: "shift m (shift n xt) = shift (m+n) xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:328:lemma [simp]: "pcs (shift n xt) = {pc+n|pc. pc \<in> pcs xt}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:374:lemma [simp]: "eff i P pc et None = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:399:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:410:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:421:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:633:lemma [iff]: "xcpt_app i P pc mxs [] \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:637:lemma [simp]: "xcpt_eff i P pc \<tau> [] = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1168:lemma [simp]: "types (compP f P) = types P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1171:lemma [simp]: "states (compP f P) mxs mxl = states P mxs mxl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1174:lemma [simp]: "app\<^sub>i (i, compP f P, pc, mpc, T, \<tau>) = app\<^sub>i (i, P, pc, mpc, T, \<tau>)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1184:lemma [simp]: "is_relevant_entry (compP f P) i = is_relevant_entry P i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1193:lemma [simp]: "relevant_entries (compP f P) i pc xt = relevant_entries P i pc xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1196:lemma [simp]: "app i (compP f P) mpc T pc mxl xt \<tau> = app i P mpc T pc mxl xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1203:lemma [simp]: "app i P mpc T pc mxl xt \<tau> \<Longrightarrow> eff i (compP f P) pc xt \<tau> = eff i P pc xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1211:lemma [simp]: "subtype (compP f P) = subtype P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1218:lemma [simp]: "compP f P \<turnstile> \<tau> \<le>' \<tau>' = P \<turnstile> \<tau> \<le>' \<tau>'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1221:lemma [simp]: "compP f P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s = P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/LTL_Impl.thy:57:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/LTL_Impl.thy:61:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:306:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:311:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:316:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:321:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:326:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:331:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/af_Impl.thy:336:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/Impl/Export_Code.thy:102:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/LTL_FGXU.thy:417:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_Dependability_norefl_impl.thy:31:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_Dependability_norefl.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_Dependability_impl.thy:48:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_Dependability.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_TaintingTrusted_impl.thy:39:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_TaintingTrusted.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_BLPbasic_impl.thy:22:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_BLPbasic.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_ACLnotCommunicateWith_impl.thy:17:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_ACLnotCommunicateWith.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_SubnetsInGW_impl.thy:22:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_SubnetsInGW.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_DomainHierarchyNG_impl.thy:57:lemma[code_unfold]: "DomainHierarchyNG.node_props P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_NonInterference_impl.thy:94:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_NonInterference.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_Subnets_impl.thy:23:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_Subnets.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_BLPtrusted_impl.thy:22:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_BLPtrusted.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_CommunicationPartners_impl.thy:26:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_CommunicationPartners.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_ACLcommunicateWith_impl.thy:16:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_ACLcommunicateWith.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_Sink_impl.thy:23:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_Sink.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_Tainting_impl.thy:25:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_Tainting.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_SecGwExt_impl.thy:21:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_SecGwExt.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Network_Security_Policy_Verification/Security_Invariants/SINVAR_NoRefl_impl.thy:23:lemma[code_unfold]: "SecurityInvariant.node_props SINVAR_NoRefl.default_node_properties P = NetModel_node_props P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MSO_Regex_Equivalence/Pi_Regular_Set.thy:16:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InformationFlowSlicing/LiftingIntra.thy:54:lemma [simp]:"\<not> lift_valid_edge valid_edge src trg knd E X (Node E,et,Node X)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Partial_Function_Set.thy:91:lemma [partial_function_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Partial_Function_Set.thy:172:lemma [partial_function_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:643:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:693:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:737:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:1471:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generat.thy:33:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generat.thy:40:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/List_Bits.thy:29:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Resumption.thy:58:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Det.thy:279:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Det.thy:339:lemma [refine_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Foreach.thy:1546:lemma [refine_transfer_post_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Foreach.thy:1553:lemma [refine_transfer_post_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:362:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:621:lemma [simp, intro!]: "mono (WHILEI_lfp_body I m c f)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:627:lemma [refine_pw_simps]: "nofail (filter_ASSUME c m) \<longleftrightarrow> nofail m"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:631:lemma [refine_pw_simps]: "inres (filter_ASSUME c m) x
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/examples/WordRefine.thy:16:lemma [simp, relator_props]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/examples/WordRefine.thy:20:lemma [simp]: "single_valuedp (\<lambda>c a. a = unat c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/examples/WordRefine.thy:23:lemma [simp, relator_props]: "single_valued (converse word_nat_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Basic.thy:1454:lemma [autoref_op_pat_def]: "RETURN x \<equiv> op_RETURN x" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:29:lemma [autoref_itype]: "op_slg_succs ::\<^sub>i \<langle>I\<rangle>\<^sub>ii_slg \<rightarrow>\<^sub>i I \<rightarrow>\<^sub>i \<langle>I\<rangle>\<^sub>ii_set" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:32:lemma [autoref_op_pat]: "E``{v} \<equiv> op_slg_succs$E$v" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:78:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:248:lemma [autoref_rel_intf]: "REL_INTF frgv_impl_rel_ext i_g_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:251:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:273:lemma [autoref_rel_intf]: "REL_INTF g_impl_rel_ext i_g_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:276:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:287:lemma [autoref_rules]: "(gi_V_update, g_V_update) \<in> (\<langle>Rv\<rangle>fun_set_rel \<rightarrow> \<langle>Rv\<rangle>fun_set_rel) \<rightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:291:lemma [autoref_rules]: "(gi_E_update, g_E_update) \<in> (\<langle>Rv\<rangle>slg_rel \<rightarrow> \<langle>Rv\<rangle>slg_rel) \<rightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:295:lemma [autoref_rules]: "(gi_V0_update, g_V0_update) \<in> (\<langle>Rv\<rangle>list_set_rel \<rightarrow> \<langle>Rv\<rangle>list_set_rel) \<rightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:303:lemma [autoref_hom]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:92:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:228:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:365:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:490:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:618:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:739:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:892:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:903:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:969:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:980:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flow_Networks/Network_Impl.thy:189:lemma [intf_of_assn]: "intf_of_assn (cf_assn) TYPE(capacity_impl i_mtx)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract_Completeness/Propositional_Logic.thy:126:lemma [code]: "Stream.smember x (y ## s) = (x = y \<or> Stream.smember x s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Shivers-CFA/AbsCFCorrect.thy:109:lemma [simp]: "|{}| = {}" unfolding abs_ccache_def by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Interpolation/Newton_Interpolation.thy:170:lemma [simp]: "xd i i = 0" "xd i j + xd j k = xd i k" "xd i j + xd k i = xd k j"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Interpolation/Is_Rat_To_Rat.thy:101:lemma [code_unfold]: "(x \<in> \<rat>) = (is_rat x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Interpolation/Lagrange_Interpolation.thy:26:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Formal_SSA/RBT_Mapping_Exts.thy:72:lemma [code_unfold]: "set (RBT.keys t) = RBT_Set.Set (RBT.map (\<lambda>_ _. ()) t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Promela/Promela.thy:100:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Array_Stack.thy:19:lemma [relator_props]: "single_valued R \<Longrightarrow> single_valued (\<langle>R\<rangle>as_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:171:lemma [autoref_rules]: "(bs_empty (),{})\<in>\<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:174:lemma [autoref_rules]: "(bs_UNIV (),UNIV)\<in>\<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:177:lemma [autoref_rules]: "(bs_isEmpty,op_set_isEmpty)\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:181:lemma [autoref_rules]: "(bs_insert,insert)\<in>nat_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:185:lemma [autoref_rules]: "(bs_delete,op_set_delete)\<in>nat_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:188:lemma [autoref_rules]: "(bs_mem,(\<in>))\<in>nat_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:191:lemma [autoref_rules]: "(bs_eq,(=))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:194:lemma [autoref_rules]: "(bs_subset_eq,(\<subseteq>))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:197:lemma [autoref_rules]: "(bs_union,(\<union>))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:200:lemma [autoref_rules]: "(bs_inter,(\<inter>))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:203:lemma [autoref_rules]: "(bs_diff,(-))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:206:lemma [autoref_rules]: "(bs_complement,uminus)\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:209:lemma [autoref_rules]: "(bs_disjoint,op_set_disjoint)\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Array_Map.thy:19:lemma [code]: "iam_\<alpha> a i \<equiv> array_get_oo None a i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Array_Map.thy:43:lemma [code]: "iam_update k v a \<equiv> array_set_oo
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Array_Map.thy:56:lemma [code]: "iam_delete k a \<equiv> array_set_oo (\<lambda>_. a) a k None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_RBT_Map.thy:1056:lemma [simp,autoref_post_simps]: "ord.rbt_ins (<) = rbt_ins"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_RBT_Map.thy:1064:lemma [autoref_post_simps]: "ord.rbt_lookup ((<)::_::linorder\<Rightarrow>_) = rbt_lookup"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_RBT_Map.thy:1067:lemma [simp,autoref_post_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Comp.thy:869:lemma [autoref_post_simps]: "comp2eq (dflt_cmp (\<le>) ((<)::_::linorder\<Rightarrow>_)) = (=)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Map.thy:29:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Map.thy:94:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:25:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:50:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:54:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:96:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Nested_DFS.thy:1037:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Nested_DFS.thy:1048:lemma [autoref_op_pat]: "NO_CYC \<equiv> OP NO_CYC :::\<^sub>i i_blue_wit" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Succ_Graph.thy:19:lemma [relator_props]: "single_valued R \<Longrightarrow> single_valued (\<langle>R\<rangle>slg_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Succ_Graph.thy:32:lemma [autoref_itype]: "slg_succs ::\<^sub>i \<langle>I\<rangle>\<^sub>ii_slg \<rightarrow>\<^sub>i I \<rightarrow>\<^sub>i \<langle>I\<rangle>\<^sub>ii_set" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Succ_Graph.thy:35:lemma [autoref_op_pat]: "E``{v} \<equiv> slg_succs$E$v" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Coll_Test.thy:427:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Coll_Test.thy:434:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Combined_TwoSat.thy:10:lemma [autoref_rules]: "(Lit,Lit)\<in>Id\<rightarrow>Id\<rightarrow>Id" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Lib/Diff_Array.thy:471:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/ICF/ICF_Autoref.thy:39:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Base.thy:2285:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:49:lemma [mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:478:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:485:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1050:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1055:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1061:lemma [mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1066:lemma [eqvt]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1072:lemma [eqvt]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Incompleteness/Goedel_II.thy:27:lemma [simp]: "\<langle>\<langle>0,0,0\<rangle>, x, y\<rangle> = q_Eats x y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Floyd_Warshall/FW_Code.thy:66:lemma [sepref_import_param]: "((+),(+)::'a\<Rightarrow>_) \<in> Id \<rightarrow> Id \<rightarrow> Id" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Floyd_Warshall/FW_Code.thy:67:lemma [sepref_import_param]: "(min,min::'a\<Rightarrow>_) \<in> Id \<rightarrow> Id \<rightarrow> Id" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HOLCF-Prelude/examples/Fibs.thy:33:lemma [simp]:"-1 + \<lbrakk>i\<rbrakk> = \<lbrakk> i \<rbrakk> - 1" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HOLCF-Prelude/examples/Fibs.thy:34:lemma [simp]:"-2 + \<lbrakk>i\<rbrakk> = \<lbrakk> i \<rbrakk> - 2" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA.thy:49:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA.thy:1157:lemma [intro!]: "expand_inv \<phi> (
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:226:lemma [refine_transfer]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:316:lemma [autoref_rules]: "(node_impl_ext, node_ext) \<in>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:327:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:346:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:983:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:1016:lemma [autoref_itype]: "expand\<^sub>T
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:88:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:339:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:778:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:782:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:786:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:798:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/WebAssembly/Wasm_Interpreter.thy:101:lemma[simp]: "e_is_trap e = (e = Trap)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/WebAssembly/Wasm_Interpreter.thy:105:lemma[simp]: "es_is_trap es = (es = [Trap])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Affine_Approximation.thy:2761:lemma [code]: "is_float (real_of_float f) = True"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Affine_Code.thy:550:lemma [code_post]: "Abs_slist = slist"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Affine_Code.thy:553:lemma [code]: "slist = (\<lambda>xs.
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Optimize_Integer.thy:21:lemma [code]: "log2 (int_of_integer a) = int_of_integer (log2_integer a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Optimize_Integer.thy:43:lemma [code]: "power_int (int_of_integer a) (int_of_integer b) = int_of_integer (power_integer a b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Float_Real.thy:39:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Float_Real.thy:43:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Float_Real.thy:47:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Float_Real.thy:106:lemma [code]: "real_divl p (real_of_float x) (real_of_float y) = real_of_float (float_divl p x y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Affine_Arithmetic/Float_Real.thy:109:lemma [code]: "real_divr p (real_of_float x) (real_of_float y) = real_of_float (float_divr p x y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Echelon_Form/Echelon_Form.thy:1062:lemma [code abstract]: "vec_nth (bezout_matrix A a b j bezout) = bezout_matrix_row A a b j bezout"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Echelon_Form/Code_Cayley_Hamilton.thy:57:lemma [code abstract]: "vec_nth (mat2matofpoly k) = mat2matofpoly_row k"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Regex_Equivalence/Deriv_Autos.thy:67:lemma [transfer_rule]: "rel_fun (rel_set (pcr_ACI_rexp (=))) (=) (finite o image ACI_norm) finite"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/UPF/ServiceExample.thy:94:lemma [simp]: "(case a of allow d \<Rightarrow> \<lfloor>X\<rfloor> | deny d2 \<Rightarrow> \<lfloor>Y\<rfloor>) = \<bottom> \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/UPF/ServiceExample.thy:98:lemma [cong,simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/UPF/Monads.thy:571:lemma [code]: "(\<sigma> \<Turnstile> m) = (case (m \<sigma>) of None \<Rightarrow> False | (Some (x,y)) \<Rightarrow> x)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dirichlet_Series/Dirichlet_Efficient_Code.thy:208:lemma [code]: "liouville_lambda n =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LLL_Basis_Reduction/Norms.thy:358:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LLL_Basis_Reduction/Missing_Lemmas.thy:301:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/WellFormProgs.thy:15:lemma [dest]:"\<lbrakk>well_formed procs; (Main,ins,outs,c) \<in> set procs\<rbrakk> \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/Com.thy:64:lemma [dest]:"#:c = 0 \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/PCFG.thy:157:lemma [dest]:"prog \<turnstile> n -IEdge (Q:r\<hookrightarrow>\<^bsub>p\<^esub>fs)\<rightarrow>\<^sub>p n' \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/PCFG.thy:160:lemma [dest]:"prog \<turnstile> n -IEdge (Q\<hookleftarrow>\<^bsub>p\<^esub>f)\<rightarrow>\<^sub>p n' \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:754:lemma [simp]: "PROG (Abs_wf_jvmprog (EP, Phi_EP)) = EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:761:lemma [simp]: "TYPING (Abs_wf_jvmprog (EP, Phi_EP)) = Phi_EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:776:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:781:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG.thy:129:lemma [simp]:"length (params fs cf) = length fs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG.thy:181:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (sourcenode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG.thy:184:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (targetnode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/Slice.thy:20:lemma [simp]: "length (csppa m S x fs) = length fs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/Slice.thy:23:lemma [simp]: "length (cspp m S fs) = length fs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:36:lemma [simp]: "valid_node (_Entry_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:43:lemma [simp]: "valid_node (_Exit_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:106:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:110:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:114:lemma [simp]:"\<lbrakk>valid_edge a; targetnode a \<noteq> (_Exit_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:118:lemma [simp]:"\<lbrakk>valid_edge a; sourcenode a \<noteq> (_Entry_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:142:lemma [dest]:"(_Exit_) -as\<rightarrow>* n' \<Longrightarrow> n' = (_Exit_) \<and> as = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/SCDObservable.thy:50:lemma [intro]:"\<forall>n \<in> S. valid_SDG_node n \<Longrightarrow> \<forall>n \<in> \<lfloor>S\<rfloor>\<^bsub>CFG\<^esub>. valid_node n"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG_wf.thy:209:lemma [dest!]: "V \<in> Use (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG_wf.thy:212:lemma [dest!]: "V \<in> Def (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Incredible_Proof_Machine/Predicate_Formulas.thy:105:lemma [simp]: "fv_subst1 (map (apsnd (map_lc p)) s) = fv_subst1 s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Possibilistic_Noninterference/Concrete.thy:48:lemma [simp]: "\<And> l. l \<noteq> Hi \<longleftrightarrow> l = Lo" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Possibilistic_Noninterference/Concrete.thy:54:lemma [dest]: "\<And> l A. \<lbrakk>l \<in> A; Lo \<notin> A\<rbrakk> \<Longrightarrow> l = Hi" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Program-Conflict-Analysis/ConsInterleave.thy:131:lemma [simp]: "w\<otimes>\<^bsub>\<alpha>\<^esub>[] = {w}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:110:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:117:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:121:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:125:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:129:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:133:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:137:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Tree-Automata/Ta_impl.thy:1124:lemma [code]: "hta_reindex H = (
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dict_Construction/Documentation/Termination.thy:17:lemma [code]: "f x = f x" ..
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dict_Construction/Test_Dict_Construction.thy:13:lemma [code]: "fold f [] = id" "fold f (x # xs) s = fold f xs (f x s)" "fold f [x, y] u \<equiv> f y (f x u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dict_Construction/Test_Dict_Construction.thy:190:lemma [code]: "j 0 = 0" "j (Suc n) = j n"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dict_Construction/Dict_Construction.thy:55:lemma [code]: "True \<and> p \<longleftrightarrow> p" "False \<and> p \<longleftrightarrow> False" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dict_Construction/Dict_Construction.thy:58:lemma [code]: "True \<or> p \<longleftrightarrow> True" "False \<or> p \<longleftrightarrow> p" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:64:lemma [combinator_eq]: "B \<equiv> S (K S) K" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:65:lemma [combinator_eq]: "C \<equiv> S (S (K (S (K S) K)) S) (K K)" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:66:lemma [combinator_eq]: "I \<equiv> W K" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:67:lemma [combinator_eq]: "I \<equiv> C K ()" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:68:lemma [combinator_eq]: "S \<equiv> B (B W) (B B C)" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:69:lemma [combinator_eq]: "T \<equiv> C I" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:70:lemma [combinator_eq]: "W \<equiv> S S (S K)" unfolding combinator_unfold .
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Applicative_Lifting/Applicative.thy:72:lemma [combinator_eq weak: C]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:177:lemma [simp]: "rev_path [] = []" unfolding rev_path_def by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:186:lemma [intro!]: "finite (edges G) \<Longrightarrow> finite (edges (del_unEdge u e u' G))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:189:lemma [intro!]: "finite (nodes G) \<Longrightarrow> finite (nodes (del_unEdge u e u' G))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:192:lemma [intro!]: "finite (edges G) \<Longrightarrow> finite (edges (rem_unPath ps G))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:213:lemma [intro!]: "finite (nodes G) \<Longrightarrow> finite (odd_nodes_set G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:216:lemma [simp]: "nodes (del_unEdge u e u' G)=nodes G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:219:lemma [simp]: "nodes (rem_unPath ps G) = nodes G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:233:lemma [intro!]: "finite (nodes G) \<Longrightarrow> finite (nodes (rem_unPath ps G))" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_IArrays.thy:36:lemma [code abstract]: "vec_nth (list_to_vec xs) = (%i. xs ! (to_nat i))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_IArrays.thy:42:lemma [code abstract]: "vec_nth (list_of_list_to_matrix xs) = (%i. list_to_vec (xs ! (to_nat i)))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_IArrays.thy:52:lemma [code_post]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_IArrays.thy:56:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_IArrays.thy:60:lemma [code_post]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Inverse_IArrays.thy:62:lemma[code_unfold]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Set.thy:31:lemma [code]: "List.coset (l::'a::enum list) = set (enum_class.enum) - set l"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:20:lemma [code abstract]: "vec_nth 0 = (%x. 0)" by (metis zero_index)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:21:lemma [code abstract]: "vec_nth 1 = (%x. 1)" by (metis one_index)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:22:lemma [code abstract]: "vec_nth (a + b) = (%i. a$i + b$i)" by (metis vector_add_component)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:23:lemma [code abstract]: "vec_nth (a - b) = (%i. a$i - b$i)" by (metis vector_minus_component)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:24:lemma [code abstract]: "vec_nth (vec n) = (\<lambda>i. n)" unfolding vec_def by fastforce
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:25:lemma [code abstract]: "vec_nth (a * b) = (%i. a$i * b$i)" unfolding vector_mult_component by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:26:lemma [code abstract]: "vec_nth (c *s x) = (\<lambda>i. c * (x$i))" unfolding vector_scalar_mult_def by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:27:lemma [code abstract]: "vec_nth (a - b) = (%i. a$i - b$i)" by (metis vector_minus_component)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:52:lemma [code abstract]: "vec_nth (mat k) = mat_row k"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:65:lemma [code abstract]: "vec_nth (row i A) = (($) (A $ i))" unfolding row_def by fastforce
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:66:lemma [code abstract]: "vec_nth (column j A) = (%i. A $ i $ j)" unfolding column_def by fastforce
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:73:lemma [code abstract]: "vec_nth (rowvector v) = rowvector_row v"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Matrix.thy:81:lemma [code abstract]: "vec_nth (columnvector v) = columnvector_row v"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Generation_IArrays.thy:19:lemma [code_unfold del]: "1 \<equiv> real_of_rat 1" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Generation_IArrays.thy:20:lemma [code_unfold del]: "0 \<equiv> real_of_rat 0" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Rational.thy:52:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Rational.thy:56:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Rational.thy:72:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Code_Rational.thy:84:lemma [code]: "quotient_of x = (int_of_integer (numerator_integer x), int_of_integer(denominator_integer x))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_Abstract.thy:30:lemma [code abstract]: "vec_nth (list_to_vec xs) = (%i. xs ! (to_nat i))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_Abstract.thy:36:lemma [code abstract]: "vec_nth (list_of_list_to_matrix xs) = (%i. list_to_vec (xs ! (to_nat i)))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_Abstract.thy:46:lemma [code_post]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_Abstract.thy:50:lemma [code_abbrev]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Examples_Gauss_Jordan_Abstract.thy:54:lemma [code_post]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gauss_Jordan/Gauss_Jordan.thy:2399:lemma [code abstract]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Inductive_Confidentiality/DolevYao/Message.thy:16:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Inductive_Confidentiality/GeneralAttacker/MessageGA.thy:6:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Basis.thy:83:lemma [simp]: "i < \<parallel>xs\<parallel> \<Longrightarrow> (xs @ ys)\<langle>i\<rangle> = xs\<langle>i\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Basis.thy:90:lemma [simp]: "\<parallel>xs\<parallel> \<le> i \<Longrightarrow> (xs @ ys)\<langle>i\<rangle> = ys\<langle>i - \<parallel>xs\<parallel>\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Execute.thy:33:lemma [code_pred_intro Rcd_Nil]: "valuep (Rcd [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Execute.thy:36:lemma [code_pred_intro Rcd_Cons]: "valuep t \<Longrightarrow> valuep (Rcd fs) \<Longrightarrow> valuep (Rcd ((l, t) # fs))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Execute.thy:64:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Execute.thy:69:lemma [code_unfold]: "x \<in> value \<longleftrightarrow> valuep x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Real_Impl/Real_Unique_Impl.thy:65:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Real_Impl/Real_Impl.thy:478:lemma [code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Real_Impl/Real_Impl.thy:485:lemma [code equation]:
-------------- next part --------------
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Rules/Blast.thy:32:lemma [iff]: "(xs at ys = []) = (xs=[] & ys=[])"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/CodeGen/CodeGen.thy:118:lemma [simp]: "\<forall>vs. exec (xs at ys) s vs = exec ys s (exec xs s vs)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Inductive/Even.thy:205:lemma [iff]: "((Suc (Suc n)) \<in> even) = (n \<in> even)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Inductive/AB.thy:32:lemma [simp]: "(x \<noteq> a) = (x = b) \<and> (x \<noteq> b) = (x = a)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Inductive/Star.thy:41:lemma [intro]: "(x,y) \<in> r \<Longrightarrow> (x,y) \<in> r*"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Fun/fun0.thy:175:lemma [simp]: "gcd m 0 = m"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Fun/fun0.thy:179:lemma [simp]: "n \<noteq> 0 \<Longrightarrow> gcd m n = gcd n (m mod n)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Misc/Plus.thy:13:lemma [simp]: "\<forall>m. add m n = m+n"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Misc/Tree2.thy:17:lemma [simp]: "\<forall>xs. flatten2 t xs = flatten t @ xs"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/CTL/CTL.thy:410:lemma [iff]: "apath s \<in> Paths s";
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Recdef/Nested2.thy:5:lemma [simp]: "t \<in> set ts \<longrightarrow> size t < Suc(size_term_list ts)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Recdef/simplification.thy:81:lemma [simp]: "gcd (m, 0) = m"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Recdef/simplification.thy:85:lemma [simp]: "n \<noteq> 0 \<Longrightarrow> gcd(m, n) = gcd(n, m mod n)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:130:lemma [simp]:
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:159:lemma [simp]: "\<forall>t e. normal(normif b t e) = (normal t \<and> normal e)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:203:lemma [simp]:
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Ifexpr/Ifexpr.thy:212:lemma [simp]: "\<forall>t e. normal2 t & normal2 e --> normal2(normif2 b t e)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Trie/Trie.thy:56:lemma [simp]: "lookup (Trie None []) as = None"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Trie/Trie.thy:189:lemma [simp]: "\<forall> a v b. assoc (overwrite a v ps) b = assoc ((a,v)#ps) b"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Trie/Trie.thy:225:lemma [simp]: "lookupm (Triem None (\<lambda>c. None)) as = None"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Advanced/Partial.thy:127:lemma [simp]:
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Datatype/Nested.thy:122:lemma [simp]: "\<forall> ys. trevs (xs @ ys) = (trevs ys) @ (trevs xs)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Datatype/Nested.thy:132:lemma [simp]: "subst s (App f ts) = App f (map (subst s) ts)"
/srv/data/tum/isabelle/devel/src/Doc/Tutorial/Protocol/Message.thy:14:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/src/FOL/FOL.thy:369:lemma [simp]: "((P \<longrightarrow> R) \<longleftrightarrow> (Q \<longrightarrow> R)) \<longleftrightarrow> ((P \<longleftrightarrow> Q) \<or> R)"
/srv/data/tum/isabelle/devel/src/FOL/FOL.thy:372:lemma [simp]: "((P \<longrightarrow> Q) \<longleftrightarrow> (P \<longrightarrow> R)) \<longleftrightarrow> (P \<longrightarrow> (Q \<longleftrightarrow> R))"
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:372:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:383:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:394:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:398:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:416:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:440:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/SMT.thy:449:lemma [z3_rule]: (* for def-axiom *)
/srv/data/tum/isabelle/devel/src/HOL/String.thy:170:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:174:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:178:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/String.thy:182:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/HOLCF/IOA/NTP/Impl.thy:80:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/HOLCF/IOA/NTP/Impl.thy:87:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Fields.thy:292:lemma [divide_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Fields.thy:1073:lemma [divide_simps]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:132:lemma [simp]: "fields (E, Object) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:135:lemma [simp]: "fields (E, Xcpt NullPointer) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:138:lemma [simp]: "fields (E, Xcpt ClassCast) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:141:lemma [simp]: "fields (E, Xcpt OutOfMemory) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/BVExample.thy:144:lemma [simp]: "fields (E, test_name) = []"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/Typing_Framework_JVM.thy:174:lemma [iff]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/Typing_Framework_JVM.thy:180:lemma [intro]:
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/BV/JVMType.thy:94:lemma [simp]: "Err.le r (OK a) (OK b) = r a b"
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/J/Example.thy:354:lemma [simp]: "fst ObjectC = Object" by (simp add: ObjectC_def)
/srv/data/tum/isabelle/devel/src/HOL/MicroJava/JVM/JVMDefensive.thy:131:lemma [dest!]:
/srv/data/tum/isabelle/devel/src/HOL/Nonstandard_Analysis/NSA.thy:949:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Auth/Message.thy:16:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Ordered_Euclidean_Space.thy:222:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Sigma_Algebra.thy:1578:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:677:lemma [measurable]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:935:lemma [measurable (raw)]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:1659:lemma [measurable(raw)]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Borel_Space.thy:1666:lemma [measurable(raw)]:
/srv/data/tum/isabelle/devel/src/HOL/Analysis/Measurable.thy:183:lemma [measurable (raw generic)]:
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:168:lemma [simp]: "attributes (Val (att, text)) = att"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:171:lemma [simp]: "attributes (Env att dir) = att"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:174:lemma [simp]: "attributes (map_attributes f file) = f (attributes file)"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:178:lemma [simp]: "map_attributes f (Val (att, text)) = Val (f att, text)"
/srv/data/tum/isabelle/devel/src/HOL/Unix/Unix.thy:181:lemma [simp]: "map_attributes f (Env att dir) = Env (f att) dir"
/srv/data/tum/isabelle/devel/src/HOL/Relation.thy:1102:lemma [pred_set_conv]: "inv_imagep (\<lambda>x y. (x, y) \<in> r) f = (\<lambda>x y. (x, y) \<in> inv_image r f)"
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6599:lemma [measure_function]: "is_measure f \<Longrightarrow> is_measure (size_list f)"
/srv/data/tum/isabelle/devel/src/HOL/List.thy:6602:lemma [measure_function]: "is_measure f \<Longrightarrow> is_measure (size_option f)"
/srv/data/tum/isabelle/devel/src/HOL/Corec_Examples/Tests/Iterate_GPV.thy:38:lemma [friend_of_corec_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Corec_Examples/Tests/Iterate_GPV.thy:42:lemma [friend_of_corec_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:80:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:84:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:88:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:92:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:100:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:104:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:108:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:207:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:211:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:276:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:280:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:284:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:345:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:359:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:810:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:814:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:818:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:826:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:834:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:878:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:882:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:941:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:945:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:949:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Code_Numeral.thy:977:lemma [measure_function]:
/srv/data/tum/isabelle/devel/src/HOL/Real.thy:1732:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Real_Vector_Spaces.thy:175:lemma [vector_add_divide_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Nominal/Nominal.thy:379:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Fibonacci.thy:32:lemma [simp]: "fib (Suc n) > 0"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Higher_Order_Logic.thy:248:lemma [trans]: "x = y \<Longrightarrow> P y \<Longrightarrow> P x"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Higher_Order_Logic.thy:251:lemma [trans]: "P x \<Longrightarrow> x = y \<Longrightarrow> P y"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:265:lemma [trans]: "\<turnstile> P c Q \<Longrightarrow> P' \<subseteq> P \<Longrightarrow> \<turnstile> P' c Q"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:267:lemma [trans] : "P' \<subseteq> P \<Longrightarrow> \<turnstile> P c Q \<Longrightarrow> \<turnstile> P' c Q"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:270:lemma [trans]: "Q \<subseteq> Q' \<Longrightarrow> \<turnstile> P c Q \<Longrightarrow> \<turnstile> P c Q'"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:272:lemma [trans]: "\<turnstile> P c Q \<Longrightarrow> Q \<subseteq> Q' \<Longrightarrow> \<turnstile> P c Q'"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:275:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:278:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:282:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:285:lemma [trans]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:331:lemma [trans, intro?]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:339:lemma [intro?]: "\<turnstile> (P \<inter> b) c P \<Longrightarrow> \<turnstile> P (While b P c) (P \<inter> -b)"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:342:lemma [intro?]: "\<turnstile> (P \<inter> b) c P \<Longrightarrow> \<turnstile> P (While b undefined c) (P \<inter> -b)"
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:346:lemma [intro?]:
/srv/data/tum/isabelle/devel/src/HOL/Isar_Examples/Hoare.thy:351:lemma [intro?]:
/srv/data/tum/isabelle/devel/src/HOL/Rings.thy:656:lemma [field_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Rings.thy:666:lemma [field_simps]:
/srv/data/tum/isabelle/devel/src/HOL/Rings.thy:1685:lemma [nitpick_unfold]:
/srv/data/tum/isabelle/devel/src/HOL/SMT_Examples/SMT_Examples.thy:376:lemma [z3_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:25:lemma [iff]: "Path h 0 xs y = (xs = [] \<and> y = 0)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:28:lemma [simp]: "x\<noteq>0 \<Longrightarrow> Path h x as z =
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:32:lemma [simp]: "\<And>x. Path f x (as at bs) z = (\<exists>y. Path f x as y \<and> Path f y bs z)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:45:lemma [simp]: "List h x [] = (x = 0)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:48:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SepLogHeap.thy:52:lemma [simp]: "List h 0 as = (as = [])"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Examples.thy:159:lemma [simp]: "1 \<le> i \<Longrightarrow> fac (i - Suc 0) * i = fac i"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:33:lemma [iff]: "Path h Null xs y = (xs = [] \<and> y = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:39:lemma [simp]: "Path h (Ref a) as z =
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:46:lemma [simp]: "\<And>x. Path f x (as at bs) z = (\<exists>y. Path f x as y \<and> Path f y bs z)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:88:lemma [simp]: "List h x [] = (x = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:91:lemma [simp]: "List h x (a#as) = (x = Ref a \<and> List h (h a) as)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:94:lemma [simp]: "List h Null as = (as = [])"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:156:lemma [simp]: "islist h Null"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:159:lemma [simp]: "islist h (Ref a) = islist h (h a)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:162:lemma [simp]: "list h Null = []"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Heap.thy:171:lemma [simp]: "islist h (h a) \<Longrightarrow> a \<notin> set(list h (h a))"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:52:lemma [iff]: "Path h Null xs y = (xs = [] \<and> y = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:58:lemma [simp]: "a \<noteq> Null \<Longrightarrow> Path h a as z =
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:65:lemma [simp]: "\<And>x. Path f x (as at bs) z = (\<exists>y. Path f x as y \<and> Path f y bs z)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:68:lemma [simp]: "\<And>x. u \<notin> set as \<Longrightarrow> Path (f(u := v)) x as y = Path f x as y"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:78:lemma [simp]: "List h x [] = (x = Null)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:81:lemma [simp]: "List h x (a#as) = (x \<noteq> Null \<and> x = a \<and> List h (h a) as)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:84:lemma [simp]: "List h Null as = (as = [])"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:143:lemma [simp]: "islist h Null"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:146:lemma [simp]: "a \<noteq> Null \<Longrightarrow> islist h a = islist h (h a)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:149:lemma [simp]: "list h Null = []"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointers0.thy:158:lemma [simp]: "islist h (h a) \<Longrightarrow> a \<notin> set(list h (h a))"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:99:lemma [simp]: " \<lbrakk>m l\<rbrakk> \<Longrightarrow> (l,x) \<in> (R | m)\<^sup>* = (l=x)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:124:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:130:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:136:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:142:lemma [rule_format,simp]:
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:160:lemma [simp]: "\<And>t. \<lbrakk> x \<notin> set xs; Ref x\<noteq>t \<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:166:lemma [simp]: "\<And>t. \<lbrakk> x \<notin> set xs; Ref x\<noteq>t \<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:172:lemma [simp]: "\<And>t. \<lbrakk> x \<notin> set xs; Ref x\<noteq>t \<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:184:lemma [simp]: "\<And>x. x \<notin> set xs \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/SchorrWaite.thy:190:lemma [simp]: "\<And>x. x \<notin> set xs \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:230:lemma [simp]: "({} = insert a A \<inter> B) = (a \<notin> B & {} = A \<inter> B)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:232:lemma [simp]: "({} = A \<inter> insert b B) = (b \<notin> A & {} = A \<inter> B)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:234:lemma [simp]: "({} = A \<inter> (B \<union> C)) = ({} = A \<inter> B & {} = A \<inter> C)"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:341:lemma [simp]: "ispath f p p"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:343:lemma [simp]: "path f p p = []"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:345:lemma [simp]: "ispath f p q \<Longrightarrow> a \<notin> set(path f p q) \<Longrightarrow> ispath (f(a := r)) p q"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:347:lemma [simp]: "ispath f p q \<Longrightarrow> a \<notin> set(path f p q) \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:353:lemma [simp]: "ispath (f(a := q)) p (Ref a) \<Longrightarrow> ispath (f(a := q)) p q"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:355:lemma [simp]: "ispath (f(a := q)) p (Ref a) \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:358:lemma [simp]: "ispath f p (Ref a) \<Longrightarrow> f a = Ref b \<Longrightarrow>
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:361:lemma [simp]: "ispath f p (Ref a) \<Longrightarrow> f a = Null \<Longrightarrow> islist f p"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:363:lemma [simp]: "ispath f p (Ref a) \<Longrightarrow> f a = Null \<Longrightarrow> list f p = path f p (Ref a) @ [a]"
/srv/data/tum/isabelle/devel/src/HOL/Hoare/Pointer_Examples.thy:366:lemma [simp]: "islist f p \<Longrightarrow> distinct (list f p)"
/srv/data/tum/isabelle/devel/src/HOL/Transfer.thy:195:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Transfer.thy:200:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:147:lemma [simp]: "undefined3 (In1l x) = In1 undefined"
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:150:lemma [simp]: "undefined3 (In1r x) = \<diamondsuit>"
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:153:lemma [simp]: "undefined3 (In2 x) = In2 undefined"
/srv/data/tum/isabelle/devel/src/HOL/Bali/Eval.thy:156:lemma [simp]: "undefined3 (In3 x) = In3 undefined"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:74:lemma [simp]: "wp\<^sub>t SKIP Q = Q"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:77:lemma [simp]: "wp\<^sub>t (x ::= e) Q = (\<lambda>s. Q(s(x := aval e s)))"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:80:lemma [simp]: "wp\<^sub>t (c\<^sub>1;;c\<^sub>2) Q = wp\<^sub>t c\<^sub>1 (wp\<^sub>t c\<^sub>2 Q)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX.thy:86:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX2.thy:81:lemma [simp]: "wp\<^sub>t SKIP Q = Q"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX2.thy:84:lemma [simp]: "wp\<^sub>t (x ::= e) Q = (\<lambda>l s. Q l (s(x := aval e s)))"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total_EX2.thy:90:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/IMP/ACom.thy:157:lemma [simp]: "shift (\<lambda>p. a) n = (\<lambda>p. a)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Abs_Int0.thy:80:lemma [simp]: "(Some x < Some y) = (x < y)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Abs_Int2_ivl.thy:141:lemma [simp]: fixes x :: "'a::linorder extended" shows "(\<not> x < Pinf) = (x = Pinf)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Abs_Int2_ivl.thy:143:lemma [simp]: fixes x :: "'a::linorder extended" shows "(\<not> Minf < x) = (x = Minf)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/BExp.thy:29:lemma [simp]: "bval (less a1 a2) s = (aval a1 s < aval a2 s)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:116:lemma [simp]: "wp\<^sub>t SKIP Q = Q"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:119:lemma [simp]: "wp\<^sub>t (x ::= e) Q = (\<lambda>s. Q(s(x := aval e s)))"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:122:lemma [simp]: "wp\<^sub>t (c\<^sub>1;;c\<^sub>2) Q = wp\<^sub>t c\<^sub>1 (wp\<^sub>t c\<^sub>2 Q)"
/srv/data/tum/isabelle/devel/src/HOL/IMP/Hoare_Total.thy:128:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Induct/QuoNestedDataType.thy:179:lemma [simp]: "exprel``{U} \<in> Exp"
/srv/data/tum/isabelle/devel/src/HOL/Induct/QuoDataType.thy:162:lemma [simp]: "msgrel``{U} \<in> Msg"
/srv/data/tum/isabelle/devel/src/HOL/Induct/Infinitely_Branching_Tree.thy:89:lemma [simp]: "(j, Succ j) \<in> brouwer_order"
/srv/data/tum/isabelle/devel/src/HOL/Induct/Infinitely_Branching_Tree.thy:92:lemma [simp]: "(f n, Lim f) \<in> brouwer_order"
/srv/data/tum/isabelle/devel/src/HOL/Induct/Com.thy:85:lemma [pred_set_conv]:
/srv/data/tum/isabelle/devel/src/HOL/Induct/Com.thy:90:lemma [pred_set_conv]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:429:lemma [presburger, algebra]: "m mod 2 = (1::nat) \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:430:lemma [presburger, algebra]: "m mod 2 = Suc 0 \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:431:lemma [presburger, algebra]: "m mod (Suc (Suc 0)) = (1::nat) \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:432:lemma [presburger, algebra]: "m mod (Suc (Suc 0)) = Suc 0 \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:433:lemma [presburger, algebra]: "m mod 2 = (1::int) \<longleftrightarrow> \<not> 2 dvd m " by presburger
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:442:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:470:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:476:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:481:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Presburger.thy:486:lemma [presburger]:
/srv/data/tum/isabelle/devel/src/HOL/Decision_Procs/Rat_Pair.thy:477:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy:344:lemma [simp]: "isnpoly (C (-1, 1))"
/srv/data/tum/isabelle/devel/src/HOL/Decision_Procs/Parametric_Ferrante_Rackoff.thy:400:lemma [simp]: "isnpoly 0\<^sub>p"
/srv/data/tum/isabelle/devel/src/HOL/Probability/SPMF.thy:18:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Word_Type.thy:142:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Word_Type.thy:149:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Reflection_Examples.thy:102:lemma [measure_function]: "is_measure fmsize" ..
/srv/data/tum/isabelle/devel/src/HOL/ex/Reflection_Examples.thy:149:lemma [measure_function]: "is_measure num_size" ..
/srv/data/tum/isabelle/devel/src/HOL/ex/Reflection_Examples.thy:270:lemma [measure_function]: "is_measure linaformsize" ..
/srv/data/tum/isabelle/devel/src/HOL/ex/Tarski.thy:427:lemma [simp]: "f \<in> pset cl \<rightarrow> pset cl \<and> monotone f (pset cl) (order cl)"
/srv/data/tum/isabelle/devel/src/HOL/ex/Transfer_Debug.thy:50:lemma [transfer_rule]: "bi_unique A \<Longrightarrow> rel_fun A (rel_fun (pcr_fset A) (=)) (\<in>) (|\<in>|)"
/srv/data/tum/isabelle/devel/src/HOL/ex/CTL.thy:31:lemma [intro!]: "p \<inter> p \<rightarrow> q \<subseteq> q" unfolding imp_def by auto
/srv/data/tum/isabelle/devel/src/HOL/ex/CTL.thy:32:lemma [intro!]: "p \<subseteq> (q \<rightarrow> p)" unfolding imp_def by rule
/srv/data/tum/isabelle/devel/src/HOL/ex/Residue_Ring.thy:75:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Residue_Ring.thy:79:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Residue_Ring.thy:83:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/ex/Serbian.thy:189:lemma [simp]: "azb2abc_aux (abc2azb_aux x) = [x]"
/srv/data/tum/isabelle/devel/src/HOL/ex/Serbian.thy:192:lemma [simp]: "abc2azb (Ž # xs) = Ж # abc2azb xs"
/srv/data/tum/isabelle/devel/src/HOL/ex/Serbian.thy:195:lemma [simp]: "abc2azb (J # xs) = Ј # abc2azb xs"
/srv/data/tum/isabelle/devel/src/HOL/ex/Erdoes_Szekeres.thy:68:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/ZF/LProd.thy:119:lemma [simp, intro]:
/srv/data/tum/isabelle/devel/src/HOL/ZF/LProd.thy:128:lemma [simp, intro]:
/srv/data/tum/isabelle/devel/src/HOL/Nitpick.thy:59:lemma [nitpick_simp]:
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:149:lemma [simp]: "avl t \<Longrightarrow> ht t = height t"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:164:lemma [simp]: "height(node l a r) = max (height l) (height r) + 1"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:465:lemma [simp]: "ht (fib_tree h) = h"
/srv/data/tum/isabelle/devel/src/HOL/Data_Structures/AVL_Set.thy:468:lemma [simp]: "height (fib_tree h) = h"
/srv/data/tum/isabelle/devel/src/HOL/Proofs/Lambda/InductTermi.thy:61:lemma [simp, THEN not_sym, simp]: "Var n \<degree>\<degree> ss \<noteq> Abs r \<degree> s \<degree>\<degree> ts"
/srv/data/tum/isabelle/devel/src/HOL/Proofs/Lambda/InductTermi.thy:64:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Limits.thy:1871:lemma [trans]: "X = Y \<Longrightarrow> Y \<longlonglongrightarrow> z \<Longrightarrow> X \<longlonglongrightarrow> z"
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:118:lemma [fundef_cong]:
/srv/data/tum/isabelle/devel/src/HOL/Quickcheck_Narrowing.thy:123:lemma [fundef_cong]:
/srv/data/tum/isabelle/devel/src/HOL/UNITY/Extend.thy:301:lemma [iff]: "(extend_act h act = extend_act h act') = (act = act')"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1535:lemma [induct_simp]: "(\<And>x. induct_equal x t \<Longrightarrow> PROP P x) \<equiv> PROP P t"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1546:lemma [induct_simp]: "(\<And>x. induct_equal t x \<Longrightarrow> PROP P x) \<equiv> PROP P t"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1557:lemma [induct_simp]: "(induct_false \<Longrightarrow> P) \<equiv> Trueprop induct_true"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1561:lemma [induct_simp]: "(induct_true \<Longrightarrow> PROP P) \<equiv> PROP P"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1571:lemma [induct_simp]: "(PROP P \<Longrightarrow> induct_true) \<equiv> Trueprop induct_true"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1575:lemma [induct_simp]: "(\<And>x::'a::{}. induct_true) \<equiv> Trueprop induct_true"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1579:lemma [induct_simp]: "induct_implies induct_true P \<equiv> P"
/srv/data/tum/isabelle/devel/src/HOL/HOL.thy:1582:lemma [induct_simp]: "x = x \<longleftrightarrow> True"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:14:lemma [import_const T]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:18:lemma [import_const "/\\"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:22:lemma [import_const "==>"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:26:lemma [import_const "!"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:30:lemma [import_const "?"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:34:lemma [import_const "\\/"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:38:lemma [import_const F]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:42:lemma [import_const "~"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:46:lemma [import_const "?!"]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:50:lemma [import_const "_FALSITY_"]: "False = False"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:59:lemma [import_const COND]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:63:lemma [import_const o]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:67:lemma [import_const I]: "id = (\<lambda>x::'A. x)"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:70:lemma [import_type 1 one_ABS one_REP]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:74:lemma [import_const one]: "() = (SOME x::unit. True)"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:77:lemma [import_const mk_pair]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:81:lemma [import_type prod ABS_prod REP_prod]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:85:lemma [import_const ","]: "Pair = (\<lambda>(x::'A) y::'B. Abs_prod (Pair_Rep x y))"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:88:lemma [import_const FST]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:92:lemma [import_const SND]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:100:lemma [import_const ONE_ONE : inj]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:104:lemma [import_const ONTO : surj]:
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:126:lemma [import_const NUMERAL]: "id = (\<lambda>x :: nat. x)"
/srv/data/tum/isabelle/devel/src/HOL/Import/HOL_Light_Maps.thy:131:lemma [import_const BIT0]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Mapping.thy:223:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Set.thy:43:lemma [simp]: "x \<noteq> Some () \<longleftrightarrow> x = None"
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_Product.thy:89:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_Product.thy:94:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_Product.thy:101:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Lattice_Constructions.thy:251:lemma [simp]: "Bot \<le> y"
/srv/data/tum/isabelle/devel/src/HOL/Library/Lattice_Constructions.thy:254:lemma [simp]: "y \<le> Top"
/srv/data/tum/isabelle/devel/src/HOL/Library/Extended_Real.thy:938:lemma [simp]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Order_Continuity.thy:62:lemma [order_continuous_intros]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Order_Continuity.thy:228:lemma [order_continuous_intros]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_List.thy:169:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_List.thy:173:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/Quotient_List.thy:182:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/src/HOL/Library/RBT_Impl.thy:308:lemma [simp]: "inv1 t \<Longrightarrow> inv1l t" by (cases t) simp+
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:41:lemma [simp]: "(\<forall>x<0. P(x))"
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:44:lemma [simp]: "~(\<exists>x<0. P(x))"
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:47:lemma [simp]: "(\<forall>x<succ(i). P(x)) <-> (Ord(i) \<longrightarrow> P(i) & (\<forall>x<i. P(x)))"
/srv/data/tum/isabelle/devel/src/ZF/OrdQuant.thy:52:lemma [simp]: "(\<exists>x<succ(i). P(x)) <-> (Ord(i) & (P(i) | (\<exists>x<i. P(x))))"
/srv/data/tum/isabelle/devel/src/ZF/Nat_ZF.thy:215:lemma [iff]: "quasinat(0)"
/srv/data/tum/isabelle/devel/src/ZF/Nat_ZF.thy:218:lemma [iff]: "quasinat(succ(x))"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:158:lemma [simp]: "bool_of_o(True) = 1"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:161:lemma [simp]: "bool_of_o(False) = 0"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:164:lemma [simp,TC]: "bool_of_o(P) \<in> bool"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:167:lemma [simp]: "(bool_of_o(P) = 1) \<longleftrightarrow> P"
/srv/data/tum/isabelle/devel/src/ZF/Bool.thy:170:lemma [simp]: "(bool_of_o(P) = 0) \<longleftrightarrow> ~P"
/srv/data/tum/isabelle/devel/src/ZF/equalities.thy:111:lemma [simp]: "cons(a,cons(a,B)) = cons(a,B)"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Relative.thy:1505:lemma [iff]: "quasilist(Nil)"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Relative.thy:1508:lemma [iff]: "quasilist(Cons(x,l))"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Formula.thy:90:lemma [simp]:
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Formula.thy:95:lemma [simp]:
/srv/data/tum/isabelle/devel/src/ZF/Constructible/Formula.thy:281:lemma [TC]: "x \<in> nat ==> incr_var(x,nq) \<in> nat"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/AC_in_L.thy:424:lemma [simp]: "L_r(f,0) = 0"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/AC_in_L.thy:427:lemma [simp]: "L_r(f, succ(i)) = DPow_r(f, L_r(f,i), Lset(i))"
/srv/data/tum/isabelle/devel/src/ZF/Constructible/AC_in_L.thy:432:lemma [simp]: "Limit(i) ==> L_r(f,i) = rlimit(i, L_r(f))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:153:lemma [simp]: "\<not>quasi_sturm_seq []" by (simp add: quasi_sturm_seq_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:825:lemma [simp]: "sturm_aux p q = [] \<longleftrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:830:lemma [simp]: "hd (sturm p) = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:833:lemma [simp]: "p \<in> set (sturm p)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:836:lemma [simp]: "length (sturm p) \<ge> 2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:844:lemma [simp]: "degree (last (sturm p)) = 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:852:lemma [simp]: "sturm_aux p q ! 0 = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:854:lemma [simp]: "sturm_aux p q ! Suc 0 = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:857:lemma [simp]: "sturm p ! 0 = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Sturm_Sequences/Sturm_Theorem.thy:859:lemma [simp]: "sturm p ! Suc 0 = pderiv p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nested_Multisets_Ordinals/Unary_PCF.thy:233:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nested_Multisets_Ordinals/Multiset_More.thy:830:lemma [simp]: "mset (list_of_mset m) = m"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Free-Groups/C2.thy:15:lemma [simp]: "(\<otimes>\<^bsub>C2\<^esub>) = (=)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Free-Groups/C2.thy:18:lemma [simp]: "\<one>\<^bsub>C2\<^esub> = True"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Free-Groups/C2.thy:21:lemma [simp]: "carrier C2 = UNIV"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:144:lemma [expr_diseq]:"p \<noteq> And p q" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:145:lemma [expr_diseq]:"q \<noteq> And p q" by(induction q, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:146:lemma [expr_diseq]:"p \<noteq> Not p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:147:lemma [expr_diseq]:"p \<noteq> Or p q" by(rule sizeF_diseq, auto simp add: Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:148:lemma [expr_diseq]:"q \<noteq> Or p q" by(rule sizeF_diseq, auto simp add: Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:149:lemma [expr_diseq]:"p \<noteq> Implies p q" by(rule sizeF_diseq, auto simp add: Implies_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:150:lemma [expr_diseq]:"q \<noteq> Implies p q" by(rule sizeF_diseq, auto simp add: Implies_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:151:lemma [expr_diseq]:"p \<noteq> Equiv p q" by(rule sizeF_diseq, auto simp add: Equiv_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:152:lemma [expr_diseq]:"q \<noteq> Equiv p q" by(rule sizeF_diseq, auto simp add: Equiv_def Or_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:153:lemma [expr_diseq]:"p \<noteq> Exists x p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:154:lemma [expr_diseq]:"p \<noteq> Diamond a p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Differential_Dynamic_Logic/Syntax.thy:155:lemma [expr_diseq]:"p \<noteq> InContext C p" by(induction p, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Feedback_Arcs.thy:45:lemma [simp]: "s\<lparr> state.more := \<lparr> fas = foo \<rparr> \<rparr> = s \<lparr> fas := foo \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Feedback_Arcs.thy:212:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Nested_DFS.thy:41:lemma [simp]: "s\<lparr> state.more := \<lparr> lasso = foo, red = bar \<rparr> \<rparr> = s \<lparr> lasso := foo, red := bar \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Nested_DFS.thy:908:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/DFS_Find_Path.thy:27:lemma [simp]: "s\<lparr> state.more := \<lparr> ppath = foo \<rparr> \<rparr> = s \<lparr> ppath := foo \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/DFS_Find_Path.thy:624:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Reachable_Nodes.thy:240:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Cyc_Check.thy:32:lemma [simp]: "s\<lparr> state.more := \<lparr> break = foo \<rparr> \<rparr> = s \<lparr> break := foo \<rparr>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Examples/Cyc_Check.thy:385:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:401:lemma [autoref_rules, param]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:441:lemma [autoref_op_pat_def]: "op_nos_on_stack_update f s
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:449:lemma [autoref_rules, param]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:493:lemma [autoref_op_pat_def]: "op_ns_on_stack_update f s
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:496:lemma [autoref_op_pat_def]: "op_ns_stack_update f s
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:529:lemma [autoref_rules, param]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Impl/Data/Simple_Impl.thy:547:lemma [refine_transfer_post_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DFS_Framework/Misc/Impl_Rev_Array_Stack.thy:22:lemma [relator_props]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/Trail.thy:118:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/MoreList.thy:872:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SATSolverVerification/MoreList.thy:876:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Markov_Models/MDP_Reachability_Problem.thy:35:lemma [measurable]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:84:lemma [simp]: "SKIP {S} \<sqsubseteq> c \<longleftrightarrow> (\<exists>S'. c = SKIP {S'} \<and> S \<sqsubseteq> S')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:87:lemma [simp]: "x ::= e {S} \<sqsubseteq> c \<longleftrightarrow> (\<exists>S'. c = x ::= e {S'} \<and> S \<sqsubseteq> S')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:90:lemma [simp]: "c1;;c2 \<sqsubseteq> c \<longleftrightarrow> (\<exists>c1' c2'. c = c1';;c2' \<and> c1 \<sqsubseteq> c1' \<and> c2 \<sqsubseteq> c2')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:93:lemma [simp]: "IF b THEN c1 ELSE c2 {S} \<sqsubseteq> c \<longleftrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:97:lemma [simp]: "{Inv} WHILE b DO c {P} \<sqsubseteq> w \<longleftrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:124:lemma [simp]: "(x \<sqsubseteq> None) = (x = None)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int0.thy:127:lemma [simp]: "(Some x \<sqsubseteq> u) = (\<exists>y. u = Some y & x \<sqsubseteq> y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int2_ivl.thy:51:lemma [simp]: "is_empty(I l h) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abs_Int_ITP2012/Abs_Int2_ivl.thy:55:lemma [simp]: "is_empty i \<Longrightarrow> \<gamma>_ivl i = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Bool_Func.thy:39:lemma [dest!,elim!]: "bf_False = bf_True \<Longrightarrow> False" "bf_True = bf_False \<Longrightarrow> False" unfolding fun_eq_iff by simp_all (* Occurs here and there as goal for sep_auto *)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Middle_Impl.thy:40:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Middle_Impl.thy:51:lemma [simp,intro!]: "bdd_sane emptymi"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Level_Collapse.thy:164:lemma [sep_heap_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:59:lemma [sep_heap_rules]: "tmi' bdd = Some (p,bdd')
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:65:lemma [sep_heap_rules]: "fmi' bdd = Some (p,bdd')
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:71:lemma [sep_heap_rules]: "ifmi' v t e bdd = Some (p, bdd') \<Longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:96:lemma [sep_decon_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:115:lemma [sep_heap_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ROBDD/Conc_Impl.thy:136:lemma [sep_heap_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:47:lemma [simp]: "r <= s \<Longrightarrow> r < s+(1::real)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:49:lemma [simp]: "r < s \<Longrightarrow> r < s+(1::real)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:51:lemma [simp]: "r <= s \<Longrightarrow> \<not> s+(1::real) < r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:53:lemma [simp]: "(r < s-(1::real)) = (r+1 < s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:55:lemma [simp]: "(s-(1::real) < r) = (s < r+1)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:61:lemma [simp]: "\<lbrakk> p <\<cdot> b; x \<noteq> b \<rbrakk> \<Longrightarrow> p x < p b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:64:lemma [simp]: assumes top: "p <\<cdot> b" shows "\<not> p b < p c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:86:lemma [simp]: "extreme p b \<Longrightarrow> (\<not> p <\<cdot> b) = (b \<cdot>< p)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:91:lemma [simp]: "extreme p b \<Longrightarrow> (\<not> b \<cdot>< p) = (p <\<cdot> b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:113:lemma [simp]: "a \<noteq> b \<Longrightarrow> mktop p b a = p a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:116:lemma [simp]: "a \<noteq> b \<Longrightarrow> mkbot p b a = p a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:119:lemma [simp]: "a \<noteq> b \<Longrightarrow> p a < mktop p b b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:122:lemma [simp]: "a \<noteq> b \<Longrightarrow> mkbot p b b < p a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:125:lemma [simp]: "mktop p b <\<cdot> b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:128:lemma [simp]: "\<not> b \<cdot>< mktop p b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/ArrowImpossibilityGS/Thys/Arrow_Utility.thy:131:lemma [simp]: "a \<noteq> b \<Longrightarrow> \<not> P p a < mkbot (P p) b b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Circ_List.thy:22:lemma [simp]: "cs_list l None = \<up>(l=[])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Circ_List.thy:25:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Open_List.thy:123:lemma [simp, sep_dflt_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Separation_Logic_Imperative_HOL/Examples/Open_List.thy:183:lemma [simp, sep_dflt_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/AutoProj.thy:20:lemma [simp]: "start(q,d,f) = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/AutoProj.thy:23:lemma [simp]: "next(q,d,f) = d"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/AutoProj.thy:26:lemma [simp]: "fin(q,d,f) = f"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Functional-Automata/DA.thy:25:lemma [simp]: "foldl2 f [] a = a \<and> foldl2 f (x#xs) a = foldl2 f xs (f x a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:327:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:338:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:348:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:359:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Prpu_Maxflow/Relabel_To_Front_Impl.thy:371:lemma [sepref_fr_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/BinomialHeap.thy:1041:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/BinomialHeap.thy:1045:lemma [simp, code abstype]: "Abs_BinomialHeap (Rep_BinomialHeap q) = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2200:lemma [simp]: "bs_meld x (Inl u) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2220:lemma [simp]: "bs_invar bs_empty" by (simp add: bs_empty_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2305:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Binomial-Heaps/SkewBinomialHeap.thy:2310:lemma [simp, code abstype]: "Abs_SkewBinomialHeap (Rep_SkewBinomialHeap q) = q"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/DataRefinementIBP/DataRefinement.thy:106:lemma [simp]: "Disjunctive_fun R \<Longrightarrow> mono ((R i)::'a::complete_lattice \<Rightarrow> 'b::complete_lattice)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_Nat.thy:133:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_Nat.thy:151:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_Nat.thy:175:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Examples/Hamming_Stream.thy:70:lemma [partial_function_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Examples/Resumption.thy:87:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Examples/Resumption.thy:153:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/TLList.thy:757:lemma [simp, nitpick_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List_Prefix.thy:76:lemma [simp]: assumes "xs \<noteq> LNil" "ys \<noteq> LNil" "lhd xs = lhd ys"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:866:lemma [partial_function_mono]: "mono_llist F \<Longrightarrow> mono_llist (\<lambda>f. lmap g (F f))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:1252:lemma [simp, nitpick_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:1543:lemma [partial_function_mono]: "mono_llist F \<Longrightarrow> mono_llist (\<lambda>f. ltake n (F f))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:2132:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Coinductive/Coinductive_List.thy:3285:lemma [simp, code]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/CAVA_Impl.thy:466:lemma [autoref_op_pat]: "cava_inter_impl_loc.dflt_inter \<equiv> op_dflt_inter"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/BoolProgs/BoolProgs.thy:244:lemma [simp]: "length (list_of_array a) = array_length a" by (cases a) auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/Nested_DFS/NDFS_SI_Statistics.thy:64:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/Nested_DFS/NDFS_SI.thy:1236:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_LTL_Modelchecker/Nested_DFS/NDFS_SI.thy:1252:lemma [autoref_op_pat]: "NO_CYC \<equiv> OP NO_CYC :::\<^sub>i i_blue_wit" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:633:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:642:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:649:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:660:lemma [enres_breakdown]: "EWHILEIT I c (\<lambda>s. enres_lift (f s)) s = enres_lift (WHILEIT I c f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:684:lemma [enres_breakdown]: "EWHILET c (\<lambda>s. enres_lift (f s)) s = enres_lift (WHILET c f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:687:lemma [enres_breakdown]: "enfoldli l c (\<lambda>x s. enres_lift (f x s)) s = enres_lift (nfoldli l c f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:692:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:697:lemma [enres_breakdown]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/VerifyThis2018/lib/Exc_Nres_Monad.thy:701:lemma [enres_breakdown]: "(if b then enres_lift m else enres_lift n) = enres_lift (if b then m else n)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:251:lemma [simp]: "islist Null h"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:254:lemma [simp]: "p\<noteq>Null \<Longrightarrow> islist (h p) h = islist p h"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:257:lemma [simp]: "list Null h = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HeapList.thy:266:lemma [simp]: "islist (h p) h \<Longrightarrow> p \<notin> set(list (h p) h)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1194:lemma [trans] : "P' \<subseteq> P \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P' c Q,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1197:lemma [trans]: "Q \<subseteq> Q' \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P c Q',A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1200:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1204:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1208:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1212:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoareTotal.thy:1216:lemma [intro?]: "\<Gamma>,\<Theta>\<turnstile>\<^sub>t\<^bsub>/F\<^esub> P Skip P,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1149:lemma [trans] : "P' \<subseteq> P \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P' c Q,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1152:lemma [trans]: "Q \<subseteq> Q' \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P c Q,A \<Longrightarrow> \<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P c Q',A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1155:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1159:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1163:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1167:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Simpl/HoarePartial.thy:1171:lemma [intro?]: "\<Gamma>,\<Theta>\<turnstile>\<^bsub>/F\<^esub> P Skip P,A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/Value.thy:15:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/Value.thy:23:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-restr.thy:134:lemma [simp]: "\<bottom>|\<^bsub>r\<^esub> = \<bottom>" by fixrec_simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-restr.thy:135:lemma [simp]: "f\<cdot>\<bottom> = \<bottom> \<Longrightarrow> f|\<^bsub>\<bottom>\<^esub> = \<bottom>" by fixrec_simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/HOLCF-Utils.thy:161:lemma [simp]: "cfun_comp\<cdot>f\<cdot>(\<rho>(x := v)) = (cfun_comp\<cdot>f\<cdot>\<rho>)(x := f\<cdot>v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/CValue.thy:26:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-Meet.thy:64:lemma [simp]: "C\<cdot>r \<sqinter> r = r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-Meet.thy:67:lemma [simp]: "r \<sqinter> C\<cdot>r = r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/C-Meet.thy:70:lemma [simp]: "C\<cdot>r \<sqinter> C\<cdot>r' = C\<cdot>(r \<sqinter> r')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:353:lemma [elim_format, elim!]: "x \<triangleleft>\<triangleright> \<bottom> \<Longrightarrow> x = \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:360:lemma [elim_format, elim!]: "x \<triangleleft>\<triangleright> CB\<cdot>b \<Longrightarrow> x = B\<cdot>b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:367:lemma [elim_format, elim!]: "\<bottom> \<triangleleft>\<triangleright> y \<Longrightarrow> y = \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/ValueSimilarity.thy:374:lemma [elim_format, elim!]: "B\<cdot>b \<triangleleft>\<triangleright> y \<Longrightarrow> y = CB\<cdot>b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/HOLCF-Meet.thy:183:lemma [simp]: "(r::'a::Finite_Meet_cpo) \<sqinter> (r \<sqinter> x) = r \<sqinter> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Launchbury/Terms.thy:124:lemma [simp]: "size (heapToAssn \<Gamma>) = size_list (\<lambda> (v,e) . size e) \<Gamma>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KBPs/Trie2.thy:18:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KBPs/Trie2.thy:23:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Depth-First-Search/DFS.thy:40:lemma [simp]: "x \<notin> nodes_of g \<Longrightarrow> nexts g x = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Depth-First-Search/DFS.thy:43:lemma [simp]: "finite (nodes_of g - set ys)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:135:lemma [simp]: "a \<notin> scf R1" by (rule pareto_efficiency) (simp_all add: eval_pareto R1.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:136:lemma [simp]: "a \<notin> scf R2" by (rule pareto_efficiency) (simp_all add: eval_pareto R2.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:137:lemma [simp]: "a \<notin> scf R3" by (rule pareto_efficiency) (simp_all add: eval_pareto R3.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:138:lemma [simp]: "a \<notin> scf R6" by (rule pareto_efficiency) (simp_all add: eval_pareto R6.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:139:lemma [simp]: "a \<notin> scf R7" by (rule pareto_efficiency) (simp_all add: eval_pareto R7.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:140:lemma [simp]: "b \<notin> scf R8" by (rule pareto_efficiency) (simp_all add: eval_pareto R8.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:141:lemma [simp]: "c \<notin> scf R9" by (rule pareto_efficiency) (simp_all add: eval_pareto R9.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:142:lemma [simp]: "a \<notin> scf R12" by (rule pareto_efficiency) (simp_all add: eval_pareto R12.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:143:lemma [simp]: "b \<notin> scf R14" by (rule pareto_efficiency) (simp_all add: eval_pareto R14.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:144:lemma [simp]: "c \<notin> scf R15" by (rule pareto_efficiency) (simp_all add: eval_pareto R15.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:145:lemma [simp]: "b \<notin> scf R16" by (rule pareto_efficiency) (simp_all add: eval_pareto R16.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:146:lemma [simp]: "c \<notin> scf R17" by (rule pareto_efficiency) (simp_all add: eval_pareto R17.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:147:lemma [simp]: "c \<notin> scf R18" by (rule pareto_efficiency) (simp_all add: eval_pareto R18.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:148:lemma [simp]: "b \<notin> scf R19" by (rule pareto_efficiency) (simp_all add: eval_pareto R19.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:149:lemma [simp]: "c \<notin> scf R20" by (rule pareto_efficiency) (simp_all add: eval_pareto R20.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Fishburn_Impossibility/Fishburn_Impossibility.thy:150:lemma [simp]: "c \<notin> scf R21" by (rule pareto_efficiency) (simp_all add: eval_pareto R21.eval)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Formula_Derivatives/Presburger_Formula.thy:249:lemma [Presb_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example.thy:176:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:158:lemma [simp]: "pred_entailment P {}" by(simp add: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:159:lemma [simp]: "e \<in> P \<Longrightarrow> pred_entailment P {e}" by(blast intro: subset_entailment)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:160:lemma [simp]: "FF \<in> P \<Longrightarrow> pred_entailment P Q" by(auto simp: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_TypeSystem.thy:255:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_Swap_Add.thy:277:lemma [simp]: "pred_entailment P {}" by(simp add: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_Swap_Add.thy:278:lemma [simp]: "e \<in> P \<Longrightarrow> pred_entailment P {e}" by(blast intro: subset_entailment)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Examples/Example_Swap_Add.thy:279:lemma [simp]: "FF \<in> P \<Longrightarrow> pred_entailment P Q" by(auto simp: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Security.thy:156:lemma [simp]: "mem =\<^sup>l mem' \<Longrightarrow> mem =\<^bsub>mds\<^esub>\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Type_Systems/Security.thy:159:lemma [simp]: "(\<forall> mds. mem =\<^bsub>mds\<^esub>\<^sup>l mem') \<Longrightarrow> mem =\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/Category.thy:412:lemma [simp]: "Category(UnitCategory)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/SetCat.thy:390:lemma [elim]: "\<lbrakk>LSCategory C ;
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/SetCat.thy:410:lemma [simp]: "LSCategory C \<Longrightarrow> Category C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/MonadicEquationalTheory.thy:427:lemma [simp]: "ZFAxioms T \<Longrightarrow> Axioms T" by (simp add: ZFAxioms_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/MonadicEquationalTheory.thy:820:lemma [simp]: "ZFAxioms T \<Longrightarrow> Category iC\<^bsub>CI T\<^esub>" by(simp add: CanonicalInterpretation_def CanonicalCatCat[of T])
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/MonadicEquationalTheory.thy:821:lemma [simp]: "ZFAxioms T \<Longrightarrow> Signature iS\<^bsub>CI T\<^esub>" by(simp add: CanonicalInterpretation_def Axioms.AxSig)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:40:lemma [simp]: "NatTrans \<eta> \<Longrightarrow> NatTransP \<eta>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:220:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NatTrans \<eta>1" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:221:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NatTrans \<eta>2" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:224:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatDom (\<eta>1 \<bullet>1 \<eta>2) = NTCatDom \<eta>1" by (auto simp add: NatTransComp'_def NTCatDom_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:225:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatCod (\<eta>1 \<bullet>1 \<eta>2) = NTCatCod \<eta>1" by (auto simp add: NatTransComp'_def NTCatCod_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:226:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatDom (\<eta>1 \<bullet> \<eta>2) = NTCatDom \<eta>1" by (auto simp add: NatTransComp_defs)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:227:lemma [simp]: "\<eta>1 \<approx>>\<bullet> \<eta>2 \<Longrightarrow> NTCatCod (\<eta>1 \<bullet> \<eta>2) = NTCatCod \<eta>1" by (auto simp add: NatTransComp_defs)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:228:lemma [simp]: "NatTrans \<eta> \<Longrightarrow> Category(NTCatDom \<eta>)" by (simp add: NatTransP.NatTransFtor NTCatDom_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Category2/NatTrans.thy:229:lemma [simp]: "NatTrans \<eta> \<Longrightarrow> Category(NTCatCod \<eta>)" by (simp add: NatTransP.NatTransFtor2 NTCatCod_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:108:lemma [simp]: "`-p + p = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:111:lemma [simp]: "`p + (-p) = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:114:lemma [simp]: "`(-p) \<cdot> p = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:117:lemma [simp]: "`p \<cdot> (-p) = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:154:lemma [simp]: "`!p + p = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:157:lemma [simp]: "`p + !p = 1`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:160:lemma [simp]: "`!p \<cdot> p = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:163:lemma [simp]: "`p \<cdot> !p = 0`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:208:lemma [simp]: "`!p \<cdot> !p = !p`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/KAT_and_DRA/TwoSorted/KAT2.thy:227:lemma [vcg]: "`\<lbrace>p \<cdot> t\<rbrace> c \<lbrace>p\<rbrace>` \<Longrightarrow> `!t \<cdot> p \<le> q` \<Longrightarrow> `\<lbrace>p\<rbrace> While t Do c End \<lbrace>q\<rbrace>`"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/AVL-Trees/AVL.thy:124:lemma [simp]: "avl t \<Longrightarrow> ht t = height t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/AVL-Trees/AVL.thy:139:lemma [simp]: "height(mkt x l r) = max (height l) (height r) + 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:27:lemma [simp]: "{\<cdot>p} \<in> assertion"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:30:lemma [simp]: "abs_wpt ({\<cdot>p}) = p"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:35:lemma [simp]: "x \<in> assertion \<Longrightarrow> {\<cdot>Abs_Assertion x} = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Assertion_Algebra.thy:40:lemma [simp]: "x \<in> assertion \<Longrightarrow> {\<cdot>abs_wpt x} = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran.thy:143:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran.thy:241:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran.thy:245:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:198:lemma [simp]: "(x * \<top>) * y = x * \<top>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:201:lemma [simp]: "(x * \<bottom>) * y = x * \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:428:lemma [simp]: "x \<in> assertion \<Longrightarrow> y \<in> assertion \<Longrightarrow> x \<sqinter> y \<le> x * y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:462:lemma [simp]: "x \<in> assertion \<Longrightarrow> x * y \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:466:lemma [simp]: "x \<in> assertion \<Longrightarrow> y \<in> assertion \<Longrightarrow> x * y \<le> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:490:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<squnion> 1 = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:493:lemma [simp]: "x \<in> assertion \<Longrightarrow> 1 \<squnion> x = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:496:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<sqinter> 1 = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:499:lemma [simp]: "x \<in> assertion \<Longrightarrow> 1 \<sqinter> x = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:502:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<le> x * \<top>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:505:lemma [simp]: "x \<in> assertion \<Longrightarrow> x \<le> 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:555:lemma [simp]: "(neg_assert x) ^ o * y \<squnion> x * \<top> = (neg_assert x) ^ o * y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:559:lemma [simp]: " x * \<top> \<squnion> (neg_assert x) ^ o * y= (neg_assert x) ^ o * y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:621:lemma [simp]: "x \<in> assertion \<Longrightarrow> x * x = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:624:lemma [simp]: "x \<in> assertion \<Longrightarrow> (x ^ o) * (x ^ o) = x ^ o"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:628:lemma [simp]: "x \<in> assertion \<Longrightarrow> x * (x ^ o) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:638:lemma [simp]: "x \<in> assertion \<Longrightarrow> (x ^ o) * x = x ^ o"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:643:lemma [simp]: "\<bottom> \<in> assertion"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:646:lemma [simp]: "1 \<in> assertion"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:699:lemma [simp]: "x \<le> y \<Longrightarrow> x \<sqinter> y = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:757:lemma [simp]: "x \<le> 1 \<Longrightarrow> y * x \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:760:lemma [simp]: "x \<le> x * \<top>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:763:lemma [simp]: "x * \<bottom> \<le> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Mono_Bool_Tran_Algebra.thy:920:lemma [simp]: "mono (\<lambda> (t::'a::mbt_algebra) . x * t \<sqinter> y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:21:lemma [simp]: "{\<cdot>p} * \<top> \<sqinter> [\<cdot>p] = {\<cdot>p}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:26:lemma [simp]: "[\<cdot>p] * x \<squnion> {\<cdot>-p} * \<top> = [\<cdot>p] * x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:29:lemma [simp]: "{\<cdot>p} * \<top> \<squnion> [\<cdot>-p] * x = [\<cdot>-p] * x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MonoBoolTranAlgebra/Statements.thy:110:lemma [simp]: "wp 1 = id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:21:lemma [simp]: "(x \<sqinter> y) \<sqinter> z \<le> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:24:lemma [simp]: "x \<sqinter> y \<sqinter> z \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:27:lemma [simp]: "x \<sqinter> (y \<sqinter> z) \<le> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:30:lemma [simp]: "x \<sqinter> (y \<sqinter> z) \<le> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:36:lemma [simp]: "x \<le> x \<squnion> y \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:39:lemma [simp]: "y \<le> x \<squnion> y \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:42:lemma [simp]: "y \<le> x \<squnion> (y \<squnion> z)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:45:lemma [simp]: "z \<le> x \<squnion> (y \<squnion> z)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:51:lemma [simp]: "x \<sqinter> y \<le> x \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:54:lemma [simp]: "y \<sqinter> x \<le> x \<squnion> z"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:57:lemma [simp]: "x \<sqinter> y \<le> z \<squnion> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Prop.thy:60:lemma [simp]: "y \<sqinter> x \<le> z \<squnion> x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:207:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Conjunctive \<Longrightarrow> F \<in> Apply.conjunctive"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:213:lemma [simp]: "F \<in> Apply.conjunctive \<Longrightarrow> mono F"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:226:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Conjunctive \<Longrightarrow> F top = top"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:231:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Disjunctive \<Longrightarrow> F \<in> Apply.disjunctive"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:237:lemma [simp]: "F \<in> Apply.disjunctive \<Longrightarrow> mono F"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Conj_Disj.thy:251:lemma [simp]: "(F::'a::complete_lattice \<Rightarrow> 'b::complete_lattice) \<in> Apply.Disjunctive \<Longrightarrow> F bot = bot"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:44:lemma [simp]: "(a \<sqinter> b) + c = (a + c) \<sqinter> (b + c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:61:lemma [simp]: "(a \<sqinter> b) - c = (a - c) \<sqinter> (b - c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:73:lemma [simp]: "c + (a \<sqinter> b) = (c + a) \<sqinter> (c + b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:89:lemma [simp]: "- (a \<sqinter> b) = (- a) \<squnion> (- b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:105:lemma [simp]: "(a \<squnion> b) + c = (a + c) \<squnion> (b + c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:122:lemma [simp]: "c + (a \<squnion> b) = (c + a) \<squnion> (c + b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:138:lemma [simp]: "c - (a \<sqinter> b) = (c - a) \<squnion> (c - b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:141:lemma [simp]: "(a \<squnion> b) - c = (a - c) \<squnion> (b - c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:144:lemma [simp]: "- (a \<squnion> b) = (- a) \<sqinter> (- b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Lattice_Ordered_Group.thy:155:lemma [simp]: "c - (a \<squnion> b) = (c - a) \<sqinter> (c - b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:70:lemma [simp]: "a_aux a b c \<le> e_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:76:lemma [simp]: "b_aux a b c \<le> e_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:81:lemma [simp]: "c_aux a b c \<le> e_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:86:lemma [simp]: "d_aux a b c \<le> a_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:89:lemma [simp]: "d_aux a b c \<le> b_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LatticeProperties/Modular_Distrib_Lattice.thy:94:lemma [simp]: "d_aux a b c \<le> c_aux a b c"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Factorization/Missing_List.thy:705:lemma [simp]: "set (union_list_sorted xs ys) = set xs \<union> set ys"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:37:lemma [simp]: "Node lt a rt \<noteq> lt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:40:lemma [simp]: "lt \<noteq> Node lt a rt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:43:lemma [simp]: "Node lt a rt \<noteq> rt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BDD/BinDag.thy:46:lemma [simp]: "rt \<noteq> Node lt a rt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Tool/Autoref_Tool.thy:189:lemma [autoref_itype]: "CAST ::\<^sub>i I \<rightarrow>\<^sub>i I" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Parametricity/Relators.thy:922:lemma [rel2p]: "rel2p (\<langle>A\<rangle>set_rel) = rel_set (rel2p A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Automatic_Refinement/Parametricity/Relators.thy:926:lemma [p2rel]: "left_unique A \<Longrightarrow> p2rel (rel_set A) = (\<langle>p2rel A\<rangle>set_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_Skeleton.thy:36:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_GBG_Code.thy:354:lemma [autoref_op_pat]: "igb_graph.find_lasso_spec \<equiv> op_find_lasso_spec"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_GBG_Code.thy:359:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Find_Path_Impl.thy:352:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Gabow_SCC/Gabow_Skeleton_Code.thy:86:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SIFUM_Type_Systems/Security.thy:72:lemma [simp]: "mem =\<^sup>l mem' \<Longrightarrow> mem =\<^bsub>mds\<^esub>\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/SIFUM_Type_Systems/Security.thy:75:lemma [simp]: "(\<forall> mds. mem =\<^bsub>mds\<^esub>\<^sup>l mem') \<Longrightarrow> mem =\<^sup>l mem'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Dynamic/BitVector.thy:19:lemma [dest!]: "xs \<preceq>\<^sub>b [] \<Longrightarrow> xs = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/While/Com.thy:57:lemma [dest]:"#:c = 0 \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG.thy:24:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (sourcenode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG.thy:27:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (targetnode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:28:lemma [simp]: "valid_node (_Entry_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:35:lemma [simp]: "valid_node (_Exit_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:52:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:56:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:60:lemma [simp]:"\<lbrakk>valid_edge a; targetnode a \<noteq> (_Exit_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFGExit.thy:64:lemma [simp]:"\<lbrakk>valid_edge a; sourcenode a \<noteq> (_Entry_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG_wf.thy:34:lemma [dest!]: "V \<in> Use (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/Basic/CFG_wf.thy:37:lemma [dest!]: "V \<in> Def (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/StaticIntra/PDG.thy:208:lemma [simp]: "PDG.PDG_BS sourcenode targetnode valid_edge Def Use
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/StaticIntra/PDG.thy:264:lemma [simp]: "PDG.PDG_BS sourcenode targetnode valid_edge Def Use
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:106:lemma [simp]: "Abs_wf_jvmprog (EP, Phi_EP)\<^bsub>wf\<^esub> = EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:118:lemma [simp]: "Abs_wf_jvmprog (EP, Phi_EP)\<^bsub>\<Phi>\<^esub> = Phi_EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:157:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Slicing/JinjaVM/JVMPostdomination.thy:162:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/P2S2R.thy:161:lemma [simp]: "p2r bot = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:69:lemma [simp]: "p2pp P \<union> p2pp Q = p2pp (P \<squnion> Q)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:72:lemma [simp]: "p2pp P; p2pp Q = p2pp (P \<sqinter> Q)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:75:lemma [intro!]: "P \<le> Q \<Longrightarrow> \<lceil>P\<rceil> \<subseteq> \<lceil>Q\<rceil>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Algebraic_VCs/AVC_KAD/Path_Model_Example.thy:78:lemma [simp]: "rdom \<lceil>P\<rceil> = \<lceil>P\<rceil>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Myhill-Nerode/Closures2.thy:101:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Myhill-Nerode/Myhill_2.thy:20:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Verified-Prover/Prover.thy:715:lemma [simp]: "s_of_ns (ns_of_s s) = s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun2.thy:618:lemma [simp]: "nat_to_sch index_of_c_fst = Base_fst" by (unfold index_of_c_fst_def, rule nat_to_sch_srj)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun2.thy:622:lemma [simp]: "nat_to_sch index_of_c_snd = Base_snd" by (unfold index_of_c_snd_def, rule nat_to_sch_srj)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFinSet.thy:790:lemma [simp]: "set_to_nat (nat_to_set u) = u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:25:lemma [simp]: "c_len 0 = 0" by (simp add: c_len_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:279:lemma [simp]: "list_to_nat [] = 0" by (simp add: list_to_nat_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:281:lemma [simp]: "nat_to_list 0 = []" by (simp add: nat_to_list_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:320:lemma [simp]: "c_hd 0 = 0" by (simp add: c_hd_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecList.thy:398:lemma [simp]: "c_tl 0 = 0" by (simp add: c_tl_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:255:lemma [simp]: "sgn1 0 = 0" by (simp add: sgn1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:256:lemma [simp]: "sgn1 (Suc y) = 1" by (simp add: sgn1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:257:lemma [simp]: "sgn2 0 = 1" by (simp add: sgn2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:258:lemma [simp]: "sgn2 (Suc y) = 0" by (simp add: sgn2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:259:lemma [simp]: "x \<noteq> 0 \<Longrightarrow> sgn1 x = 1" by (simp add: sgn1_def, cases x, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:260:lemma [simp]: "x \<noteq> 0 \<Longrightarrow> sgn2 x = 0" by (simp add: sgn2_def, cases x, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:867:lemma [simp]: "pr_conv_1_to_2 (pr_conv_2_to_1 f) = f" by(simp add: pr_conv_1_to_2_def pr_conv_2_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:868:lemma [simp]: "pr_conv_2_to_1 (pr_conv_1_to_2 f) = f" by(simp add: pr_conv_1_to_2_def pr_conv_2_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:869:lemma [simp]: "pr_conv_1_to_3 (pr_conv_3_to_1 f) = f" by(simp add: pr_conv_1_to_3_def pr_conv_3_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:870:lemma [simp]: "pr_conv_3_to_1 (pr_conv_1_to_3 f) = f" by(simp add: pr_conv_1_to_3_def pr_conv_3_to_1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:871:lemma [simp]: "pr_conv_3_to_2 (pr_conv_2_to_3 f) = f" by(simp add: pr_conv_3_to_2_def pr_conv_2_to_3_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Recursion-Theory-I/PRecFun.thy:872:lemma [simp]: "pr_conv_2_to_3 (pr_conv_3_to_2 f) = f" by(simp add: pr_conv_3_to_2_def pr_conv_2_to_3_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Boolean.thy:64:lemma [simp,code_unfold] : "(true \<doteq> false) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Boolean.thy:66:lemma [simp,code_unfold] : "(false \<doteq> true) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:90:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:94:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:99:lemma [simp,code_unfold]: "\<delta> \<zero> = true" by(simp add:OclInt0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:100:lemma [simp,code_unfold]: "\<upsilon> \<zero> = true" by(simp add:OclInt0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:101:lemma [simp,code_unfold]: "\<delta> \<one> = true" by(simp add:OclInt1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:102:lemma [simp,code_unfold]: "\<upsilon> \<one> = true" by(simp add:OclInt1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:103:lemma [simp,code_unfold]: "\<delta> \<two> = true" by(simp add:OclInt2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:104:lemma [simp,code_unfold]: "\<upsilon> \<two> = true" by(simp add:OclInt2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:105:lemma [simp,code_unfold]: "\<delta> \<six> = true" by(simp add:OclInt6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:106:lemma [simp,code_unfold]: "\<upsilon> \<six> = true" by(simp add:OclInt6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:107:lemma [simp,code_unfold]: "\<delta> \<eight> = true" by(simp add:OclInt8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:108:lemma [simp,code_unfold]: "\<upsilon> \<eight> = true" by(simp add:OclInt8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:109:lemma [simp,code_unfold]: "\<delta> \<nine> = true" by(simp add:OclInt9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Integer.thy:110:lemma [simp,code_unfold]: "\<upsilon> \<nine> = true" by(simp add:OclInt9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:91:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:95:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:100:lemma [simp,code_unfold]: "\<delta> \<zero>.\<zero> = true" by(simp add:OclReal0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:101:lemma [simp,code_unfold]: "\<upsilon> \<zero>.\<zero> = true" by(simp add:OclReal0_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:102:lemma [simp,code_unfold]: "\<delta> \<one>.\<zero> = true" by(simp add:OclReal1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:103:lemma [simp,code_unfold]: "\<upsilon> \<one>.\<zero> = true" by(simp add:OclReal1_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:104:lemma [simp,code_unfold]: "\<delta> \<two>.\<zero> = true" by(simp add:OclReal2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:105:lemma [simp,code_unfold]: "\<upsilon> \<two>.\<zero> = true" by(simp add:OclReal2_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:106:lemma [simp,code_unfold]: "\<delta> \<six>.\<zero> = true" by(simp add:OclReal6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:107:lemma [simp,code_unfold]: "\<upsilon> \<six>.\<zero> = true" by(simp add:OclReal6_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:108:lemma [simp,code_unfold]: "\<delta> \<eight>.\<zero> = true" by(simp add:OclReal8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:109:lemma [simp,code_unfold]: "\<upsilon> \<eight>.\<zero> = true" by(simp add:OclReal8_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:110:lemma [simp,code_unfold]: "\<delta> \<nine>.\<zero> = true" by(simp add:OclReal9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Real.thy:111:lemma [simp,code_unfold]: "\<upsilon> \<nine>.\<zero> = true" by(simp add:OclReal9_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:82:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:86:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. \<lfloor>\<lfloor>n\<rfloor>\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:91:lemma [simp,code_unfold]: "\<delta> \<a> = true" by(simp add:OclStringa_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_String.thy:92:lemma [simp,code_unfold]: "\<upsilon> \<a> = true" by(simp add:OclStringa_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:108:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e None) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:114:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e None) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:120:lemma [simp,code_unfold]: "\<delta> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e \<lfloor>None\<rfloor>) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/basic_types/UML_Void.thy:126:lemma [simp,code_unfold]: "\<upsilon> (\<lambda>_. Abs_Void\<^sub>b\<^sub>a\<^sub>s\<^sub>e \<lfloor>None\<rfloor>) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Sequence.thy:121:lemma [simp,code_unfold]: "const Sequence{}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Sequence.thy:197:lemma [simp,code_unfold] : "(Sequence{}->including\<^sub>S\<^sub>e\<^sub>q(a)) = (Sequence{}->prepend\<^sub>S\<^sub>e\<^sub>q(a))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Sequence.thy:202:lemma [simp,code_unfold] : "((S->prepend\<^sub>S\<^sub>e\<^sub>q(a))->including\<^sub>S\<^sub>e\<^sub>q(b)) = ((S->including\<^sub>S\<^sub>e\<^sub>q(b))->prepend\<^sub>S\<^sub>e\<^sub>q(a))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:333:lemma [simp,code_unfold]: "const Set{}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1839:lemma [simp,code_unfold]: "Set{} ->size\<^sub>S\<^sub>e\<^sub>t() = \<zero>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1927:lemma [simp,code_unfold]: "Set{}->isEmpty\<^sub>S\<^sub>e\<^sub>t() = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1965:lemma [simp,code_unfold]: "Set{}->notEmpty\<^sub>S\<^sub>e\<^sub>t() = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:1979:lemma [simp,code_unfold]: "Set{}->any\<^sub>S\<^sub>e\<^sub>t() = null"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2753:lemma [simp,code_unfold]: "\<delta> (Set{} ->size\<^sub>S\<^sub>e\<^sub>t()) = true"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2757:lemma [simp,code_unfold]: "\<delta> ((X ->including\<^sub>S\<^sub>e\<^sub>t(x)) ->size\<^sub>S\<^sub>e\<^sub>t()) = (\<delta>(X->size\<^sub>S\<^sub>e\<^sub>t()) and \<upsilon>(x))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2812:lemma [simp,code_unfold]: "\<delta> ((X ->excluding\<^sub>S\<^sub>e\<^sub>t(x)) ->size\<^sub>S\<^sub>e\<^sub>t()) = (\<delta>(X->size\<^sub>S\<^sub>e\<^sub>t()) and \<upsilon>(x))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Set.thy:2866:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/collection_types/UML_Bag.thy:329:lemma [simp,code_unfold]: "const Bag{}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Analysis/Analysis_UML.thy:1090:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1) = {oid0,oid1\<^cancel>\<open>,oid2\<close>,oid3,oid4,oid5\<^cancel>\<open>,oid6,oid7\<close>,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Analysis/Analysis_UML.thy:1093:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1') = {oid0,oid1,oid2,oid3\<^cancel>\<open>,oid4\<close>,oid5,oid6,oid7,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Design/Design_UML.thy:1048:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1) = {oid0,oid1\<^cancel>\<open>,oid2\<close>,oid3,oid4,oid5\<^cancel>\<open>,oid6,oid7\<close>,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/examples/Employee_Model/Design/Design_UML.thy:1051:lemma [simp,code_unfold]: "dom (heap \<sigma>\<^sub>1') = {oid0,oid1,oid2,oid3\<^cancel>\<open>,oid4\<close>,oid5,oid6,oid7,oid8}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:77:lemma [simp]: "false (a, b) = \<lfloor>\<lfloor>False\<rfloor>\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:80:lemma [simp]: "true (a, b) = \<lfloor>\<lfloor>True\<rfloor>\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:316:lemma [simp,code_unfold]: "(true \<triangleq> false) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Featherweight_OCL/UML_Logic.thy:319:lemma [simp,code_unfold]: "(false \<triangleq> true) = false"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/BinarySearchTree/BinaryTree_TacticStyle.thy:107:lemma [simp]: "[| t ~= Tip; sorted t |] ==> sorted(rem t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Examples/TwoSat_Ex.thy:164:lemma [simp]: "consistent {}" by (auto simp: consistent_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Containers/Set_Impl.thy:234:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Lp/Functional_Spaces.thy:104:lemma [measurable]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:8:lemma [simp]: "is_terminal t \<Longrightarrow> is_symbol t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:11:lemma [simp]: "is_sentence []" by (auto simp add: is_sentence_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:13:lemma [simp]: "is_word []" by (auto simp add: is_word_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:15:lemma [simp]: "is_word u \<Longrightarrow> is_sentence u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:39:lemma [simp]: "leftderivations1 \<subseteq> derivations1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:234:lemma [simp]: "is_nonterminal N \<Longrightarrow> is_symbol N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Derivations.thy:243:lemma [elim]: "Derives1 a i r b \<Longrightarrow> r \<in> \<RR>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Limit.thy:35:lemma[simp]: "funpower id n = id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/Limit.thy:38:lemma[simp]: "limit id = id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/LocalLexingLemmas.thy:7:lemma[simp]: "setmonotone (Append Z k)" by (auto simp add: Append_def setmonotone_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/LocalLexingLemmas.thy:74:lemma[simp]: "Append {} k = id" by (auto simp add: Append_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LocalLexing/LocalLexingLemmas.thy:76:lemma[simp]: "k > length Doc \<Longrightarrow> \<P> k v = \<P> k 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Native_Word/More_Bits_Int.thy:66:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:117:lemma [simp]: "wp\<^sub>t (Do f) Q = (\<lambda>s. (\<forall>t \<in> f s. Q t) \<and> f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:120:lemma [simp]: "wp\<^sub>t (c\<^sub>1;c\<^sub>2) R = wp\<^sub>t c\<^sub>1 (wp\<^sub>t c\<^sub>2 R)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:126:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/HoareTotal.thy:133:lemma [simp]: "wp\<^sub>t (LOCAL f;c;g) Q = (\<lambda>s. wp\<^sub>t c (Q o (g s)) (f s))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:35:lemma [iff]: "Do f \<down> s = (f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:43:lemma [iff]: "((c\<^sub>1;c\<^sub>2) \<down> s\<^sub>0) = (c\<^sub>1 \<down> s\<^sub>0 \<and> (\<forall>s\<^sub>1. s\<^sub>0 -c\<^sub>1\<rightarrow> s\<^sub>1 \<longrightarrow> c\<^sub>2 \<down> s\<^sub>1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:51:lemma [iff]: "(IF b THEN c\<^sub>1 ELSE c\<^sub>2 \<down> s) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Termi.thy:69:lemma [iff]: "(LOCAL f;c;g \<down> s) = (c \<down> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:92:lemma [simp]: "wp (Do f) Q = (\<lambda>s. \<forall>t \<in> f s. Q(t))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:98:lemma [simp]: "wp (c\<^sub>1;c\<^sub>2) R = wp c\<^sub>1 (wp c\<^sub>2 R)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:104:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Hoare.thy:123:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Lang.thy:85:lemma [iff]: "(s -c;d\<rightarrow> u) = (\<exists>t. s -c\<rightarrow> t \<and> t -d\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Lang.thy:88:lemma [iff]: "(s -IF b THEN c ELSE d\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/While/Lang.thy:94:lemma [iff]: "(s -LOCAL f; c; g\<rightarrow> u) = (\<exists>t. f s -c\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:27:lemma [iff]: "(Do f \<down> s) = (f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:35:lemma [iff]: "((c1;c2) \<down> s0) = (c1 \<down> s0 \<and> (\<forall>s1. s0 -c1\<rightarrow> s1 \<longrightarrow> c2 \<down> s1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:43:lemma [iff]: "(IF b THEN c1 ELSE c2 \<down> s) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:61:lemma [iff]: "(CALL \<down> s) = (body \<down> s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PTermi.thy:64:lemma [iff]: "(LOCAL f;c;g \<down> s) = (c \<down> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:56:lemma [iff]: "(s -Do f\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:59:lemma [iff]: "(s -c;d\<rightarrow> u) = (\<exists>t. s -c\<rightarrow> t \<and> t -d\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:62:lemma [iff]: "(s -IF b THEN c ELSE d\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:74:lemma [iff]: "(s -CALL\<rightarrow> t) = (s -body\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:77:lemma [iff]: "(s -LOCAL f; c; g\<rightarrow> u) = (\<exists>t. f s -c\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:80:lemma [simp]: "\<not>b s \<Longrightarrow> s -WHILE b DO c\<rightarrow> s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:114:lemma [iff]: "(s -Do f-n\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:117:lemma [iff]: "(s -c1;c2-n\<rightarrow> u) = (\<exists>t. s -c1-n\<rightarrow> t \<and> t -c2-n\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:120:lemma [iff]: "(s -IF b THEN c ELSE d-n\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:126:lemma [iff]: "(s -CALL- 0\<rightarrow> t) = False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:129:lemma [iff]: "(s -CALL-Suc n\<rightarrow> t) = (s -body-n\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PLang.thy:133:lemma [iff]: "(s -LOCAL f; c; g-n\<rightarrow> u) = (\<exists>t. f s -c-n\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:79:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:85:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:91:lemma [iff]: "(\<Turnstile>\<^sub>t {P}CALL{Q}) = (\<Turnstile>\<^sub>t {P}body{Q})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:228:lemma [iff]: "\<not> ([],s) \<rightarrow> u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:345:lemma [iff]: "\<not> inf [] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:352:lemma [iff]: "\<not> inf [Do f] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:361:lemma [iff]: "inf ((c1;c2)#cs) s = inf (c1#c2#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:374:lemma [iff]: "inf ((IF b THEN c1 ELSE c2)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:393:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:415:lemma [iff]: "inf (CALL#cs) s = inf (body#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Proc/PHoareTotal.thy:429:lemma [iff]: "inf ((LOCAL f;c;g)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:28:lemma [iff]: "(Do f \<down> s) = (f s \<noteq> {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:36:lemma [iff]: "((c1;c2) \<down> s0) = (c1 \<down> s0 \<and> (\<forall>s1. s0 -c1\<rightarrow> s1 \<longrightarrow> c2 \<down> s1))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:44:lemma [iff]: "(IF b THEN c1 ELSE c2 \<down> s) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:62:lemma [iff]: "(CALL p \<down> s) = (body p \<down> s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsTermi.thy:65:lemma [iff]: "(LOCAL f;c;g \<down> s) = (c \<down> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:74:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:80:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:86:lemma [iff]: "(\<Turnstile>\<^sub>t {P}CALL p{Q}) = (\<Turnstile>\<^sub>t {P}body p{Q})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:246:lemma [iff]: "\<not> ([],s) \<rightarrow> u"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:362:lemma [iff]: "\<not> inf [] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:369:lemma [iff]: "\<not> inf [Do f] s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:378:lemma [iff]: "inf ((c1;c2)#cs) s = inf (c1#c2#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:391:lemma [iff]: "inf ((IF b THEN c1 ELSE c2)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:410:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:432:lemma [iff]: "inf (CALL p#cs) s = inf (body p#cs) s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsHoareTotal.thy:446:lemma [iff]: "inf ((LOCAL f;c;g)#cs) s =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:57:lemma [iff]: "(s -Do f\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:60:lemma [iff]: "(s -c;d\<rightarrow> u) = (\<exists>t. s -c\<rightarrow> t \<and> t -d\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:63:lemma [iff]: "(s -IF b THEN c ELSE d\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:70:lemma [iff]: "(s -CALL p\<rightarrow> t) = (s -body p\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:73:lemma [iff]: "(s -LOCAL f; c; g\<rightarrow> u) = (\<exists>t. f s -c\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:96:lemma [iff]: "(s -Do f-n\<rightarrow> t) = (t \<in> f s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:99:lemma [iff]: "(s -c1;c2-n\<rightarrow> u) = (\<exists>t. s -c1-n\<rightarrow> t \<and> t -c2-n\<rightarrow> u)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:102:lemma [iff]: "(s -IF b THEN c ELSE d-n\<rightarrow> t) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:108:lemma [iff]: "(s -CALL p- 0\<rightarrow> t) = False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:111:lemma [iff]: "(s -CALL p-Suc n\<rightarrow> t) = (s -body p-n\<rightarrow> t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Abstract-Hoare-Logics/Procs/PsLang.thy:114:lemma [iff]: "(s -LOCAL f; c; g-n\<rightarrow> u) = (\<exists>t. f s -c-n\<rightarrow> t \<and> u = g s t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/MiniML/Type.thy:557:lemma [simp]: "new_tv n t \<Longrightarrow> new_tv (Suc n) t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dijkstra_Shortest_Path/Dijkstra_Impl_Adet.thy:151:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Well_Quasi_Orders/Kruskal_Examples.thy:19:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Well_Quasi_Orders/Kruskal_Examples.thy:125:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Well_Quasi_Orders/Kruskal_Examples.thy:130:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_While/Bernoulli.thy:56:lemma [simp]: assumes "0 \<le> p" "p \<le> 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Berlekamp_Zassenhaus/Finite_Field.thy:162:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Berlekamp_Zassenhaus/Finite_Field.thy:166:lemma [transfer_rule]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/FinFun/FinFunPred.thy:119:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Rank.thy:103:lemma [simp]: "rank 0 = 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Ordinal.thy:257:lemma [simp]: "succ k \<noteq> 0"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Finite_Automata.thy:77:lemma [simp]: "init (Reverse fsm) = final fsm"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HereditarilyFinite/Finite_Automata.thy:80:lemma [simp]: "final (Reverse fsm) = init fsm"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Impl/IICF_Array_List.thy:217:lemma [def_pat_rules]: "op_arl_empty_sz$N \<equiv> UNPROTECT (op_arl_empty_sz N)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Map.thy:71:lemma [synth_rules]: "\<lbrakk>INTF_OF_REL K TYPE('k); INTF_OF_REL V TYPE('v)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Multiset.thy:193:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Multiset.thy:202:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_List.thy:104:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/IICF/Intf/IICF_Prio_Bag.thy:133:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:47:lemma [safe_constraint_rules]: "IS_BELOW_ID R \<Longrightarrow> IS_BELOW_ID (\<langle>R\<rangle>infty_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:59:lemma [sepref_monadify_arity]: "case_infty \<equiv> \<lambda>\<^sub>2f1 f2 x. SP case_infty$f1$(\<lambda>\<^sub>2x. f2$x)$x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:61:lemma [sepref_monadify_comb]: "case_infty$f1$f2$x \<equiv> (\<bind>)$(EVAL$x)$(\<lambda>\<^sub>2x. SP case_infty$f1$f2$x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Dijkstra.thy:62:lemma [sepref_monadify_comb]: "EVAL$(case_infty$f1$(\<lambda>\<^sub>2x. f2 x)$x)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_NDFS.thy:28:lemma [sepref_fr_rules]: "hn_refine
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_NDFS.thy:40:lemma [sepref_fr_rules]: "hn_refine
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Graph.thy:19:lemma [pat_rules]: "((``))$E$(insert$u${}) \<equiv> op_graph_succ$E$u" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Examples/Sepref_Graph.thy:60:lemma [intf_of_assn]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Intf_Util.thy:88:lemma [fcomp_norm_simps]: "CONSTRAINT (IS_PURE \<Phi>) P \<Longrightarrow> pure (the_pure P) = P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Intf_Util.thy:91:lemma [fcomp_norm_simps]: "CONSTRAINT (IS_PURE P) A \<Longrightarrow> P (the_pure A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Foreach.thy:224:lemma [def_pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Foreach.thy:793:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_Foreach.thy:814:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:28:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:37:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:150:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:164:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:174:lemma [safe_constraint_rules]: "IS_LEFT_TOTAL R \<Longrightarrow> IS_LEFT_TOTAL (\<langle>R\<rangle>list_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:185:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:198:lemma [safe_constraint_rules]: "IS_RIGHT_TOTAL R \<Longrightarrow> IS_RIGHT_TOTAL (\<langle>R\<rangle>list_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:216:lemma [safe_constraint_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:510:lemma [sepref_relprops_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:523:lemma [sepref_relprops_transform]: "single_valued (R\<inverse>) = IS_LEFT_UNIQUE R"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:913:lemma [pat_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1331:lemma [sepref_fr_rules]: "(return o Inl,RETURN o Inl) \<in> A\<^sup>d \<rightarrow>\<^sub>a sum_assn A B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1333:lemma [sepref_fr_rules]: "(return o Inr,RETURN o Inr) \<in> B\<^sup>d \<rightarrow>\<^sub>a sum_assn A B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1339:lemma [sepref_monadify_arity]: "case_sum \<equiv> \<lambda>\<^sub>2f1 f2 x. SP case_sum$(\<lambda>\<^sub>2x. f1$x)$(\<lambda>\<^sub>2x. f2$x)$x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1343:lemma [sepref_monadify_comb]: "case_sum$f1$f2$x \<equiv> (\<bind>) $(EVAL$x)$(\<lambda>\<^sub>2x. SP case_sum$f1$f2$x)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Imperative_HOL/Sepref_HOL_Bindings.thy:1346:lemma [sepref_monadify_comb]: "EVAL$(case_sum$(\<lambda>\<^sub>2x. f1 x)$(\<lambda>\<^sub>2x. f2 x)$x)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:270:lemma [simp]: "final(Val v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:273:lemma [simp]: "final(throw e) = (\<exists>r. e = ref r)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:279:lemma [iff]: "finals []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:282:lemma [iff]: "finals (Val v # es) = finals es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:306:lemma [iff]: "finals (map Val vs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/BigStep.thy:309:lemma [iff]: "finals (throw e # es) = (\<exists>r. e = ref r)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Objects.thy:54:lemma [simp]: "obj_ty (C,S) = Class C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:29:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:283:lemma[simp]: "((e,s),e',s') \<in> Red P E = P,E \<turnstile> \<langle>e,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:286:lemma[simp]: "((es,s),es',s') \<in> Reds P E = P,E \<turnstile> \<langle>es,s\<rangle> [\<rightarrow>] \<langle>es',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:337:lemma [iff]: "\<not> P,E \<turnstile> \<langle>[],s\<rangle> [\<rightarrow>] \<langle>es',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:340:lemma [iff]: "\<not> P,E \<turnstile> \<langle>Val v,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/SmallStep.thy:343:lemma [iff]: "\<not> P,E \<turnstile> \<langle>Throw r,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Progress.thy:150:lemma [iff]: "P,E,h \<turnstile> e\<^sub>1;;e\<^sub>2 :' T\<^sub>2 = (\<exists>T\<^sub>1. P,E,h \<turnstile> e\<^sub>1:' T\<^sub>1 \<and> P,E,h \<turnstile> e\<^sub>2:' T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Progress.thy:157:lemma [iff]: "P,E,h \<turnstile> Val v :' T = (P \<turnstile> typeof\<^bsub>h\<^esub> v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Progress.thy:164:lemma [iff]: "P,E,h \<turnstile> Var V :' T = (E V = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellTypeRT.thy:169:lemma [simp]: "\<forall>Ts. (P,E,h \<turnstile> es\<^sub>1 @ es\<^sub>2 [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Exceptions.thy:41:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:50:lemma [simp]: "(typeof v = Some Boolean) = (\<exists>b. v = Bool b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:53:lemma [simp]: "(typeof v = Some Integer) = (\<exists>i. v = Intg i)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:56:lemma [simp]: "(typeof v = Some NT) = (v = Null)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Value.thy:59:lemma [simp]: "(typeof v = Some Void) = (v = Unit)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/TypeSafe.thy:221:lemma [iff]: "\<And>A. \<lbrakk> length Vs = length Ts; length vs = length Ts\<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Expr.thy:56:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Expr.thy:93:lemma [simp]: "fvs(es\<^sub>1 @ es\<^sub>2) = fvs es\<^sub>1 \<union> fvs es\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Expr.thy:96:lemma [simp]: "fvs(map Val vs) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Type.thy:47:lemma [iff]: "is_refT NT"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/Type.thy:50:lemma [iff]: "is_refT(Class C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:115:lemma [iff]: "(P,E \<turnstile> [] [::] Ts) = (Ts = [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:122:lemma [iff]: "(P,E \<turnstile> e#es [::] T#Ts) = (P,E \<turnstile> e :: T \<and> P,E \<turnstile> es [::] Ts)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:129:lemma [iff]: "(P,E \<turnstile> (e#es) [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:137:lemma [iff]: "\<And>Ts. (P,E \<turnstile> es\<^sub>1 @ es\<^sub>2 [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:154:lemma [iff]: "P,E \<turnstile> Val v :: T = (typeof v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:161:lemma [iff]: "P,E \<turnstile> Var V :: T = (E V = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:168:lemma [iff]: "P,E \<turnstile> e\<^sub>1;;e\<^sub>2 :: T\<^sub>2 = (\<exists>T\<^sub>1. P,E \<turnstile> e\<^sub>1::T\<^sub>1 \<and> P,E \<turnstile> e\<^sub>2::T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/WellType.thy:175:lemma [iff]: "(P,E \<turnstile> {V:T; e} :: T') = (is_type P T \<and> P,E(V\<mapsto>T) \<turnstile> e :: T')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:38:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> A = A \<and> A \<squnion> \<lfloor>{}\<rfloor> = A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:41:lemma [simp]: "\<lfloor>A\<rfloor> \<squnion> \<lfloor>B\<rfloor> = \<lfloor>A \<union> B\<rfloor> \<and> \<lfloor>A\<rfloor> \<ominus> a = \<lfloor>A - {a}\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:44:lemma [simp]: "None \<squnion> A = None \<and> A \<squnion> None = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CoreC++/DefAss.thy:47:lemma [simp]: "a \<in>\<in> None \<and> None \<ominus> a = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Stern_Brocot/Bird_Tree.thy:68:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Stern_Brocot/Bird_Tree.thy:73:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Language_Semantics.thy:553:lemma [simp]: "(n::nat) < N \<Longrightarrow> 0 \<le> 1 / N" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Language_Semantics.thy:555:lemma [simp]: "(n::nat) < N \<Longrightarrow> 1 / N \<le> 1" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Language_Semantics.thy:557:lemma [simp]: "(n::nat) < N \<Longrightarrow> 0 \<le> 1 - 1 / N" by (simp add: divide_simps)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Concrete.thy:12:lemma [simp]: "\<And> l. l \<noteq> Hi \<longleftrightarrow> l = Lo" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Probabilistic_Noninterference/Concrete.thy:18:lemma [dest]: "\<And> l A. \<lbrakk>l \<in> A; Lo \<notin> A\<rbrakk> \<Longrightarrow> l = Hi" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:54:lemma [autoref_op_pat_def]: "ST xs \<equiv> OP (ST xs)" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:55:lemma [autoref_rules]: "(x, ST x) \<in> string_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:115:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:130:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:173:lemma [autoref_op_pat]: "(\<union>) \<equiv> OP op_union_phantom"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1070:lemma [autoref_rules]: "(euler_incr_fas', euler_incr_fas') \<in> nat_rel \<rightarrow> fas_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1110:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1236:lemma [autoref_op_pat_def]: "DIM('a) \<equiv> OP (op_DIM TYPE('a::executable_euclidean_space))" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:1521:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2773:lemma [autoref_rules]: "(sgn, sgn) \<in> rnv_rel \<rightarrow> rnv_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2790:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2969:lemma [autoref_op_pat]: "fst ` X \<equiv> OP op_image_fst_colle $ X"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:2972:lemma [autoref_op_pat]: "fst ` X \<equiv> OP op_image_fste $ X"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3048:lemma [autoref_op_pat]: "(`) flow1_of_vec1 \<equiv> OP op_image_flow1_of_vec1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3073:lemma [autoref_op_pat]: "(`) fst \<equiv> OP op_image_fst"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3124:lemma [autoref_op_pat]: "X \<times> UNIV \<equiv> OP op_times_UNIV $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3254:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3449:lemma [autoref_op_pat_def]: "embed1 ` X \<equiv> OP op_image_embed1 $ X"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3580:lemma [autoref_op_pat]: "(`) fst \<equiv> OP op_image_fst_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:3617:lemma [autoref_op_pat]: "(`) flow1_of_vec1 \<equiv> OP op_image_flow1_of_vec1_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4581:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4592:lemma [autoref_rules]: "(RETURN, get_plane) \<in> \<langle>A\<rangle>plane_rel \<rightarrow> \<langle>\<langle>A\<rangle>sctn_rel\<rangle>nres_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4595:lemma [autoref_op_pat del]: "{} \<equiv> OP op_empty_default" "{} \<equiv> OP op_empty_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4713:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:4964:lemma [autoref_rules]: "(adapt_stepsize_fa, adapt_stepsize_fa) \<in> rnv_rel \<rightarrow> rnv_rel \<rightarrow> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5061:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5107:lemma [autoref_rules]: "(max_intersection_step, max_intersection_step)\<in> (reach_optns_rel) \<rightarrow> rnv_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5246:lemma [autoref_op_pat]: "(\<subseteq>) \<equiv> OP op_subset_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5264:lemma [autoref_op_pat]: "(=) \<equiv> OP op_eq_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5280:lemma [autoref_itype]: "eq_spec ::\<^sub>i A \<rightarrow>\<^sub>i A \<rightarrow>\<^sub>i \<langle>i_bool\<rangle>\<^sub>ii_nres" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5304:lemma [autoref_op_pat_def del]: "get_inter p \<equiv> OP (get_inter p)" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5315:lemma [THEN order_trans, refine_vcg]: "select_with_inter ci a \<le> SPEC (\<lambda>_. True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:5591:lemma [autoref_op_pat_def]: "GSPEC x \<equiv> OP (GSPEC x)" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:6230:lemma [autoref_op_pat]: "X \<times> UNIV \<equiv> OP op_times_UNIV_coll $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:6241:lemma [autoref_op_pat]: "X \<inter> Y \<times> UNIV \<equiv> OP op_inter_fst $ X $ Y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:7144:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:7822:lemma [le, refine_vcg]: "op_image_fst_ivl_coll X \<le> SPEC (\<lambda>R. R = fst ` X)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:7998:lemma [autoref_rules_raw del]: "(norm2_slp, norm2_slp) \<in> nat_rel \<rightarrow> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8002:lemma [autoref_rules]: "(norm2_slp, norm2_slp) \<in> nat_rel \<rightarrow> slp_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8027:lemma [autoref_rules_raw]: "DIM_precond TYPE(real) (Suc 0)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8029:lemma [autoref_rules]: "(ereal, ereal) \<in> rnv_rel \<rightarrow> ereal_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8111:lemma [autoref_rules]: "(\<infinity>, \<infinity>) \<in> ereal_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:8512:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9185:lemma [autoref_op_pat]: "a \<times> b \<equiv> OP op_times_ivl $ a $ b"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9197:lemma [autoref_op_pat_def]: "default_rep d \<equiv> OP (default_rep d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9270:lemma [autoref_itype]: "compact ::\<^sub>i A \<rightarrow>\<^sub>i i_bool"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9278:lemma [autoref_itype del]: "ivl_rep_of_set ::\<^sub>i i_appr \<rightarrow>\<^sub>i \<langle>\<langle>i_rnv, i_rnv\<rangle>\<^sub>ii_prod\<rangle>\<^sub>ii_nres"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Reachability_Analysis.thy:9558:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Example_Utilities.thy:2675:lemma [nth_list_eq_theorems]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Vector_List.thy:140:lemma [autoref_rules]: "(sum_list, sum_list) \<in> \<langle>rnv_rel\<rangle>list_rel \<rightarrow> rnv_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:114:lemma [autoref_op_pat_def]: "nres_of_nress P x \<equiv> (OP (nres_of_nress P) $ x)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:152:lemma [autoref_op_pat_def]: "PAR_IMAGE P \<equiv> OP (PAR_IMAGE P)" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:153:lemma [autoref_rules]: "(Parallel.map, Parallel.map) \<in> (A \<rightarrow> B) \<rightarrow> \<langle>A\<rangle>list_rel \<rightarrow> \<langle>B\<rangle>list_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:278:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:830:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:915:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:998:lemma [autoref_op_pat]: "(\<union>) \<equiv> OP op_union_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1145:lemma [autoref_op_pat]: "Union \<equiv> OP op_Union_default"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1164:lemma [autoref_op_pat]: "Union \<equiv> OP op_Union_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1193:lemma [autoref_itype]: "is_empty ::\<^sub>i A \<rightarrow>\<^sub>i i_bool"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1197:lemma [autoref_op_pat]: "is_empty \<equiv> OP op_coll_is_empty"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1222:lemma [autoref_op_pat]: "is_empty \<equiv> OP op_info_is_empty"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1341:lemma [autoref_op_pat_def]: "get_invar p \<equiv> OP (get_invar p)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1353:lemma [autoref_op_pat]: "mk_inter \<equiv> OP (mk_inter)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1355:lemma [autoref_op_pat]: "mk_inter \<equiv> OP (mk_inter_coll)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1469:lemma [autoref_op_pat]: "atLeastAtMost \<equiv> OP op_atLeastAtMost_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1577:lemma [autoref_op_pat]: "(\<inter>) \<equiv> OP op_inter_ivl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1587:lemma [autoref_op_pat]: "(\<inter>) \<equiv> OP op_inter_ivl_coll"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:1890:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:2041:lemma [autoref_op_pat_def]: "concat ` listset xs \<equiv> OP op_concat_listset $ xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:2167:lemma [autoref_op_pat]: "atLeastAtMost \<equiv> OP op_atLeastAtMost_appr"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:2211:lemma [autoref_rules]: "(optns, optns) \<in> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3008:lemma [autoref_itype]: "op_set_isEmpty ::\<^sub>i \<langle>L, \<langle>A\<rangle>\<^sub>ii_ivl\<rangle>\<^sub>ii_coll \<rightarrow>\<^sub>i i_bool"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3356:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3396:lemma [autoref_op_pat_def]: "list_of_eucl ` X \<equiv> OP op_list_of_eucl_image $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3405:lemma [autoref_op_pat_def]: "eucl_of_list ` X \<equiv> OP op_eucl_of_list_image $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3417:lemma [autoref_op_pat_def]: "take n ` X \<equiv> OP op_take_image $ n $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3479:lemma [autoref_op_pat_def]: "drop n ` X \<equiv> OP op_drop_image $ n $ X" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3670:lemma [autoref_op_pat_def]: "approx_slp_appr fas \<equiv> OP (approx_slp_appr fas)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3694:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3711:lemma [autoref_rules]: "(norm2_slp, norm2_slp) \<in> nat_rel \<rightarrow> Id"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics.thy:3740:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Transfer_Euclidean_Space_Vector.thy:367:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Transfer_Euclidean_Space_Vector.thy:489:lemma [transfer_rule]: "bi_total rel_ve"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Transfer_Euclidean_Space_Vector.thy:495:lemma [transfer_rule]: "bi_unique rel_ve"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Numerics/Refine_Rigorous_Numerics_Aform.thy:553:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Autoref_Misc.thy:202:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Autoref_Misc.thy:387:lemma [autoref_op_pat_def]: "x \<equiv> Autoref_Tagging.OP x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_Folds.thy:53:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_String.thy:8:lemma [autoref_itype]: "Char b0 b1 b2 b3 b4 b5 b6 b7 ::\<^sub>i I"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_String.thy:47:lemma [autoref_itype]: "String.empty_literal ::\<^sub>i I"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Refine_String.thy:52:lemma [autoref_itype]: "String.Literal b0 b1 b2 b3 b4 b5 b6 s ::\<^sub>i I"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Refinement/Weak_Set.thy:715:lemma [autoref_itype]: "isEmpty_spec::\<^sub>i A \<rightarrow>\<^sub>i \<langle>i_bool\<rangle>\<^sub>ii_nres"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/ODE_Auxiliarities.thy:36:lemma [simp]: "fstzero (a, b) = (a, 0)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/ODE_Auxiliarities.thy:42:lemma [simp]: "zerosnd (a, b) = (0, b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:43:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:48:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:55:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:64:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Library/Vector_Derivative_On.thy:73:lemma [THEN has_vderiv_on_eq_rhs, derivative_intros]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:312:lemma [simp]: "length conefield_propagation_slp = 51"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:379:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:384:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:413:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:679:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:961:lemma [autoref_rules]: includes autoref_syntax shows "(\<lambda>_. (), \<Gamma>\<^sub>i\<^sub>v) \<in> bool_rel \<rightarrow> ghost_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1103:lemma [autoref_rules]: "((), \<Gamma>\<^sub>v) \<in> ghost_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1146:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1152:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1292:lemma [simp]: "(x, x') \<in> aform.appr_rel \<Longrightarrow> aform.ncc x'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1335:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1407:lemma [autoref_rules_raw]: "DIM(real \<times> real \<times> real) = DIM((real, 3) vec)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1571:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1575:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1584:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1593:lemma [autoref_rules_raw]: "DIM_precond TYPE(real \<times> real \<times> real) (OP 3 ::: nat_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1747:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1752:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1795:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1822:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1871:lemma [autoref_op_pat_def del]: "aform.subset_spec_plane optns \<equiv> OP (aform.subset_spec_plane optns)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1875:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:1996:lemma [autoref_rules]: includes autoref_syntax shows
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Ordinary_Differential_Equations/Ex/Lorenz/Lorenz_Approximation.thy:2652:lemma [simp]: "expansion (mirror_result res) = expansion res"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Complx/ex/SumArr.thy:239:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Definition.thy:111:lemma [mono]:"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Definition.thy:116:lemma [mono]: "case_prod f p = f (fst p) (snd p)" by (simp add: split_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:64:lemma [simp]: "(class_name cld dcl) = (class_name_f cld = dcl)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:73:lemma [simp]: "(superclass_name cld cl) = (superclass_name_f cld = cl)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:82:lemma [simp]: "(class_fields cld fds) = (class_fields_f cld = fds)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:91:lemma [simp]: "(class_methods cld fds) = (class_methods_f cld = fds)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:101:lemma [simp]: "(method_name md m) = (method_name_f md = m)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:116:lemma [simp]: "(distinct_names P) = (distinct_names_f P)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:134:lemma [simp]: "(find_cld P ctx fqn ctxcld_opt) = (find_cld_f P ctx fqn = ctxcld_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:162:lemma [simp]: "(find_type P ctx cl ty_opt) = (find_type_f P ctx cl = ty_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:218:lemma [simp]: "(find_path_rec P ctx cl path path_opt) = (find_path_rec_f P ctx cl path = path_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:235:lemma [simp]: "(find_path P ctx cl path_opt) = (find_path_f P ctx cl = path_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:247:lemma [simp]: "(find_path_ty P ty ctxclds_opt) = (find_path_ty_f P ty = ctxclds_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:280:lemma [simp]: "\<forall>fs. (fields_in_path ctxclds fs) = (fields_in_path_f ctxclds = fs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:304:lemma [simp]: "\<forall>fs_opt. (fields P ty fs_opt) = (fields_f P ty = fs_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:336:lemma [simp]: "\<forall>meths. (methods_in_path clds meths) = (methods_in_path_f clds = meths)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:363:lemma [simp]: "(methods P ty meths) = (methods_f P ty = Some meths)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:378:lemma [simp]: "(ftype_in_fds P ctx fds f ty_opt) = (ftype_in_fds_f P ctx fds f = ty_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:401:lemma [simp]: "(ftype_in_path P ctxclds f ty_opt) = (ftype_in_path_f P ctxclds f = ty_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:419:lemma [simp]: "(ftype P ty f ty') = (ftype_f P ty f = Some ty')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:433:lemma [simp]: "(find_meth_def_in_list mds m md_opt) = (find_meth_def_in_list_f mds m = md_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:451:lemma [simp]: "(find_meth_def_in_path ctxclds m ctxmeth_def_opt) = (find_meth_def_in_path_f ctxclds m = ctxmeth_def_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:466:lemma [simp]: "(find_meth_def P ty m ctxmd_opt) = (find_meth_def_f P ty m = ctxmd_opt)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:535:lemma [simp]: "(mtype P ty m mty) = (mtype_f P ty m = Some mty)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:579:lemma [simp]: "(sty_one P ty ty') = (is_sty_one P ty ty' = Some True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:792:lemma [simp]: "(sty_many P tys tys') = (is_sty_many P tys tys' = Some True)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:833:lemma [simp]: "(\<forall>x\<in>set s_s'_list. case x of (s_XXX, s_') \<Rightarrow> tr_s T s_XXX s_' \<and> tr_s_f T s_XXX = s_') \<longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:837:lemma [simp]: "(\<forall>x\<in>set y_y'_list. case_prod (\<lambda>y_XXX. (=) (case T y_XXX of None \<Rightarrow> y_XXX | Some x' \<Rightarrow> x')) x) \<longrightarrow> map (tr_x T) (map fst y_y'_list) = map snd y_y'_list"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Equivalence.thy:842:lemma [iff]: "length ss = length (tr_ss_f T ss)" by (induct ss, auto)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1387:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1401:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1413:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1419:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LightweightJava/Lightweight_Java_Proof.thy:1427:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:70:lemma [iff]: "(P \<turnstile> T \<le> Void) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:73:lemma [iff]: "(P \<turnstile> T \<le> Boolean) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:76:lemma [iff]: "(P \<turnstile> T \<le> Integer) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:79:lemma [iff]: "(P \<turnstile> Void \<le> T) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:82:lemma [iff]: "(P \<turnstile> Boolean \<le> T) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:85:lemma [iff]: "(P \<turnstile> Integer \<le> T) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:101:lemma [iff]: "(P \<turnstile> T \<le> NT) = (T = NT)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/TypeRel.thy:506:lemma [simp]: "P \<turnstile> C has_fields FDTs \<Longrightarrow> fields P C = FDTs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/WellForm.thy:70:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/WellForm.thy:77:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/Exceptions.thy:58:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/Exceptions.thy:161:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/Value.thy:83:lemma [iff]: "is_Ref Null" by (simp add: is_Ref_def2)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:213:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:218:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:223:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:228:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:233:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:238:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:243:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:248:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:254:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:260:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:266:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:271:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:276:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:283:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/BinOp.thy:289:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Common/StartConfig.thy:145:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/DFA/SemilatAlg.thy:41:lemma [iff]: "{} {\<sqsubseteq>\<^bsub>r\<^esub>} B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/DFA/SemilatAlg.thy:44:lemma [iff]: "(A {\<sqsubseteq>\<^bsub>r\<^esub>} {}) = (A = {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/SmallStep.thy:451:lemma [iff]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/SmallStep.thy:459:lemma [iff]: "\<not> extTA,P,t \<turnstile> \<langle>Throw a, s\<rangle> -ta\<rightarrow> \<langle>e', s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/WellTypeRT.thy:167:lemma [simp]: "(P,E,h \<turnstile> es\<^sub>1 @ es\<^sub>2 [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:193:lemma [simp]: "fvs(es @ es') = fvs es \<union> fvs es'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:196:lemma [simp]: "fvs(map Val vs) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:313:lemma [simp]: "(is_addr e) \<longleftrightarrow> (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:348:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:383:lemma [iff]: "finals []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:386:lemma [iff]: "finals (Val v # es) = finals es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/Expr.thy:392:lemma [iff]: "finals (throw e # es) = (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:42:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> A = A \<and> A \<squnion> \<lfloor>{}\<rfloor> = A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:45:lemma [simp]: "\<lfloor>A\<rfloor> \<squnion> \<lfloor>B\<rfloor> = \<lfloor>A \<union> B\<rfloor> \<and> \<lfloor>A\<rfloor> \<ominus> a = \<lfloor>A - {a}\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:48:lemma [simp]: "None \<squnion> A = None \<and> A \<squnion> None = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:51:lemma [simp]: "a \<in>\<in> None \<and> None \<ominus> a = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:63:lemma [iff]: "A \<sqsubseteq> None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:66:lemma [simp]: "A \<sqsubseteq> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:69:lemma [iff]: "\<lfloor>A\<rfloor> \<sqsubseteq> \<lfloor>B\<rfloor> \<longleftrightarrow> A \<subseteq> B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:86:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> B = B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/J/DefAss.thy:89:lemma [simp]: "\<lfloor>{}\<rfloor> \<sqsubseteq> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Framework/FWSemantics.thy:102:lemma [iff]: "t \<in> final_threads s = final_thread s t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Framework/FWSemantics.thy:105:lemma [pred_set_conv]: "final_thread s = (\<lambda>t. t \<in> final_threads s)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:47:lemma [simp]: "is_class (compP f P) C = is_class P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:51:lemma [simp]: "class (compP f P) C = map_option (\<lambda>c. snd(compC f (C,c))) (class P C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:87:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:141:lemma [simp]: "subcls1(compP f P) = subcls1 P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:144:lemma [simp]: "is_type (compP f P) T = is_type P T"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:154:lemma [simp]: "(compP f P \<turnstile> Ts [\<le>] Ts') = (P \<turnstile> Ts [\<le>] Ts')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:167:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:199:lemma [simp]: "fields (compP f P) C = fields P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:203:lemma [simp]: "(compP f P \<turnstile> C sees F:T (fm) in D) = (P \<turnstile> C sees F:T (fm) in D)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:207:lemma [simp]: "field (compP f P) F D = field P F D"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:213:lemma [iff]: "distinct_fst (classes (compP f P)) = distinct_fst (classes P)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:224:lemma [iff]: "distinct_fst (map (compM f) ms) = distinct_fst ms"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:233:lemma [iff]: "wf_syscls (compP f P) = wf_syscls P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/PCompiler.thy:236:lemma [iff]: "wf_fdecl (compP f P) = wf_fdecl P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/CallExpr.thy:89:lemma [dest]: "\<lbrakk> inline_calls e es = map Val vs; calls es = \<lfloor>aMvs\<rfloor> \<rbrakk> \<Longrightarrow> is_val e"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:34:lemma [simp]: "pc < pc\<^sub>0 \<or> pc\<^sub>0+size(compE2 e) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxE2 e pc\<^sub>0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:37:lemma [simp]: "pc < pc0 \<or> pc0+size(compEs2 es) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxEs2 es pc0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:40:lemma [simp]: "pc1 + size(compE2 e1) \<le> pc2 \<Longrightarrow> pcs(compxE2 e1 pc1 d1) \<inter> pcs(compxE2 e2 pc2 d2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/Exception_Tables.thy:43:lemma [simp]: "pc\<^sub>1 + size(compE2 e) \<le> pc\<^sub>2 \<Longrightarrow> pcs(compxE2 e pc\<^sub>1 d\<^sub>1) \<inter> pcs(compxEs2 es pc\<^sub>2 d\<^sub>2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:29:lemma [simp]: "index (xs @ [x]) x = size xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:33:lemma [simp]: "(index (xs @ [x]) y = size xs) = (x = y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:37:lemma [simp]: "x \<in> set xs \<Longrightarrow> xs ! index xs x = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:41:lemma [simp]: "x \<notin> set xs \<Longrightarrow> index xs x = size xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:57:lemma [simp]: "\<lbrakk> y \<in> set xs; x \<noteq> y \<rbrakk> \<Longrightarrow> index (xs @ [x]) y = index xs y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:78:lemma [simp]: "x \<in> set xs \<or> y \<in> set xs \<Longrightarrow> (index xs x = index xs y) = (x = y)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/ListIndex.thy:113:lemma [simp]: "hidden xs i \<Longrightarrow> hidden (xs@[x]) i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/JVMTau.thy:332:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/JVMTau.thy:419:lemma [simp]: fixes e :: "'addr expr1" and es :: "'addr expr1 list"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/J0J1Bisim.thy:743:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/J0J1Bisim.thy:801:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:655:lemma [iff]: "xcpt_app i P pc mxs [] \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:659:lemma [simp]: "xcpt_eff i P pc \<tau> [] = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1391:lemma [simp]: "app\<^sub>i (i, compP f P, pc, mpc, T, \<tau>) = app\<^sub>i (i, P, pc, mpc, T, \<tau>)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1405:lemma [simp]: "is_relevant_entry (compP f P) i = is_relevant_entry P i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1412:lemma [simp]: "relevant_entries (compP f P) i pc xt = relevant_entries P i pc xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1415:lemma [simp]: "app i (compP f P) mpc T pc mxl xt \<tau> = app i P mpc T pc mxl xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1420:lemma [simp]: "app i P mpc T pc mxl xt \<tau> \<Longrightarrow> eff i (compP f P) pc xt \<tau> = eff i P pc xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1426:lemma [simp]: "widen (compP f P) = widen P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1431:lemma [simp]: "compP f P \<turnstile> \<tau> \<le>' \<tau>' = P \<turnstile> \<tau> \<le>' \<tau>'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/JinjaThreads/Compiler/TypeComp.thy:1434:lemma [simp]: "compP f P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s = P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CRDT/Ordered_List.thy:211:lemma [elim!, dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Perron_Frobenius/HMA_Connect.thy:242:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Perron_Frobenius/HMA_Connect.thy:248:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/Examples/Eg1.thy:186:lemma [simp]: "pred_entailment P {}" by(simp add: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/Examples/Eg1.thy:187:lemma [simp]: "e \<in> P \<Longrightarrow> pred_entailment P {e}" by(blast intro: subset_entailment)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/Examples/Eg1.thy:188:lemma [simp]: "FF \<in> P \<Longrightarrow> pred_entailment P Q" by(auto simp: pred_entailment_def pred_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1290:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1312:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1316:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1320:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1328:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Dependent_SIFUM_Refinement/CompositionalRefinement.thy:1361:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Call_Arity/TTree.thy:51:lemma [simp]: "downset {[]}" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Call_Arity/ArityAnalysisCorrDenotational.thy:12:lemma [simp]: "eq 0 v v' \<longleftrightarrow> v = v'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Call_Arity/SestoftCorrect.thy:263:lemma[simp]: "Arg x \<notin> range Dummy" "Upd x \<notin> range Dummy" "Alts e\<^sub>1 e\<^sub>2 \<notin> range Dummy" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LinearQuantifierElim/Thys/CertLin.thy:65:lemma [simp]: "(c#cs) \<odot>\<^sub>a (a#as) = (c *\<^sub>a a) + cs \<odot>\<^sub>a as"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/RSAPSS/EMSAPSS.thy:356:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InformationFlowSlicing_Inter/LiftingInter.thy:55:lemma [simp]:"\<not> lift_valid_edge valid_edge src trg knd E X (Node E,et,Node X)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LambdaMu/Reduction.thy:45:lemma [intro]: "c \<^sub>C\<longlonglongrightarrow> d \<Longrightarrow> c \<^sub>C\<longlonglongrightarrow>\<^sup>* d"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2069:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2073:lemma [simp, code abstype]: "Abs_FingerTree (Rep_FingerTree t) = t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2083:lemma [simp, code abstype]: "Abs_viewres (Rep_viewres x) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Finger-Trees/FingerTree.thy:2120:lemma [simp, code abstype]: "Abs_splitres (Rep_splitres x) = x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:109:lemma [simp]: "vertices ((f::face)\<^bsup>op\<^esup>) = (vertices f)\<^bsup>op\<^esup>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:111:lemma [simp]: "xs \<noteq> [] \<Longrightarrow> hd (rev xs)= last xs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:223:lemma[simp]: "0 \<le> tri g v" by (simp add: tri_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:225:lemma[simp]: "0 \<le> quad g v" by (simp add: quad_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/Graph.thy:227:lemma[simp]: "0 \<le> except g v" by (simp add: except_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/PlaneGraphIso.thy:36:lemma [iff]: "((x,y) \<in> {\<cong>}) = x \<cong> y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/PlaneGraphIso.thy:634:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/PlaneGraphIso.thy:692:lemma [simp]: "m++m' ` (dom m' - A) = m' ` (dom m' - A)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ScoreProps.thy:146:lemma [iff]: "separated g {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListAux.thy:86:lemma [simp]: "Not \<circ> (Not \<circ> P) = P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListAux.thy:112:lemma [simp]: "[f x. x <- xs, P x] = [f x. x <- [x \<leftarrow> xs. P x]]"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flyspeck-Tame/ListSum.thy:18:lemma [simp]: "(\<Sum>\<^bsub>v \<in> V\<^esub> 0) = (0::nat)" by (induct V) simp_all
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/StackMark.thy:65:lemma [simp]: "R1_a \<in> Apply.Disjunctive"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/StackMark.thy:68:lemma [simp]: "R2_a \<in> Apply.Disjunctive" by (simp add: R2_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/StackMark.thy:76:lemma [simp]: "Disjunctive_fun R_a" by (simp add: Disjunctive_fun_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:41:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:205:lemma [simp]: "mono RR_a" by (simp add: RR_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:206:lemma [simp]: "RR_a \<in> Apply.Disjunctive" by (simp add: RR_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:207:lemma [simp]: "Disjunctive_fun R''_a" by (simp add: Disjunctive_fun_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:209:lemma [simp]: "mono_fun R''_a" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:211:lemma [simp]: "mono Q1''_a" by (simp add: Q1''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:212:lemma [simp]: "mono Q2''_a" by (simp add: Q2''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:213:lemma [simp]: "mono Q3''_a" by (simp add: Q3''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:214:lemma [simp]: "mono Q4''_a" by (simp add: Q4''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:215:lemma [simp]: "mono Q5''_a" by (simp add: Q5''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:216:lemma [simp]: "mono Q6''_a" by (simp add: Q6''_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:218:lemma [simp]: "dmono LinkMark"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:323:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:331:lemma [simp]: "grd \<top> = \<bottom>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:334:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:351:lemma [simp]: "mono QQ1_a" by (simp add: QQ1_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:352:lemma [simp]: "mono QQ2_a" by (simp add: QQ2_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:353:lemma [simp]: "mono QQ3_a" by (simp add: QQ3_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:354:lemma [simp]: "mono QQ4_a" by (simp add: QQ4_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:355:lemma [simp]: "mono QQ5_a" by (simp add: QQ5_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:356:lemma [simp]: "mono QQ6_a" by (simp add: QQ6_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:357:lemma [simp]: "mono QQ7_a" by (simp add: QQ7_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:358:lemma [simp]: "mono QQ8_a" by (simp add: QQ8_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/DSWMark.thy:360:lemma [simp]: "dmono ClassicMark"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:175:lemma [simp]: "R1'_a \<in> Apply.Disjunctive" by (simp add: R1'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:177:lemma [simp]: "R2'_a \<in> Apply.Disjunctive" by (simp add: R2'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:185:lemma [simp]: "Disjunctive_fun R'_a" by (simp add: Disjunctive_fun_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:289:lemma [simp]: "Disjunctive_fun (r::('c \<Rightarrow> 'a::complete_lattice \<Rightarrow> 'b::complete_lattice))
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:307:lemma [simp]: "mono Q1'_a" by (simp add: Q1'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:308:lemma [simp]: "mono Q2'_a" by (simp add: Q2'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:309:lemma [simp]: "mono Q3'_a" by (simp add: Q3'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:310:lemma [simp]: "mono Q4'_a" by (simp add: Q4'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:311:lemma [simp]: "mono Q5'_a" by (simp add: Q5'_a_def)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/GraphMarkingIBP/LinkMark.thy:313:lemma [simp]: "dmono StackMark_a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:178:lemma [simp]: "s \<bullet> t \<noteq> s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1543:lemma [simp]: "C_normal(\<Lambda> t) = C_normal t"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1549:lemma [simp]: "C_normal(V x)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1553:lemma [simp]: "dterm (dterm\<^sub>M\<^sub>L v) = dterm\<^sub>M\<^sub>L v"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1772:lemma [simp]: "C_normal(term v \<bullet>\<bullet> ts) \<longleftrightarrow> C_normal\<^sub>M\<^sub>L v \<and> ts = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1775:lemma [simp]: "C_normal(\<Lambda> t \<bullet>\<bullet> ts) \<longleftrightarrow> C_normal t \<and> ts = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1778:lemma [simp]: "C_normal(C nm \<bullet>\<bullet> ts) \<longleftrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1782:lemma [simp]: "C_normal(V x \<bullet>\<bullet> ts) \<longleftrightarrow> (\<forall>t \<in> set ts. C_normal t)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1802:lemma [simp]: "C_normal\<^sub>M\<^sub>L v \<Longrightarrow> C_normal\<^sub>M\<^sub>L(lift k v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/NormByEval/NBE.thy:1949:lemma [simp]: "C\<^sub>U_args(C nm \<bullet>\<bullet> ts) = ts"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:6:lemma [simp]: "safe [] = (%r. False)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:9:lemma [simp]: "safe (Exit g r # t) r' = safe t r'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:24:lemma [simp]: "\<not> safe (Check_in g r c # t) r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:31:lemma [simp]: "r \<noteq> r' \<Longrightarrow> safe (Check_in g r' c # t) r = safe t r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:48:lemma [simp]: "r \<noteq> r' \<Longrightarrow> safe (Enter g r' c # t) r = safe t r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HotelKeyCards/Equivalence.thy:86:lemma [simp]: "safe t r \<Longrightarrow> safe (Enter g r c # t) r"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:74:lemma [simp]: "A \<subseteq> filters \<Longrightarrow> \<Inter> A \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:97:lemma [simp]: "filterof X \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:160:lemma [simp]: "filterof X \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:268:lemma [simp]: "(a * b = 1) = (a = 1 \<and> b = 1)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:317:lemma [simp]: "(a l\<rightarrow> 1) = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:324:lemma [simp]: "(a r\<rightarrow> 1) = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoopFilters.thy:548:lemma [simp]: "H \<in> normalfilters \<Longrightarrow> H \<in> filters"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:34:lemma [simp]: "sup (Rep_G a - u + Rep_G b) 0 \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:51:lemma [simp]: "inf (Rep_G (b::'a G) - Rep_G a + u) u \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:67:lemma [simp]: "inf (u - Rep_G a + Rep_G b) u \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:97:lemma [simp]: "(u::'a) \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:100:lemma [simp]: "(1::'a G) * a = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:111:lemma [simp]: "a * (1::'a G) = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:121:lemma [simp]: "a l\<rightarrow> a = (1::'a G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:124:lemma [simp]: "a r\<rightarrow> a = (1::'a G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:127:lemma [simp]: "a \<in> G \<Longrightarrow> Rep_G (Abs_G a) = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:231:lemma [simp]: "0 \<in> G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:234:lemma [simp]: "0 \<le> (a::'a G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:320:lemma [simp]: "A \<in> subgroup \<Longrightarrow> 0 \<in> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:323:lemma [simp]: "A \<in> subgroup \<Longrightarrow> a \<in> A \<Longrightarrow> b \<in> A \<Longrightarrow> a + b \<in> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:682:lemma [simp]: "Rep_N a + Rep_N b \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:698:lemma [simp]: "inf (Rep_N b - Rep_N a) 0 \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:706:lemma [simp]: "inf (- Rep_N a + Rep_N b) 0 \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:714:lemma [simp]: "0 \<in> N"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:780:lemma [simp]: "(1::'a N) * a = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:783:lemma [simp]: "a * (1::'a N) = a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:786:lemma [simp]: "a l\<rightarrow> a = (1::'a N)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:789:lemma [simp]: "a r\<rightarrow> a = (1::'a N)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:1128:lemma [simp]: "(1, b) \<in> OrdSum"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:1131:lemma [simp]: "(a, 1) \<in> OrdSum"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/Examples.thy:1221:lemma [simp]: "fst (Rep_OrdSum a) \<noteq> 1 \<Longrightarrow> (snd (Rep_OrdSum a) \<noteq> 1 = False)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoops.thy:808:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoops.thy:872:lemma [simp]: "m \<le> n \<Longrightarrow> a ^ n \<le> a ^ m"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/PseudoHoops.thy:878:lemma [simp]: "a ^ (2 ^ n) \<le> a ^ n"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:135:lemma [simp]: "0 l\<rightarrow> a = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:138:lemma [simp]: "0 r\<rightarrow> a = 1"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:834:lemma [simp]: "(a l\<rightarrow> b) r\<rightarrow> b \<le> (b l\<rightarrow> a) r\<rightarrow> a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/PseudoHoops/SpecialPseudoHoops.thy:855:lemma [simp]: "(a r\<rightarrow> b) l\<rightarrow> b \<le> (b r\<rightarrow> a) l\<rightarrow> a"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Hoare_Time/Nielson_VCGi.thy:499:lemma [simp]: "support (\<lambda>a b. True) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Hoare_Time/Big_StepT_Partial.thy:311:lemma [simp]: "(Q ** $0) = Q" unfolding dollar_def sep_conj_def sep_disj_prod_def sep_disj_nat_def
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:31:lemma [simp]: "obj_ty (C,fs) = Class C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:66:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some Boolean) = (\<exists>b. v = Bool b)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:69:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some Integer) = (\<exists>i. v = Intg i)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:72:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some NT) = (v = Null)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:75:lemma [simp]: "(typeof\<^bsub>h\<^esub> v = Some(Class C)) = (\<exists>a fs. v = Addr a \<and> h a = Some(C,fs))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Objects.thy:78:lemma [simp]: "h a = Some(C,fs) \<Longrightarrow> typeof\<^bsub>(h(a\<mapsto>(C,fs')))\<^esub> v = typeof\<^bsub>h\<^esub> v"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:30:lemma [iff]: "\<not> P \<turnstile> Object \<prec>\<^sup>1 C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:33:lemma [iff]: "(P \<turnstile> Object \<preceq>\<^sup>* C) = (C = Object)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:87:lemma [iff]: "(P \<turnstile> T \<le> Void) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:90:lemma [iff]: "(P \<turnstile> T \<le> Boolean) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:93:lemma [iff]: "(P \<turnstile> T \<le> Integer) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:96:lemma [iff]: "(P \<turnstile> Void \<le> T) = (T = Void)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:99:lemma [iff]: "(P \<turnstile> Boolean \<le> T) = (T = Boolean)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:102:lemma [iff]: "(P \<turnstile> Integer \<le> T) = (T = Integer)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/TypeRel.thy:113:lemma [iff]: "(P \<turnstile> T \<le> NT) = (T = NT)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Exceptions.thy:46:lemma [simp]: "NullPointer \<in> sys_xcpts \<and> OutOfMemory \<in> sys_xcpts \<and> ClassCast \<in> sys_xcpts"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Type.thy:35:lemma [iff]: "is_refT NT"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Common/Type.thy:38:lemma [iff]: "is_refT(Class C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:162:lemma [simp]: "fields E Object = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:165:lemma [simp]: "fields E NullPointer = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:168:lemma [simp]: "fields E ClassCast = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:171:lemma [simp]: "fields E OutOfMemory = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVExample.thy:174:lemma [simp]: "fields E test_name = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/BV/BVNoTypeError.thy:28:lemma [iff]: "is_Ref Null" by (simp add: is_Ref_def2)
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/DFA/SemilatAlg.thy:41:lemma [iff]: "{} {\<sqsubseteq>\<^bsub>r\<^esub>} B"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/DFA/SemilatAlg.thy:44:lemma [iff]: "(A {\<sqsubseteq>\<^bsub>r\<^esub>} {}) = (A = {})"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:229:lemma [simp]: "final(Val v)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:232:lemma [simp]: "final(throw e) = (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:238:lemma [iff]: "finals []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:241:lemma [iff]: "finals (Val v # es) = finals es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:264:lemma [iff]: "finals (map Val vs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/BigStep.thy:267:lemma [iff]: "finals (throw e # es) = (\<exists>a. e = addr a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:19:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:264:lemma [iff]: "\<not> P \<turnstile> \<langle>[],s\<rangle> [\<rightarrow>] \<langle>es',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:267:lemma [iff]: "\<not> P \<turnstile> \<langle>Val v,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/SmallStep.thy:270:lemma [iff]: "\<not> P \<turnstile> \<langle>Throw a,s\<rangle> \<rightarrow> \<langle>e',s'\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Progress.thy:93:lemma [iff]: "P,E,h \<turnstile> e\<^sub>1;;e\<^sub>2 :' T\<^sub>2 = (\<exists>T\<^sub>1. P,E,h \<turnstile> e\<^sub>1:' T\<^sub>1 \<and> P,E,h \<turnstile> e\<^sub>2:' T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Progress.thy:100:lemma [iff]: "P,E,h \<turnstile> Val v :' T = (typeof\<^bsub>h\<^esub> v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Progress.thy:107:lemma [iff]: "P,E,h \<turnstile> Var v :' T = (E v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:133:lemma [iff]: "(P,E,h \<turnstile> [] [:] Ts) = (Ts = [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:140:lemma [iff]: "(P,E,h \<turnstile> e#es [:] T#Ts) = (P,E,h \<turnstile> e : T \<and> P,E,h \<turnstile> es [:] Ts)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:147:lemma [iff]: "(P,E,h \<turnstile> (e#es) [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:155:lemma [simp]: "\<forall>Ts. (P,E,h \<turnstile> es\<^sub>1 @ es\<^sub>2 [:] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:172:lemma [iff]: "P,E,h \<turnstile> Val v : T = (typeof\<^bsub>h\<^esub> v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:179:lemma [iff]: "P,E,h \<turnstile> Var v : T = (E v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:186:lemma [iff]: "P,E,h \<turnstile> e\<^sub>1;;e\<^sub>2 : T\<^sub>2 = (\<exists>T\<^sub>1. P,E,h \<turnstile> e\<^sub>1:T\<^sub>1 \<and> P,E,h \<turnstile> e\<^sub>2:T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellTypeRT.thy:193:lemma [iff]: "P,E,h \<turnstile> {V:T; e} : T' = (P,E(V\<mapsto>T),h \<turnstile> e : T')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/TypeSafe.thy:108:lemma [iff]: "\<And>A. \<lbrakk> length Vs = length Ts; length vs = length Ts\<rbrakk> \<Longrightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Equivalence.thy:659:lemma [simp]: "\<And>vs. length(upd_vals l Vs vs) = length Vs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Expr.thy:45:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Expr.thy:98:lemma [simp]: "fvs(es\<^sub>1 @ es\<^sub>2) = fvs es\<^sub>1 \<union> fvs es\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/Expr.thy:101:lemma [simp]: "fvs(map Val vs) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:116:lemma [iff]: "(P,E \<turnstile> [] [::] Ts) = (Ts = [])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:123:lemma [iff]: "(P,E \<turnstile> e#es [::] T#Ts) = (P,E \<turnstile> e :: T \<and> P,E \<turnstile> es [::] Ts)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:130:lemma [iff]: "(P,E \<turnstile> (e#es) [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:138:lemma [iff]: "\<And>Ts. (P,E \<turnstile> es\<^sub>1 @ es\<^sub>2 [::] Ts) =
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:155:lemma [iff]: "P,E \<turnstile> Val v :: T = (typeof v = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:162:lemma [iff]: "P,E \<turnstile> Var V :: T = (E V = Some T)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:169:lemma [iff]: "P,E \<turnstile> e\<^sub>1;;e\<^sub>2 :: T\<^sub>2 = (\<exists>T\<^sub>1. P,E \<turnstile> e\<^sub>1::T\<^sub>1 \<and> P,E \<turnstile> e\<^sub>2::T\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/WellType.thy:176:lemma [iff]: "(P,E \<turnstile> {V:T; e} :: T') = (is_type P T \<and> P,E(V\<mapsto>T) \<turnstile> e :: T')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:40:lemma [simp]: "\<lfloor>{}\<rfloor> \<squnion> A = A \<and> A \<squnion> \<lfloor>{}\<rfloor> = A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:43:lemma [simp]: "\<lfloor>A\<rfloor> \<squnion> \<lfloor>B\<rfloor> = \<lfloor>A \<union> B\<rfloor> \<and> \<lfloor>A\<rfloor> \<ominus> a = \<lfloor>A - {a}\<rfloor>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:46:lemma [simp]: "None \<squnion> A = None \<and> A \<squnion> None = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/J/DefAss.thy:49:lemma [simp]: "a \<in>\<in> None \<and> None \<ominus> a = None"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:53:lemma [simp]: "is_class (compP f P) C = is_class P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:57:lemma [simp]: "class (compP f P) C = map_option (\<lambda>c. snd(compC f (C,c))) (class P C)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:93:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:144:lemma [simp]: "subcls1(compP f P) = subcls1 P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:154:lemma [simp]: "(compP f P \<turnstile> Ts [\<le>] Ts') = (P \<turnstile> Ts [\<le>] Ts')"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:164:lemma [simp]: "is_type (compP f P) T = is_type P T"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:168:lemma [simp]: "(compP (f::'a\<Rightarrow>'b) P \<turnstile> C has_fields FDTs) = (P \<turnstile> C has_fields FDTs)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:198:lemma [simp]: "fields (compP f P) C = fields P C"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:202:lemma [simp]: "(compP f P \<turnstile> C sees F:T in D) = (P \<turnstile> C sees F:T in D)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:206:lemma [simp]: "field (compP f P) F D = field P F D"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:212:lemma [iff]: "distinct_fst (compP f P) = distinct_fst P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:221:lemma [iff]: "distinct_fst (map (compM f) ms) = distinct_fst ms"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:230:lemma [iff]: "wf_syscls (compP f P) = wf_syscls P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/PCompiler.thy:234:lemma [iff]: "wf_fdecl (compP f P) = wf_fdecl P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Compiler1.thy:34:lemma [simp]: "compEs\<^sub>1 Vs es = map (compE\<^sub>1 Vs) es"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Compiler1.thy:46:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:28:lemma [simp]: "P,C,M,pc \<rhd> []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:32:lemma [simp]: "P,C,M,pc \<rhd> (i#is) = (P,C,M,pc \<triangleright> i \<and> P,C,M,pc + 1 \<rhd> is)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:40:lemma [simp]: "P,C,M,pc \<rhd> (is\<^sub>1 @ is\<^sub>2) = (P,C,M,pc \<rhd> is\<^sub>1 \<and> P,C,M,pc + size is\<^sub>1 \<rhd> is\<^sub>2)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:54:lemma [simp]: "P,C,M,pc \<triangleright> i \<Longrightarrow> instrs_of P C M ! pc = i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:69:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:98:lemma [simp]: "pcs [] = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:102:lemma [simp]: "pcs (x#xt) = {fst x ..< fst(snd x)} \<union> pcs xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:106:lemma [simp]: "pcs(xt\<^sub>1 @ xt\<^sub>2) = pcs xt\<^sub>1 \<union> pcs xt\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:110:lemma [simp]: "pc < pc\<^sub>0 \<or> pc\<^sub>0+size(compE\<^sub>2 e) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxE\<^sub>2 e pc\<^sub>0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:114:lemma [simp]: "pc < pc\<^sub>0 \<or> pc\<^sub>0+size(compEs\<^sub>2 es) \<le> pc \<Longrightarrow> pc \<notin> pcs(compxEs\<^sub>2 es pc\<^sub>0 d)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:118:lemma [simp]: "pc\<^sub>1 + size(compE\<^sub>2 e\<^sub>1) \<le> pc\<^sub>2 \<Longrightarrow> pcs(compxE\<^sub>2 e\<^sub>1 pc\<^sub>1 d\<^sub>1) \<inter> pcs(compxE\<^sub>2 e\<^sub>2 pc\<^sub>2 d\<^sub>2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:122:lemma [simp]: "pc\<^sub>1 + size(compE\<^sub>2 e) \<le> pc\<^sub>2 \<Longrightarrow> pcs(compxE\<^sub>2 e pc\<^sub>1 d\<^sub>1) \<inter> pcs(compxEs\<^sub>2 es pc\<^sub>2 d\<^sub>2) = {}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:126:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:131:lemma [simp]: "\<lbrakk> x \<in> set xt; pc \<notin> pcs xt \<rbrakk> \<Longrightarrow> \<not> matches_ex_entry P D pc x"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:135:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:148:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:167:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Correctness2.thy:200:lemma [simp]: "P,C,M \<rhd> xt/I,d \<Longrightarrow> P,C,M \<rhd> xt/I,Suc d"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/Hidden.thy:19:lemma [simp]: "hidden xs i \<Longrightarrow> hidden (xs@[x]) i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:213:lemma [iff]: "OK None \<in> states P mxs mxl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:316:lemma [simp]: "shift 0 xt = xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:319:lemma [simp]: "shift n [] = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:322:lemma [simp]: "shift n (xt\<^sub>1 @ xt\<^sub>2) = shift n xt\<^sub>1 @ shift n xt\<^sub>2"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:325:lemma [simp]: "shift m (shift n xt) = shift (m+n) xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:328:lemma [simp]: "pcs (shift n xt) = {pc+n|pc. pc \<in> pcs xt}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:374:lemma [simp]: "eff i P pc et None = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:399:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:410:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:421:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:633:lemma [iff]: "xcpt_app i P pc mxs [] \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:637:lemma [simp]: "xcpt_eff i P pc \<tau> [] = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1168:lemma [simp]: "types (compP f P) = types P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1171:lemma [simp]: "states (compP f P) mxs mxl = states P mxs mxl"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1174:lemma [simp]: "app\<^sub>i (i, compP f P, pc, mpc, T, \<tau>) = app\<^sub>i (i, P, pc, mpc, T, \<tau>)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1184:lemma [simp]: "is_relevant_entry (compP f P) i = is_relevant_entry P i"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1193:lemma [simp]: "relevant_entries (compP f P) i pc xt = relevant_entries P i pc xt"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1196:lemma [simp]: "app i (compP f P) mpc T pc mxl xt \<tau> = app i P mpc T pc mxl xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1203:lemma [simp]: "app i P mpc T pc mxl xt \<tau> \<Longrightarrow> eff i (compP f P) pc xt \<tau> = eff i P pc xt \<tau>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1211:lemma [simp]: "subtype (compP f P) = subtype P"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1218:lemma [simp]: "compP f P \<turnstile> \<tau> \<le>' \<tau>' = P \<turnstile> \<tau> \<le>' \<tau>'"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Jinja/Compiler/TypeComp.thy:1221:lemma [simp]: "compP f P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s = P,T,mpc,mxl,xt \<turnstile> i,pc :: \<tau>s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_DRA/LTL_FGXU.thy:417:lemma [trans]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InformationFlowSlicing/LiftingIntra.thy:54:lemma [simp]:"\<not> lift_valid_edge valid_edge src trg knd E X (Node E,et,Node X)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Partial_Function_Set.thy:91:lemma [partial_function_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Partial_Function_Set.thy:172:lemma [partial_function_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:643:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:693:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:737:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generative_Probabilistic_Value.thy:1471:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generat.thy:33:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Generat.thy:40:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/List_Bits.thy:29:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CryptHOL/Resumption.thy:58:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Det.thy:339:lemma [refine_mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Foreach.thy:1546:lemma [refine_transfer_post_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Foreach.thy:1553:lemma [refine_transfer_post_simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:362:lemma [autoref_op_pat_def]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:621:lemma [simp, intro!]: "mono (WHILEI_lfp_body I m c f)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:627:lemma [refine_pw_simps]: "nofail (filter_ASSUME c m) \<longleftrightarrow> nofail m"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_While.thy:631:lemma [refine_pw_simps]: "inres (filter_ASSUME c m) x
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/examples/WordRefine.thy:16:lemma [simp, relator_props]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/examples/WordRefine.thy:20:lemma [simp]: "single_valuedp (\<lambda>c a. a = unat c)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/examples/WordRefine.thy:23:lemma [simp, relator_props]: "single_valued (converse word_nat_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Refine_Monadic/Refine_Basic.thy:1454:lemma [autoref_op_pat_def]: "RETURN x \<equiv> op_RETURN x" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:29:lemma [autoref_itype]: "op_slg_succs ::\<^sub>i \<langle>I\<rangle>\<^sub>ii_slg \<rightarrow>\<^sub>i I \<rightarrow>\<^sub>i \<langle>I\<rangle>\<^sub>ii_set" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:32:lemma [autoref_op_pat]: "E``{v} \<equiv> op_slg_succs$E$v" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:78:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:248:lemma [autoref_rel_intf]: "REL_INTF frgv_impl_rel_ext i_g_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:251:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:273:lemma [autoref_rel_intf]: "REL_INTF g_impl_rel_ext i_g_ext"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:276:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:287:lemma [autoref_rules]: "(gi_V_update, g_V_update) \<in> (\<langle>Rv\<rangle>fun_set_rel \<rightarrow> \<langle>Rv\<rangle>fun_set_rel) \<rightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:291:lemma [autoref_rules]: "(gi_E_update, g_E_update) \<in> (\<langle>Rv\<rangle>slg_rel \<rightarrow> \<langle>Rv\<rangle>slg_rel) \<rightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:295:lemma [autoref_rules]: "(gi_V0_update, g_V0_update) \<in> (\<langle>Rv\<rangle>list_set_rel \<rightarrow> \<langle>Rv\<rangle>list_set_rel) \<rightarrow>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Digraph_Impl.thy:303:lemma [autoref_hom]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:92:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:228:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:365:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:490:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:618:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:739:lemma [relator_props, simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:892:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:903:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:969:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/CAVA_Automata/Automata_Impl.thy:980:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Flow_Networks/Network_Impl.thy:189:lemma [intf_of_assn]: "intf_of_assn (cf_assn) TYPE(capacity_impl i_mtx)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Shivers-CFA/AbsCFCorrect.thy:109:lemma [simp]: "|{}| = {}" unfolding abs_ccache_def by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Polynomial_Interpolation/Newton_Interpolation.thy:170:lemma [simp]: "xd i i = 0" "xd i j + xd j k = xd i k" "xd i j + xd k i = xd k j"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Promela/Promela.thy:100:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Array_Stack.thy:19:lemma [relator_props]: "single_valued R \<Longrightarrow> single_valued (\<langle>R\<rangle>as_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:171:lemma [autoref_rules]: "(bs_empty (),{})\<in>\<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:174:lemma [autoref_rules]: "(bs_UNIV (),UNIV)\<in>\<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:177:lemma [autoref_rules]: "(bs_isEmpty,op_set_isEmpty)\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:181:lemma [autoref_rules]: "(bs_insert,insert)\<in>nat_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:185:lemma [autoref_rules]: "(bs_delete,op_set_delete)\<in>nat_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:188:lemma [autoref_rules]: "(bs_mem,(\<in>))\<in>nat_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:191:lemma [autoref_rules]: "(bs_eq,(=))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:194:lemma [autoref_rules]: "(bs_subset_eq,(\<subseteq>))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:197:lemma [autoref_rules]: "(bs_union,(\<union>))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:200:lemma [autoref_rules]: "(bs_inter,(\<inter>))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:203:lemma [autoref_rules]: "(bs_diff,(-))\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:206:lemma [autoref_rules]: "(bs_complement,uminus)\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_Bit_Set.thy:209:lemma [autoref_rules]: "(bs_disjoint,op_set_disjoint)\<in>\<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> \<langle>nat_rel\<rangle>bs_set_rel \<rightarrow> bool_rel"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_RBT_Map.thy:1056:lemma [simp,autoref_post_simps]: "ord.rbt_ins (<) = rbt_ins"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_RBT_Map.thy:1064:lemma [autoref_post_simps]: "ord.rbt_lookup ((<)::_::linorder\<Rightarrow>_) = rbt_lookup"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Impl/Impl_RBT_Map.thy:1067:lemma [simp,autoref_post_simps]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Comp.thy:869:lemma [autoref_post_simps]: "comp2eq (dflt_cmp (\<le>) ((<)::_::linorder\<Rightarrow>_)) = (=)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Map.thy:29:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Map.thy:94:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:25:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:50:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:54:lemma [autoref_op_pat]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/GenCF/Intf/Intf_Set.thy:96:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Nested_DFS.thy:1037:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Nested_DFS.thy:1048:lemma [autoref_op_pat]: "NO_CYC \<equiv> OP NO_CYC :::\<^sub>i i_blue_wit" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Succ_Graph.thy:19:lemma [relator_props]: "single_valued R \<Longrightarrow> single_valued (\<langle>R\<rangle>slg_rel)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Succ_Graph.thy:32:lemma [autoref_itype]: "slg_succs ::\<^sub>i \<langle>I\<rangle>\<^sub>ii_slg \<rightarrow>\<^sub>i I \<rightarrow>\<^sub>i \<langle>I\<rangle>\<^sub>ii_set" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Succ_Graph.thy:35:lemma [autoref_op_pat]: "E``{v} \<equiv> slg_succs$E$v" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Coll_Test.thy:427:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Coll_Test.thy:434:lemma [autoref_rules_raw]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/Examples/Autoref/Combined_TwoSat.thy:10:lemma [autoref_rules]: "(Lit,Lit)\<in>Id\<rightarrow>Id\<rightarrow>Id" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Collections/ICF/ICF_Autoref.thy:39:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Base.thy:2285:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:49:lemma [mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:478:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:485:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1050:lemma [quot_respect]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1055:lemma [quot_preserve]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1061:lemma [mono]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1066:lemma [eqvt]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Nominal2/Nominal2_Abs.thy:1072:lemma [eqvt]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Incompleteness/Goedel_II.thy:27:lemma [simp]: "\<langle>\<langle>0,0,0\<rangle>, x, y\<rangle> = q_Eats x y"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Floyd_Warshall/FW_Code.thy:66:lemma [sepref_import_param]: "((+),(+)::'a\<Rightarrow>_) \<in> Id \<rightarrow> Id \<rightarrow> Id" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Floyd_Warshall/FW_Code.thy:67:lemma [sepref_import_param]: "(min,min::'a\<Rightarrow>_) \<in> Id \<rightarrow> Id \<rightarrow> Id" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HOLCF-Prelude/examples/Fibs.thy:33:lemma [simp]:"-1 + \<lbrakk>i\<rbrakk> = \<lbrakk> i \<rbrakk> - 1" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HOLCF-Prelude/examples/Fibs.thy:34:lemma [simp]:"-2 + \<lbrakk>i\<rbrakk> = \<lbrakk> i \<rbrakk> - 2" by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA.thy:49:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA.thy:1157:lemma [intro!]: "expand_inv \<phi> (
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:226:lemma [refine_transfer]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:316:lemma [autoref_rules]: "(node_impl_ext, node_ext) \<in>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:327:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:346:lemma [autoref_rules]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:983:lemma [autoref_itype]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LTL_to_GBA/LTL_to_GBA_impl.thy:1016:lemma [autoref_itype]: "expand\<^sub>T
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:88:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:339:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:778:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:782:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:786:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/InfPathElimination/SymExec.thy:798:lemma [simp] :
/srv/data/tum/isabelle/devel/../../afp/devel/thys/WebAssembly/Wasm_Interpreter.thy:101:lemma[simp]: "e_is_trap e = (e = Trap)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/WebAssembly/Wasm_Interpreter.thy:105:lemma[simp]: "es_is_trap es = (es = [Trap])"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Regex_Equivalence/Deriv_Autos.thy:67:lemma [transfer_rule]: "rel_fun (rel_set (pcr_ACI_rexp (=))) (=) (finite o image ACI_norm) finite"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/UPF/ServiceExample.thy:94:lemma [simp]: "(case a of allow d \<Rightarrow> \<lfloor>X\<rfloor> | deny d2 \<Rightarrow> \<lfloor>Y\<rfloor>) = \<bottom> \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LLL_Basis_Reduction/Norms.thy:358:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/LLL_Basis_Reduction/Missing_Lemmas.thy:301:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/WellFormProgs.thy:15:lemma [dest]:"\<lbrakk>well_formed procs; (Main,ins,outs,c) \<in> set procs\<rbrakk> \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/Com.thy:64:lemma [dest]:"#:c = 0 \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/PCFG.thy:157:lemma [dest]:"prog \<turnstile> n -IEdge (Q:r\<hookrightarrow>\<^bsub>p\<^esub>fs)\<rightarrow>\<^sub>p n' \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/Proc/PCFG.thy:160:lemma [dest]:"prog \<turnstile> n -IEdge (Q\<hookleftarrow>\<^bsub>p\<^esub>f)\<rightarrow>\<^sub>p n' \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:754:lemma [simp]: "PROG (Abs_wf_jvmprog (EP, Phi_EP)) = EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:761:lemma [simp]: "TYPING (Abs_wf_jvmprog (EP, Phi_EP)) = Phi_EP"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:776:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/JinjaVM_Inter/JVMPostdomination.thy:781:lemma [simp]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG.thy:129:lemma [simp]:"length (params fs cf) = length fs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG.thy:181:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (sourcenode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG.thy:184:lemma [simp]: "valid_edge a \<Longrightarrow> valid_node (targetnode a)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/Slice.thy:20:lemma [simp]: "length (csppa m S x fs) = length fs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/Slice.thy:23:lemma [simp]: "length (cspp m S fs) = length fs"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:36:lemma [simp]: "valid_node (_Entry_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:43:lemma [simp]: "valid_node (_Exit_)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:106:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:110:lemma [dest]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:114:lemma [simp]:"\<lbrakk>valid_edge a; targetnode a \<noteq> (_Exit_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:118:lemma [simp]:"\<lbrakk>valid_edge a; sourcenode a \<noteq> (_Entry_)\<rbrakk>
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFGExit.thy:142:lemma [dest]:"(_Exit_) -as\<rightarrow>* n' \<Longrightarrow> n' = (_Exit_) \<and> as = []"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/SCDObservable.thy:50:lemma [intro]:"\<forall>n \<in> S. valid_SDG_node n \<Longrightarrow> \<forall>n \<in> \<lfloor>S\<rfloor>\<^bsub>CFG\<^esub>. valid_node n"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG_wf.thy:209:lemma [dest!]: "V \<in> Use (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/HRB-Slicing/StaticInter/CFG_wf.thy:212:lemma [dest!]: "V \<in> Def (_Entry_) \<Longrightarrow> False"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Incredible_Proof_Machine/Predicate_Formulas.thy:105:lemma [simp]: "fv_subst1 (map (apsnd (map_lc p)) s) = fv_subst1 s"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Possibilistic_Noninterference/Concrete.thy:48:lemma [simp]: "\<And> l. l \<noteq> Hi \<longleftrightarrow> l = Lo" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Possibilistic_Noninterference/Concrete.thy:54:lemma [dest]: "\<And> l A. \<lbrakk>l \<in> A; Lo \<notin> A\<rbrakk> \<Longrightarrow> l = Hi" and
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Program-Conflict-Analysis/ConsInterleave.thy:131:lemma [simp]: "w\<otimes>\<^bsub>\<alpha>\<^esub>[] = {w}"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:110:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:117:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:121:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:125:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:129:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:133:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Discrete_Summation/Summation_Conversion.thy:137:lemma [summation]:
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:177:lemma [simp]: "rev_path [] = []" unfolding rev_path_def by simp
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:186:lemma [intro!]: "finite (edges G) \<Longrightarrow> finite (edges (del_unEdge u e u' G))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:189:lemma [intro!]: "finite (nodes G) \<Longrightarrow> finite (nodes (del_unEdge u e u' G))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:192:lemma [intro!]: "finite (edges G) \<Longrightarrow> finite (edges (rem_unPath ps G))"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:213:lemma [intro!]: "finite (nodes G) \<Longrightarrow> finite (odd_nodes_set G)"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:216:lemma [simp]: "nodes (del_unEdge u e u' G)=nodes G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:219:lemma [simp]: "nodes (rem_unPath ps G) = nodes G"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Koenigsberg_Friendship/MoreGraph.thy:233:lemma [intro!]: "finite (nodes G) \<Longrightarrow> finite (nodes (rem_unPath ps G))" by auto
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Inductive_Confidentiality/DolevYao/Message.thy:16:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/Inductive_Confidentiality/GeneralAttacker/MessageGA.thy:6:lemma [simp] : "A \<union> (B \<union> A) = B \<union> A"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Basis.thy:83:lemma [simp]: "i < \<parallel>xs\<parallel> \<Longrightarrow> (xs @ ys)\<langle>i\<rangle> = xs\<langle>i\<rangle>"
/srv/data/tum/isabelle/devel/../../afp/devel/thys/POPLmark-deBruijn/Basis.thy:90:lemma [simp]: "\<parallel>xs\<parallel> \<le> i \<Longrightarrow> (xs @ ys)\<langle>i\<rangle> = ys\<langle>i - \<parallel>xs\<parallel>\<rangle>"
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: OpenPGP digital signature
URL: <https://mailmanbroy.informatik.tu-muenchen.de/pipermail/isabelle-dev/attachments/20180523/2349c124/attachment-0001.asc>
More information about the isabelle-dev
mailing list