3 Author: Tobias Nipkow, Markus Wenzel, and Larry Paulson
6 header {* The basis of Higher-Order Logic *}
12 "~~/src/Tools/IsaPlanner/zipper.ML"
13 "~~/src/Tools/IsaPlanner/isand.ML"
14 "~~/src/Tools/IsaPlanner/rw_tools.ML"
15 "~~/src/Tools/IsaPlanner/rw_inst.ML"
16 "~~/src/Provers/project_rule.ML"
17 "~~/src/Provers/hypsubst.ML"
18 "~~/src/Provers/splitter.ML"
19 "~~/src/Provers/classical.ML"
20 "~~/src/Provers/blast.ML"
21 "~~/src/Provers/clasimp.ML"
22 "~~/src/Provers/eqsubst.ML"
23 "~~/src/Provers/quantifier1.ML"
25 "~~/src/Tools/random_word.ML"
26 "~~/src/Tools/atomize_elim.ML"
27 "~~/src/Tools/induct.ML"
28 "~~/src/Tools/code/code_name.ML"
29 "~~/src/Tools/code/code_funcgr.ML"
30 "~~/src/Tools/code/code_thingol.ML"
31 "~~/src/Tools/code/code_target.ML"
32 "~~/src/Tools/code/code_package.ML"
36 subsection {* Primitive logic *}
38 subsubsection {* Core syntax *}
42 setup {* ObjectLogic.add_base_sort @{sort type} *}
45 "fun" :: (type, type) type
53 Trueprop :: "bool => prop" ("(_)" 5)
56 Not :: "bool => bool" ("~ _" [40] 40)
61 The :: "('a => bool) => 'a"
62 All :: "('a => bool) => bool" (binder "ALL " 10)
63 Ex :: "('a => bool) => bool" (binder "EX " 10)
64 Ex1 :: "('a => bool) => bool" (binder "EX! " 10)
65 Let :: "['a, 'a => 'b] => 'b"
67 "op =" :: "['a, 'a] => bool" (infixl "=" 50)
68 "op &" :: "[bool, bool] => bool" (infixr "&" 35)
69 "op |" :: "[bool, bool] => bool" (infixr "|" 30)
70 "op -->" :: "[bool, bool] => bool" (infixr "-->" 25)
75 If :: "[bool, 'a, 'a] => 'a" ("(if (_)/ then (_)/ else (_))" 10)
78 subsubsection {* Additional concrete syntax *}
84 not_equal :: "['a, 'a] => bool" (infixl "~=" 50) where
88 not_equal (infix "~=" 50)
91 Not ("\<not> _" [40] 40) and
92 "op &" (infixr "\<and>" 35) and
93 "op |" (infixr "\<or>" 30) and
94 "op -->" (infixr "\<longrightarrow>" 25) and
95 not_equal (infix "\<noteq>" 50)
97 notation (HTML output)
98 Not ("\<not> _" [40] 40) and
99 "op &" (infixr "\<and>" 35) and
100 "op |" (infixr "\<or>" 30) and
101 not_equal (infix "\<noteq>" 50)
104 iff :: "[bool, bool] => bool" (infixr "<->" 25) where
108 iff (infixr "\<longleftrightarrow>" 25)
116 "_The" :: "[pttrn, bool] => 'a" ("(3THE _./ _)" [0, 10] 10)
118 "_bind" :: "[pttrn, 'a] => letbind" ("(2_ =/ _)" 10)
119 "" :: "letbind => letbinds" ("_")
120 "_binds" :: "[letbind, letbinds] => letbinds" ("_;/ _")
121 "_Let" :: "[letbinds, 'a] => 'a" ("(let (_)/ in (_))" 10)
123 "_case_syntax":: "['a, cases_syn] => 'b" ("(case _ of/ _)" 10)
124 "_case1" :: "['a, 'b] => case_syn" ("(2_ =>/ _)" 10)
125 "" :: "case_syn => cases_syn" ("_")
126 "_case2" :: "[case_syn, cases_syn] => cases_syn" ("_/ | _")
129 "THE x. P" == "The (%x. P)"
130 "_Let (_binds b bs) e" == "_Let b (_Let bs e)"
131 "let x = a in e" == "Let a (%x. e)"
134 (* To avoid eta-contraction of body: *)
135 [("The", fn [Abs abs] =>
136 let val (x,t) = atomic_abs_tr' abs
137 in Syntax.const "_The" $ x $ t end)]
141 "_case1" :: "['a, 'b] => case_syn" ("(2_ \<Rightarrow>/ _)" 10)
144 All (binder "\<forall>" 10) and
145 Ex (binder "\<exists>" 10) and
146 Ex1 (binder "\<exists>!" 10)
148 notation (HTML output)
149 All (binder "\<forall>" 10) and
150 Ex (binder "\<exists>" 10) and
151 Ex1 (binder "\<exists>!" 10)
154 All (binder "! " 10) and
155 Ex (binder "? " 10) and
156 Ex1 (binder "?! " 10)
159 subsubsection {* Axioms and basic definitions *}
162 eq_reflection: "(x=y) ==> (x==y)"
166 ext: "(!!x::'a. (f x ::'b) = g x) ==> (%x. f x) = (%x. g x)"
167 -- {*Extensionality is built into the meta-logic, and this rule expresses
168 a related property. It is an eta-expanded version of the traditional
169 rule, and similar to the ABS rule of HOL*}
171 the_eq_trivial: "(THE x. x = a) = (a::'a)"
173 impI: "(P ==> Q) ==> P-->Q"
174 mp: "[| P-->Q; P |] ==> Q"
178 True_def: "True == ((%x::bool. x) = (%x. x))"
179 All_def: "All(P) == (P = (%x. True))"
180 Ex_def: "Ex(P) == !Q. (!x. P x --> Q) --> Q"
181 False_def: "False == (!P. P)"
182 not_def: "~ P == P-->False"
183 and_def: "P & Q == !R. (P-->Q-->R) --> R"
184 or_def: "P | Q == !R. (P-->R) --> (Q-->R) --> R"
185 Ex1_def: "Ex1(P) == ? x. P(x) & (! y. P(y) --> y=x)"
188 iff: "(P-->Q) --> (Q-->P) --> (P=Q)"
189 True_or_False: "(P=True) | (P=False)"
192 Let_def: "Let s f == f(s)"
193 if_def: "If P x y == THE z::'a. (P=True --> z=x) & (P=False --> z=y)"
205 undefined_fun: "undefined x = undefined"
208 subsubsection {* Generic classes and algebraic operations *}
210 class default = type +
214 fixes zero :: 'a ("0")
217 fixes one :: 'a ("1")
219 hide (open) const zero one
222 fixes plus :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "+" 65)
225 fixes minus :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "-" 65)
227 class uminus = type +
228 fixes uminus :: "'a \<Rightarrow> 'a" ("- _" [81] 80)
231 fixes times :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "*" 70)
233 class inverse = type +
234 fixes inverse :: "'a \<Rightarrow> 'a"
235 and divide :: "'a \<Rightarrow> 'a \<Rightarrow> 'a" (infixl "'/" 70)
238 fixes abs :: "'a \<Rightarrow> 'a"
242 abs ("\<bar>_\<bar>")
244 notation (HTML output)
245 abs ("\<bar>_\<bar>")
250 fixes sgn :: "'a \<Rightarrow> 'a"
253 fixes less_eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
254 and less :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
258 less_eq ("op <=") and
259 less_eq ("(_/ <= _)" [51, 51] 50) and
261 less ("(_/ < _)" [51, 51] 50)
264 less_eq ("op \<le>") and
265 less_eq ("(_/ \<le> _)" [51, 51] 50)
267 notation (HTML output)
268 less_eq ("op \<le>") and
269 less_eq ("(_/ \<le> _)" [51, 51] 50)
272 greater_eq (infix ">=" 50) where
273 "x >= y \<equiv> y <= x"
276 greater_eq (infix "\<ge>" 50)
279 greater (infix ">" 50) where
280 "x > y \<equiv> y < x"
283 Least :: "('a \<Rightarrow> bool) \<Rightarrow> 'a" (binder "LEAST " 10) where
284 "Least P == (THE x. P x \<and> (\<forall>y. P y \<longrightarrow> less_eq x y))"
289 "_index1" :: index ("\<^sub>1")
291 (index) "\<^sub>1" => (index) "\<^bsub>\<struct>\<^esub>"
293 typed_print_translation {*
295 fun tr' c = (c, fn show_sorts => fn T => fn ts =>
296 if T = dummyT orelse not (! show_types) andalso can Term.dest_Type T then raise Match
297 else Syntax.const Syntax.constrainC $ Syntax.const c $ Syntax.term_of_typ show_sorts T);
298 in map tr' [@{const_syntax HOL.one}, @{const_syntax HOL.zero}] end;
299 *} -- {* show types that are presumably too general *}
302 subsection {* Fundamental rules *}
304 subsubsection {* Equality *}
306 text {* Thanks to Stephan Merz *}
308 assumes eq: "s = t" and p: "P s"
311 from eq have meta: "s \<equiv> t"
312 by (rule eq_reflection)
317 lemma sym: "s = t ==> t = s"
318 by (erule subst) (rule refl)
320 lemma ssubst: "t = s ==> P s ==> P t"
321 by (drule sym) (erule subst)
323 lemma trans: "[| r=s; s=t |] ==> r=t"
326 lemma meta_eq_to_obj_eq:
327 assumes meq: "A == B"
329 by (unfold meq) (rule refl)
331 text {* Useful with @{text erule} for proving equalities from known equalities. *}
335 lemma box_equals: "[| a=b; a=c; b=d |] ==> c=d"
342 text {* For calculational reasoning: *}
344 lemma forw_subst: "a = b ==> P b ==> P a"
347 lemma back_subst: "P a ==> a = b ==> P b"
351 subsubsection {*Congruence rules for application*}
353 (*similar to AP_THM in Gordon's HOL*)
354 lemma fun_cong: "(f::'a=>'b) = g ==> f(x)=g(x)"
359 (*similar to AP_TERM in Gordon's HOL and FOL's subst_context*)
360 lemma arg_cong: "x=y ==> f(x)=f(y)"
365 lemma arg_cong2: "\<lbrakk> a = b; c = d \<rbrakk> \<Longrightarrow> f a c = f b d"
366 apply (erule ssubst)+
370 lemma cong: "[| f = g; (x::'a) = y |] ==> f(x) = g(y)"
376 subsubsection {*Equality of booleans -- iff*}
378 lemma iffI: assumes "P ==> Q" and "Q ==> P" shows "P=Q"
379 by (iprover intro: iff [THEN mp, THEN mp] impI assms)
381 lemma iffD2: "[| P=Q; Q |] ==> P"
384 lemma rev_iffD2: "[| Q; P=Q |] ==> P"
387 lemma iffD1: "Q = P \<Longrightarrow> Q \<Longrightarrow> P"
388 by (drule sym) (rule iffD2)
390 lemma rev_iffD1: "Q \<Longrightarrow> Q = P \<Longrightarrow> P"
391 by (drule sym) (rule rev_iffD2)
395 and minor: "[| P --> Q; Q --> P |] ==> R"
397 by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1])
400 subsubsection {*True*}
403 unfolding True_def by (rule refl)
405 lemma eqTrueI: "P ==> P = True"
406 by (iprover intro: iffI TrueI)
408 lemma eqTrueE: "P = True ==> P"
409 by (erule iffD2) (rule TrueI)
412 subsubsection {*Universal quantifier*}
414 lemma allI: assumes "!!x::'a. P(x)" shows "ALL x. P(x)"
415 unfolding All_def by (iprover intro: ext eqTrueI assms)
417 lemma spec: "ALL x::'a. P(x) ==> P(x)"
418 apply (unfold All_def)
420 apply (erule fun_cong)
424 assumes major: "ALL x. P(x)"
425 and minor: "P(x) ==> R"
427 by (iprover intro: minor major [THEN spec])
430 assumes major: "ALL x. P(x)"
431 and minor: "[| P(x); ALL x. P(x) |] ==> R"
433 by (iprover intro: minor major major [THEN spec])
436 subsubsection {* False *}
439 Depends upon @{text spec}; it is impossible to do propositional
440 logic before quantifiers!
443 lemma FalseE: "False ==> P"
444 apply (unfold False_def)
448 lemma False_neq_True: "False = True ==> P"
449 by (erule eqTrueE [THEN FalseE])
452 subsubsection {* Negation *}
455 assumes "P ==> False"
457 apply (unfold not_def)
458 apply (iprover intro: impI assms)
461 lemma False_not_True: "False ~= True"
463 apply (erule False_neq_True)
466 lemma True_not_False: "True ~= False"
469 apply (erule False_neq_True)
472 lemma notE: "[| ~P; P |] ==> R"
473 apply (unfold not_def)
474 apply (erule mp [THEN FalseE])
478 lemma notI2: "(P \<Longrightarrow> \<not> Pa) \<Longrightarrow> (P \<Longrightarrow> Pa) \<Longrightarrow> \<not> P"
479 by (erule notE [THEN notI]) (erule meta_mp)
482 subsubsection {*Implication*}
485 assumes "P-->Q" "P" "Q ==> R"
487 by (iprover intro: assms mp)
489 (* Reduces Q to P-->Q, allowing substitution in P. *)
490 lemma rev_mp: "[| P; P --> Q |] ==> Q"
491 by (iprover intro: mp)
497 by (iprover intro: notI minor major [THEN notE])
499 (*not used at all, but we already have the other 3 combinations *)
502 and minor: "P ==> ~Q"
504 by (iprover intro: notI minor major notE)
506 lemma not_sym: "t ~= s ==> s ~= t"
507 by (erule contrapos_nn) (erule sym)
509 lemma eq_neq_eq_imp_neq: "[| x = a ; a ~= b; b = y |] ==> x ~= y"
510 by (erule subst, erule ssubst, assumption)
512 (*still used in HOLCF*)
514 assumes pq: "P ==> Q"
517 apply (rule nq [THEN contrapos_nn])
521 subsubsection {*Existential quantifier*}
523 lemma exI: "P x ==> EX x::'a. P x"
524 apply (unfold Ex_def)
525 apply (iprover intro: allI allE impI mp)
529 assumes major: "EX x::'a. P(x)"
530 and minor: "!!x. P(x) ==> Q"
532 apply (rule major [unfolded Ex_def, THEN spec, THEN mp])
533 apply (iprover intro: impI [THEN allI] minor)
537 subsubsection {*Conjunction*}
539 lemma conjI: "[| P; Q |] ==> P&Q"
540 apply (unfold and_def)
541 apply (iprover intro: impI [THEN allI] mp)
544 lemma conjunct1: "[| P & Q |] ==> P"
545 apply (unfold and_def)
546 apply (iprover intro: impI dest: spec mp)
549 lemma conjunct2: "[| P & Q |] ==> Q"
550 apply (unfold and_def)
551 apply (iprover intro: impI dest: spec mp)
556 and minor: "[| P; Q |] ==> R"
559 apply (rule major [THEN conjunct1])
560 apply (rule major [THEN conjunct2])
564 assumes "P" "P ==> Q" shows "P & Q"
565 by (iprover intro: conjI assms)
568 subsubsection {*Disjunction*}
570 lemma disjI1: "P ==> P|Q"
571 apply (unfold or_def)
572 apply (iprover intro: allI impI mp)
575 lemma disjI2: "Q ==> P|Q"
576 apply (unfold or_def)
577 apply (iprover intro: allI impI mp)
582 and minorP: "P ==> R"
583 and minorQ: "Q ==> R"
585 by (iprover intro: minorP minorQ impI
586 major [unfolded or_def, THEN spec, THEN mp, THEN mp])
589 subsubsection {*Classical logic*}
592 assumes prem: "~P ==> P"
594 apply (rule True_or_False [THEN disjE, THEN eqTrueE])
596 apply (rule notI [THEN prem, THEN eqTrueI])
601 lemmas ccontr = FalseE [THEN classical, standard]
603 (*notE with premises exchanged; it discharges ~R so that it can be used to
604 make elimination rules*)
607 and premnot: "~R ==> ~P"
610 apply (erule notE [OF premnot premp])
613 (*Double negation law*)
614 lemma notnotD: "~~P ==> P"
615 apply (rule classical)
624 by (iprover intro: classical p1 p2 notE)
627 subsubsection {*Unique existence*}
630 assumes "P a" "!!x. P(x) ==> x=a"
632 by (unfold Ex1_def, iprover intro: assms exI conjI allI impI)
634 text{*Sometimes easier to use: the premises have no shared variables. Safe!*}
636 assumes ex_prem: "EX x. P(x)"
637 and eq: "!!x y. [| P(x); P(y) |] ==> x=y"
639 by (iprover intro: ex_prem [THEN exE] ex1I eq)
642 assumes major: "EX! x. P(x)"
643 and minor: "!!x. [| P(x); ALL y. P(y) --> y=x |] ==> R"
645 apply (rule major [unfolded Ex1_def, THEN exE])
647 apply (iprover intro: minor)
650 lemma ex1_implies_ex: "EX! x. P x ==> EX x. P x"
657 subsubsection {*THE: definite description operator*}
661 and premx: "!!x. P x ==> x=a"
662 shows "(THE x. P x) = a"
663 apply (rule trans [OF _ the_eq_trivial])
664 apply (rule_tac f = "The" in arg_cong)
668 apply (erule ssubst, rule prema)
672 assumes "P a" and "!!x. P x ==> x=a"
673 shows "P (THE x. P x)"
674 by (iprover intro: assms the_equality [THEN ssubst])
676 lemma theI': "EX! x. P x ==> P (THE x. P x)"
684 (*Easier to apply than theI: only one occurrence of P*)
686 assumes "P a" "!!x. P x ==> x=a" "!!x. P x ==> Q x"
687 shows "Q (THE x. P x)"
688 by (iprover intro: assms theI)
690 lemma the1I2: assumes "EX! x. P x" "\<And>x. P x \<Longrightarrow> Q x" shows "Q (THE x. P x)"
691 by(iprover intro:assms(2) theI2[where P=P and Q=Q] ex1E[OF assms(1)]
694 lemma the1_equality [elim?]: "[| EX!x. P x; P a |] ==> (THE x. P x) = a"
695 apply (rule the_equality)
698 apply (erule all_dupE)
707 lemma the_sym_eq_trivial: "(THE y. x=y) = x"
708 apply (rule the_equality)
714 subsubsection {*Classical intro rules for disjunction and existential quantifiers*}
717 assumes "~Q ==> P" shows "P|Q"
718 apply (rule classical)
719 apply (iprover intro: assms disjI1 disjI2 notI elim: notE)
722 lemma excluded_middle: "~P | P"
723 by (iprover intro: disjCI)
726 case distinction as a natural deduction rule.
727 Note that @{term "~P"} is the second case, not the first
729 lemma case_split_thm:
730 assumes prem1: "P ==> Q"
731 and prem2: "~P ==> Q"
733 apply (rule excluded_middle [THEN disjE])
737 lemmas case_split = case_split_thm [case_names True False]
739 (*Classical implies (-->) elimination. *)
741 assumes major: "P-->Q"
742 and minor: "~P ==> R" "Q ==> R"
744 apply (rule excluded_middle [of P, THEN disjE])
745 apply (iprover intro: minor major [THEN mp])+
748 (*This version of --> elimination works on Q before P. It works best for
749 those cases in which P holds "almost everywhere". Can't install as
750 default: would break old proofs.*)
752 assumes major: "P-->Q"
753 and minor: "Q ==> R" "~P ==> R"
755 apply (rule excluded_middle [of P, THEN disjE])
756 apply (iprover intro: minor major [THEN mp])+
759 (*Classical <-> elimination. *)
762 and minor: "[| P; Q |] ==> R" "[| ~P; ~Q |] ==> R"
764 apply (rule major [THEN iffE])
765 apply (iprover intro: minor elim: impCE notE)
769 assumes "ALL x. ~P(x) ==> P(a)"
772 apply (iprover intro: assms exI allI notI notE [of "\<exists>x. P x"])
776 subsubsection {* Intuitionistic Reasoning *}
781 and 3: "P --> Q ==> P"
784 from 3 and 1 have P .
785 with 1 have Q by (rule impE)
790 assumes 1: "ALL x. P x"
791 and 2: "P x ==> ALL x. P x ==> Q"
794 from 1 have "P x" by (rule spec)
795 from this and 1 show Q by (rule 2)
803 from 2 and 1 have P .
804 with 1 show R by (rule notE)
807 lemma TrueE: "True ==> P ==> P" .
808 lemma notFalseE: "~ False ==> P ==> P" .
810 lemmas [Pure.elim!] = disjE iffE FalseE conjE exE TrueE notFalseE
811 and [Pure.intro!] = iffI conjI impI TrueI notI allI refl
812 and [Pure.elim 2] = allE notE' impE'
813 and [Pure.intro] = exI disjI2 disjI1
815 lemmas [trans] = trans
816 and [sym] = sym not_sym
817 and [Pure.elim?] = iffD1 iffD2 impE
822 subsubsection {* Atomizing meta-level connectives *}
824 lemma atomize_all [atomize]: "(!!x. P x) == Trueprop (ALL x. P x)"
827 then show "ALL x. P x" ..
830 then show "!!x. P x" by (rule allE)
833 lemma atomize_imp [atomize]: "(A ==> B) == Trueprop (A --> B)"
836 show "A --> B" by (rule impI) (rule r)
838 assume "A --> B" and A
839 then show B by (rule mp)
842 lemma atomize_not: "(A ==> False) == Trueprop (~A)"
844 assume r: "A ==> False"
845 show "~A" by (rule notI) (rule r)
848 then show False by (rule notE)
851 lemma atomize_eq [atomize]: "(x == y) == Trueprop (x = y)"
854 show "x = y" by (unfold `x == y`) (rule refl)
857 then show "x == y" by (rule eq_reflection)
860 lemma atomize_conj [atomize]:
861 includes meta_conjunction_syntax
862 shows "(A && B) == Trueprop (A & B)"
864 assume conj: "A && B"
867 from conj show A by (rule conjunctionD1)
868 from conj show B by (rule conjunctionD2)
879 lemmas [symmetric, rulify] = atomize_all atomize_imp
880 and [symmetric, defn] = atomize_all atomize_imp atomize_eq
883 subsubsection {* Atomizing elimination rules *}
885 setup AtomizeElim.setup
887 lemma atomize_exL[atomize_elim]: "(!!x. P x ==> Q) == ((EX x. P x) ==> Q)"
890 lemma atomize_conjL[atomize_elim]: "(A ==> B ==> C) == (A & B ==> C)"
893 lemma atomize_disjL[atomize_elim]: "((A ==> C) ==> (B ==> C) ==> C) == ((A | B ==> C) ==> C)"
896 lemma atomize_elimL[atomize_elim]: "(!!B. (A ==> B) ==> B) == Trueprop A" ..
899 subsection {* Package setup *}
901 subsubsection {* Classical Reasoner setup *}
903 lemma imp_elim: "P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R"
904 by (rule classical) iprover
906 lemma swap: "~ P ==> (~ R ==> P) ==> R"
907 by (rule classical) iprover
910 "\<And>X. \<lbrakk> x=x; PROP W \<rbrakk> \<Longrightarrow> PROP W" .
913 structure Hypsubst = HypsubstFun(
915 structure Simplifier = Simplifier
916 val dest_eq = HOLogic.dest_eq
917 val dest_Trueprop = HOLogic.dest_Trueprop
918 val dest_imp = HOLogic.dest_imp
919 val eq_reflection = @{thm eq_reflection}
920 val rev_eq_reflection = @{thm meta_eq_to_obj_eq}
921 val imp_intr = @{thm impI}
922 val rev_mp = @{thm rev_mp}
923 val subst = @{thm subst}
925 val thin_refl = @{thm thin_refl};
929 structure Classical = ClassicalFun(
931 val imp_elim = @{thm imp_elim}
932 val not_elim = @{thm notE}
933 val swap = @{thm swap}
934 val classical = @{thm classical}
935 val sizef = Drule.size_of_thm
936 val hyp_subst_tacs = [Hypsubst.hyp_subst_tac]
939 structure BasicClassical: BASIC_CLASSICAL = Classical;
942 ML_Context.value_antiq "claset"
943 (Scan.succeed ("claset", "Classical.local_claset_of (ML_Context.the_local_context ())"));
945 structure ResAtpset = NamedThmsFun(val name = "atp" val description = "ATP rules");
947 structure ResBlacklist = NamedThmsFun(val name = "noatp" val description = "Theorems blacklisted for ATP");
950 text {*ResBlacklist holds theorems blacklisted to sledgehammer.
951 These theorems typically produce clauses that are prolific (match too many equality or
952 membership literals) and relate to seldom-used facts. Some duplicate other rules.*}
956 (*prevent substitution on bool*)
957 fun hyp_subst_tac' i thm = if i <= Thm.nprems_of thm andalso
958 Term.exists_Const (fn ("op =", Type (_, [T, _])) => T <> Type ("bool", []) | _ => false)
959 (nth (Thm.prems_of thm) (i - 1)) then Hypsubst.hyp_subst_tac i thm else no_tac thm;
961 Hypsubst.hypsubst_setup
962 #> ContextRules.addSWrapper (fn tac => hyp_subst_tac' ORELSE' tac)
965 #> ResBlacklist.setup
969 declare iffI [intro!]
977 declare iffCE [elim!]
984 declare ex_ex1I [intro!]
986 and the_equality [intro]
992 ML {* val HOL_cs = @{claset} *}
994 lemma contrapos_np: "~ Q ==> (~ P ==> Q) ==> P"
996 apply (erule (1) meta_mp)
999 declare ex_ex1I [rule del, intro! 2]
1002 lemmas [intro?] = ext
1003 and [elim?] = ex1_implies_ex
1005 (*Better then ex1E for classical reasoner: needs no quantifier duplication!*)
1006 lemma alt_ex1E [elim!]:
1007 assumes major: "\<exists>!x. P x"
1008 and prem: "\<And>x. \<lbrakk> P x; \<forall>y y'. P y \<and> P y' \<longrightarrow> y = y' \<rbrakk> \<Longrightarrow> R"
1010 apply (rule ex1E [OF major])
1012 apply (tactic {* ares_tac @{thms allI} 1 *})+
1013 apply (tactic {* etac (Classical.dup_elim @{thm allE}) 1 *})
1018 structure Blast = BlastFun
1020 type claset = Classical.claset
1021 val equality_name = @{const_name "op ="}
1022 val not_name = @{const_name Not}
1023 val notE = @{thm notE}
1024 val ccontr = @{thm ccontr}
1025 val contr_tac = Classical.contr_tac
1026 val dup_intr = Classical.dup_intr
1027 val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac
1028 val claset = Classical.claset
1029 val rep_cs = Classical.rep_cs
1030 val cla_modifiers = Classical.cla_modifiers
1031 val cla_meth' = Classical.cla_meth'
1033 val Blast_tac = Blast.Blast_tac;
1034 val blast_tac = Blast.blast_tac;
1040 subsubsection {* Simplifier *}
1042 lemma eta_contract_eq: "(%s. f s) = f" ..
1045 shows not_not: "(~ ~ P) = P"
1046 and Not_eq_iff: "((~P) = (~Q)) = (P = Q)"
1048 "(P ~= Q) = (P = (~Q))"
1049 "(P | ~P) = True" "(~P | P) = True"
1051 and not_True_eq_False: "(\<not> True) = False"
1052 and not_False_eq_True: "(\<not> False) = True"
1054 "(~P) ~= P" "P ~= (~P)"
1056 and eq_True: "(P = True) = P"
1057 and "(False=P) = (~P)"
1058 and eq_False: "(P = False) = (\<not> P)"
1060 "(True --> P) = P" "(False --> P) = True"
1061 "(P --> True) = True" "(P --> P) = True"
1062 "(P --> False) = (~P)" "(P --> ~P) = (~P)"
1063 "(P & True) = P" "(True & P) = P"
1064 "(P & False) = False" "(False & P) = False"
1065 "(P & P) = P" "(P & (P & Q)) = (P & Q)"
1066 "(P & ~P) = False" "(~P & P) = False"
1067 "(P | True) = True" "(True | P) = True"
1068 "(P | False) = P" "(False | P) = P"
1069 "(P | P) = P" "(P | (P | Q)) = (P | Q)" and
1070 "(ALL x. P) = P" "(EX x. P) = P" "EX x. x=t" "EX x. t=x"
1071 -- {* needed for the one-point-rule quantifier simplification procs *}
1072 -- {* essential for termination!! *} and
1073 "!!P. (EX x. x=t & P(x)) = P(t)"
1074 "!!P. (EX x. t=x & P(x)) = P(t)"
1075 "!!P. (ALL x. x=t --> P(x)) = P(t)"
1076 "!!P. (ALL x. t=x --> P(x)) = P(t)"
1077 by (blast, blast, blast, blast, blast, iprover+)
1079 lemma disj_absorb: "(A | A) = A"
1082 lemma disj_left_absorb: "(A | (A | B)) = (A | B)"
1085 lemma conj_absorb: "(A & A) = A"
1088 lemma conj_left_absorb: "(A & (A & B)) = (A & B)"
1092 shows eq_commute: "(a=b) = (b=a)"
1093 and eq_left_commute: "(P=(Q=R)) = (Q=(P=R))"
1094 and eq_assoc: "((P=Q)=R) = (P=(Q=R))" by (iprover, blast+)
1095 lemma neq_commute: "(a~=b) = (b~=a)" by iprover
1098 shows conj_commute: "(P&Q) = (Q&P)"
1099 and conj_left_commute: "(P&(Q&R)) = (Q&(P&R))" by iprover+
1100 lemma conj_assoc: "((P&Q)&R) = (P&(Q&R))" by iprover
1102 lemmas conj_ac = conj_commute conj_left_commute conj_assoc
1105 shows disj_commute: "(P|Q) = (Q|P)"
1106 and disj_left_commute: "(P|(Q|R)) = (Q|(P|R))" by iprover+
1107 lemma disj_assoc: "((P|Q)|R) = (P|(Q|R))" by iprover
1109 lemmas disj_ac = disj_commute disj_left_commute disj_assoc
1111 lemma conj_disj_distribL: "(P&(Q|R)) = (P&Q | P&R)" by iprover
1112 lemma conj_disj_distribR: "((P|Q)&R) = (P&R | Q&R)" by iprover
1114 lemma disj_conj_distribL: "(P|(Q&R)) = ((P|Q) & (P|R))" by iprover
1115 lemma disj_conj_distribR: "((P&Q)|R) = ((P|R) & (Q|R))" by iprover
1117 lemma imp_conjR: "(P --> (Q&R)) = ((P-->Q) & (P-->R))" by iprover
1118 lemma imp_conjL: "((P&Q) -->R) = (P --> (Q --> R))" by iprover
1119 lemma imp_disjL: "((P|Q) --> R) = ((P-->R)&(Q-->R))" by iprover
1121 text {* These two are specialized, but @{text imp_disj_not1} is useful in @{text "Auth/Yahalom"}. *}
1122 lemma imp_disj_not1: "(P --> Q | R) = (~Q --> P --> R)" by blast
1123 lemma imp_disj_not2: "(P --> Q | R) = (~R --> P --> Q)" by blast
1125 lemma imp_disj1: "((P-->Q)|R) = (P--> Q|R)" by blast
1126 lemma imp_disj2: "(Q|(P-->R)) = (P--> Q|R)" by blast
1128 lemma imp_cong: "(P = P') ==> (P' ==> (Q = Q')) ==> ((P --> Q) = (P' --> Q'))"
1131 lemma de_Morgan_disj: "(~(P | Q)) = (~P & ~Q)" by iprover
1132 lemma de_Morgan_conj: "(~(P & Q)) = (~P | ~Q)" by blast
1133 lemma not_imp: "(~(P --> Q)) = (P & ~Q)" by blast
1134 lemma not_iff: "(P~=Q) = (P = (~Q))" by blast
1135 lemma disj_not1: "(~P | Q) = (P --> Q)" by blast
1136 lemma disj_not2: "(P | ~Q) = (Q --> P)" -- {* changes orientation :-( *}
1138 lemma imp_conv_disj: "(P --> Q) = ((~P) | Q)" by blast
1140 lemma iff_conv_conj_imp: "(P = Q) = ((P --> Q) & (Q --> P))" by iprover
1143 lemma cases_simp: "((P --> Q) & (~P --> Q)) = Q"
1144 -- {* Avoids duplication of subgoals after @{text split_if}, when the true and false *}
1145 -- {* cases boil down to the same thing. *}
1148 lemma not_all: "(~ (! x. P(x))) = (? x.~P(x))" by blast
1149 lemma imp_all: "((! x. P x) --> Q) = (? x. P x --> Q)" by blast
1150 lemma not_ex: "(~ (? x. P(x))) = (! x.~P(x))" by iprover
1151 lemma imp_ex: "((? x. P x) --> Q) = (! x. P x --> Q)" by iprover
1152 lemma all_not_ex: "(ALL x. P x) = (~ (EX x. ~ P x ))" by blast
1154 declare All_def [noatp]
1156 lemma ex_disj_distrib: "(? x. P(x) | Q(x)) = ((? x. P(x)) | (? x. Q(x)))" by iprover
1157 lemma all_conj_distrib: "(!x. P(x) & Q(x)) = ((! x. P(x)) & (! x. Q(x)))" by iprover
1160 \medskip The @{text "&"} congruence rule: not included by default!
1161 May slow rewrite proofs down by as much as 50\% *}
1164 "(P = P') ==> (P' ==> (Q = Q')) ==> ((P & Q) = (P' & Q'))"
1167 lemma rev_conj_cong:
1168 "(Q = Q') ==> (Q' ==> (P = P')) ==> ((P & Q) = (P' & Q'))"
1171 text {* The @{text "|"} congruence rule: not included by default! *}
1174 "(P = P') ==> (~P' ==> (Q = Q')) ==> ((P | Q) = (P' | Q'))"
1178 text {* \medskip if-then-else rules *}
1180 lemma if_True: "(if True then x else y) = x"
1181 by (unfold if_def) blast
1183 lemma if_False: "(if False then x else y) = y"
1184 by (unfold if_def) blast
1186 lemma if_P: "P ==> (if P then x else y) = x"
1187 by (unfold if_def) blast
1189 lemma if_not_P: "~P ==> (if P then x else y) = y"
1190 by (unfold if_def) blast
1192 lemma split_if: "P (if Q then x else y) = ((Q --> P(x)) & (~Q --> P(y)))"
1193 apply (rule case_split [of Q])
1194 apply (simplesubst if_P)
1195 prefer 3 apply (simplesubst if_not_P, blast+)
1198 lemma split_if_asm: "P (if Q then x else y) = (~((Q & ~P x) | (~Q & ~P y)))"
1199 by (simplesubst split_if, blast)
1201 lemmas if_splits [noatp] = split_if split_if_asm
1203 lemma if_cancel: "(if c then x else x) = x"
1204 by (simplesubst split_if, blast)
1206 lemma if_eq_cancel: "(if x = y then y else x) = x"
1207 by (simplesubst split_if, blast)
1209 lemma if_bool_eq_conj: "(if P then Q else R) = ((P-->Q) & (~P-->R))"
1210 -- {* This form is useful for expanding @{text "if"}s on the RIGHT of the @{text "==>"} symbol. *}
1213 lemma if_bool_eq_disj: "(if P then Q else R) = ((P&Q) | (~P&R))"
1214 -- {* And this form is useful for expanding @{text "if"}s on the LEFT. *}
1215 apply (simplesubst split_if, blast)
1218 lemma Eq_TrueI: "P ==> P == True" by (unfold atomize_eq) iprover
1219 lemma Eq_FalseI: "~P ==> P == False" by (unfold atomize_eq) iprover
1221 text {* \medskip let rules for simproc *}
1223 lemma Let_folded: "f x \<equiv> g x \<Longrightarrow> Let x f \<equiv> Let x g"
1226 lemma Let_unfold: "f x \<equiv> g \<Longrightarrow> Let x f \<equiv> g"
1230 The following copy of the implication operator is useful for
1231 fine-tuning congruence rules. It instructs the simplifier to simplify
1236 simp_implies :: "[prop, prop] => prop" (infixr "=simp=>" 1)
1237 [code func del]: "simp_implies \<equiv> op ==>"
1239 lemma simp_impliesI:
1240 assumes PQ: "(PROP P \<Longrightarrow> PROP Q)"
1241 shows "PROP P =simp=> PROP Q"
1242 apply (unfold simp_implies_def)
1247 lemma simp_impliesE:
1248 assumes PQ: "PROP P =simp=> PROP Q"
1250 and QR: "PROP Q \<Longrightarrow> PROP R"
1253 apply (rule PQ [unfolded simp_implies_def])
1257 lemma simp_implies_cong:
1258 assumes PP' :"PROP P == PROP P'"
1259 and P'QQ': "PROP P' ==> (PROP Q == PROP Q')"
1260 shows "(PROP P =simp=> PROP Q) == (PROP P' =simp=> PROP Q')"
1261 proof (unfold simp_implies_def, rule equal_intr_rule)
1262 assume PQ: "PROP P \<Longrightarrow> PROP Q"
1264 from PP' [symmetric] and P' have "PROP P"
1265 by (rule equal_elim_rule1)
1266 then have "PROP Q" by (rule PQ)
1267 with P'QQ' [OF P'] show "PROP Q'" by (rule equal_elim_rule1)
1269 assume P'Q': "PROP P' \<Longrightarrow> PROP Q'"
1271 from PP' and P have P': "PROP P'" by (rule equal_elim_rule1)
1272 then have "PROP Q'" by (rule P'Q')
1273 with P'QQ' [OF P', symmetric] show "PROP Q"
1274 by (rule equal_elim_rule1)
1278 assumes "P \<longrightarrow> Q \<longrightarrow> R"
1279 shows "P \<and> Q \<longrightarrow> R"
1280 using assms by blast
1283 assumes "\<And>x. P x = Q x"
1284 shows "(\<forall>x. P x) = (\<forall>x. Q x)"
1285 using assms by blast
1288 assumes "\<And>x. P x = Q x"
1289 shows "(\<exists>x. P x) = (\<exists>x. Q x)"
1290 using assms by blast
1293 "(\<forall>x y. P x y) = (\<forall>y x. P x y)"
1297 "(\<exists>x y. P x y) = (\<exists>y x. P x y)"
1301 ML {* open Simpdata *}
1304 Simplifier.method_setup Splitter.split_modifiers
1305 #> Simplifier.map_simpset (K Simpdata.simpset_simprocs)
1311 text {* Simproc for proving @{text "(y = x) == False"} from premise @{text "~(x = y)"}: *}
1313 simproc_setup neq ("x = y") = {* fn _ =>
1315 val neq_to_EQ_False = @{thm not_sym} RS @{thm Eq_FalseI};
1316 fun is_neq eq lhs rhs thm =
1317 (case Thm.prop_of thm of
1318 _ $ (Not $ (eq' $ l' $ r')) =>
1319 Not = HOLogic.Not andalso eq' = eq andalso
1320 r' aconv lhs andalso l' aconv rhs
1323 (case Thm.term_of ct of
1325 (case find_first (is_neq eq lhs rhs) (Simplifier.prems_of_ss ss) of
1326 SOME thm => SOME (thm RS neq_to_EQ_False)
1332 simproc_setup let_simp ("Let x f") = {*
1334 val (f_Let_unfold, x_Let_unfold) =
1335 let val [(_$(f$x)$_)] = prems_of @{thm Let_unfold}
1336 in (cterm_of @{theory} f, cterm_of @{theory} x) end
1337 val (f_Let_folded, x_Let_folded) =
1338 let val [(_$(f$x)$_)] = prems_of @{thm Let_folded}
1339 in (cterm_of @{theory} f, cterm_of @{theory} x) end;
1341 let val [(_$_$(g$_))] = prems_of @{thm Let_folded} in cterm_of @{theory} g end;
1345 val ctxt = Simplifier.the_context ss;
1346 val thy = ProofContext.theory_of ctxt;
1347 val t = Thm.term_of ct;
1348 val ([t'], ctxt') = Variable.import_terms false [t] ctxt;
1349 in Option.map (hd o Variable.export ctxt' ctxt o single)
1350 (case t' of Const ("Let",_) $ x $ f => (* x and f are already in normal form *)
1351 if is_Free x orelse is_Bound x orelse is_Const x
1352 then SOME @{thm Let_def}
1355 val n = case f of (Abs (x,_,_)) => x | _ => "x";
1356 val cx = cterm_of thy x;
1357 val {T=xT,...} = rep_cterm cx;
1358 val cf = cterm_of thy f;
1359 val fx_g = Simplifier.rewrite ss (Thm.capply cf cx);
1360 val (_$_$g) = prop_of fx_g;
1361 val g' = abstract_over (x,g);
1366 cterm_instantiate [(f_Let_unfold,cf),(x_Let_unfold,cx)] @{thm Let_unfold};
1367 in SOME (rl OF [fx_g]) end
1368 else if Term.betapply (f,x) aconv g then NONE (*avoid identity conversion*)
1370 val abs_g'= Abs (n,xT,g');
1372 val g_g'x = symmetric (beta_conversion false (cterm_of thy g'x));
1373 val rl = cterm_instantiate
1374 [(f_Let_folded,cterm_of thy f),(x_Let_folded,cx),
1375 (g_Let_folded,cterm_of thy abs_g')]
1377 in SOME (rl OF [transitive fx_g g_g'x])
1385 lemma True_implies_equals: "(True \<Longrightarrow> PROP P) \<equiv> PROP P"
1387 assume "True \<Longrightarrow> PROP P"
1388 from this [OF TrueI] show "PROP P" .
1391 then show "PROP P" .
1395 "!!P Q. (EX x. P x & Q) = ((EX x. P x) & Q)"
1396 "!!P Q. (EX x. P & Q x) = (P & (EX x. Q x))"
1397 "!!P Q. (EX x. P x | Q) = ((EX x. P x) | Q)"
1398 "!!P Q. (EX x. P | Q x) = (P | (EX x. Q x))"
1399 "!!P Q. (EX x. P x --> Q) = ((ALL x. P x) --> Q)"
1400 "!!P Q. (EX x. P --> Q x) = (P --> (EX x. Q x))"
1401 -- {* Miniscoping: pushing in existential quantifiers. *}
1402 by (iprover | blast)+
1405 "!!P Q. (ALL x. P x & Q) = ((ALL x. P x) & Q)"
1406 "!!P Q. (ALL x. P & Q x) = (P & (ALL x. Q x))"
1407 "!!P Q. (ALL x. P x | Q) = ((ALL x. P x) | Q)"
1408 "!!P Q. (ALL x. P | Q x) = (P | (ALL x. Q x))"
1409 "!!P Q. (ALL x. P x --> Q) = ((EX x. P x) --> Q)"
1410 "!!P Q. (ALL x. P --> Q x) = (P --> (ALL x. Q x))"
1411 -- {* Miniscoping: pushing in universal quantifiers. *}
1412 by (iprover | blast)+
1415 triv_forall_equality (*prunes params*)
1416 True_implies_equals (*prune asms `True'*)
1422 (*In general it seems wrong to add distributive laws by default: they
1423 might cause exponential blow-up. But imp_disjL has been in for a while
1424 and cannot be removed without affecting existing proofs. Moreover,
1425 rewriting by "(P|Q --> R) = ((P-->R)&(Q-->R))" might be justified on the
1426 grounds that it allows simplification of R in the two cases.*)
1444 lemmas [cong] = imp_cong simp_implies_cong
1445 lemmas [split] = split_if
1447 ML {* val HOL_ss = @{simpset} *}
1449 text {* Simplifies x assuming c and y assuming ~c *}
1452 and "c \<Longrightarrow> x = u"
1453 and "\<not> c \<Longrightarrow> y = v"
1454 shows "(if b then x else y) = (if c then u else v)"
1455 unfolding if_def using assms by simp
1457 text {* Prevents simplification of x and y:
1458 faster and allows the execution of functional programs. *}
1459 lemma if_weak_cong [cong]:
1461 shows "(if b then x else y) = (if c then x else y)"
1462 using assms by (rule arg_cong)
1464 text {* Prevents simplification of t: much faster *}
1465 lemma let_weak_cong:
1467 shows "(let x = a in t x) = (let x = b in t x)"
1468 using assms by (rule arg_cong)
1470 text {* To tidy up the result of a simproc. Only the RHS will be simplified. *}
1473 shows "(t \<equiv> u) \<equiv> (t \<equiv> u')"
1477 "f (if c then x else y) = (if c then f x else f y)"
1480 text {* This lemma restricts the effect of the rewrite rule u=v to the left-hand
1481 side of an equality. Used in @{text "{Integ,Real}/simproc.ML"} *}
1482 lemma restrict_to_left:
1484 shows "(x = z) = (y = z)"
1488 subsubsection {* Generic cases and induction *}
1490 text {* Rule projections: *}
1493 structure ProjectRule = ProjectRuleFun
1495 val conjunct1 = @{thm conjunct1};
1496 val conjunct2 = @{thm conjunct2};
1502 induct_forall where "induct_forall P == \<forall>x. P x"
1503 induct_implies where "induct_implies A B == A \<longrightarrow> B"
1504 induct_equal where "induct_equal x y == x = y"
1505 induct_conj where "induct_conj A B == A \<and> B"
1507 lemma induct_forall_eq: "(!!x. P x) == Trueprop (induct_forall (\<lambda>x. P x))"
1508 by (unfold atomize_all induct_forall_def)
1510 lemma induct_implies_eq: "(A ==> B) == Trueprop (induct_implies A B)"
1511 by (unfold atomize_imp induct_implies_def)
1513 lemma induct_equal_eq: "(x == y) == Trueprop (induct_equal x y)"
1514 by (unfold atomize_eq induct_equal_def)
1516 lemma induct_conj_eq:
1517 includes meta_conjunction_syntax
1518 shows "(A && B) == Trueprop (induct_conj A B)"
1519 by (unfold atomize_conj induct_conj_def)
1521 lemmas induct_atomize = induct_forall_eq induct_implies_eq induct_equal_eq induct_conj_eq
1522 lemmas induct_rulify [symmetric, standard] = induct_atomize
1523 lemmas induct_rulify_fallback =
1524 induct_forall_def induct_implies_def induct_equal_def induct_conj_def
1527 lemma induct_forall_conj: "induct_forall (\<lambda>x. induct_conj (A x) (B x)) =
1528 induct_conj (induct_forall A) (induct_forall B)"
1529 by (unfold induct_forall_def induct_conj_def) iprover
1531 lemma induct_implies_conj: "induct_implies C (induct_conj A B) =
1532 induct_conj (induct_implies C A) (induct_implies C B)"
1533 by (unfold induct_implies_def induct_conj_def) iprover
1535 lemma induct_conj_curry: "(induct_conj A B ==> PROP C) == (A ==> B ==> PROP C)"
1537 assume r: "induct_conj A B ==> PROP C" and A B
1538 show "PROP C" by (rule r) (simp add: induct_conj_def `A` `B`)
1540 assume r: "A ==> B ==> PROP C" and "induct_conj A B"
1541 show "PROP C" by (rule r) (simp_all add: `induct_conj A B` [unfolded induct_conj_def])
1544 lemmas induct_conj = induct_forall_conj induct_implies_conj induct_conj_curry
1546 hide const induct_forall induct_implies induct_equal induct_conj
1548 text {* Method setup. *}
1551 structure Induct = InductFun
1553 val cases_default = @{thm case_split}
1554 val atomize = @{thms induct_atomize}
1555 val rulify = @{thms induct_rulify}
1556 val rulify_fallback = @{thms induct_rulify_fallback}
1563 subsection {* Other simple lemmas and lemma duplicates *}
1565 lemma Let_0 [simp]: "Let 0 f = f 0"
1566 unfolding Let_def ..
1568 lemma Let_1 [simp]: "Let 1 f = f 1"
1569 unfolding Let_def ..
1571 lemma ex1_eq [iff]: "EX! x. x = t" "EX! x. t = x"
1574 lemma choice_eq: "(ALL x. EX! y. P x y) = (EX! f. ALL x. P x (f x))"
1576 apply (rule_tac a = "%x. THE y. P x y" in ex1I)
1577 apply (fast dest!: theI')
1578 apply (fast intro: ext the1_equality [symmetric])
1583 apply (erule_tac x = "%z. if z = x then y else f z" in allE)
1586 apply (rule_tac P = "xa = x" in case_split_thm)
1587 apply (drule_tac [3] x = x in fun_cong, simp_all)
1590 lemma mk_left_commute:
1591 fixes f (infix "\<otimes>" 60)
1592 assumes a: "\<And>x y z. (x \<otimes> y) \<otimes> z = x \<otimes> (y \<otimes> z)" and
1593 c: "\<And>x y. x \<otimes> y = y \<otimes> x"
1594 shows "x \<otimes> (y \<otimes> z) = y \<otimes> (x \<otimes> z)"
1595 by (rule trans [OF trans [OF c a] arg_cong [OF c, of "f y"]])
1597 lemmas eq_sym_conv = eq_commute
1600 "(\<not>(P \<and> Q)) = (\<not> P \<or> \<not> Q)" "(\<not> (P \<or> Q)) = (\<not> P \<and> \<not>Q)" "(P \<longrightarrow> Q) = (\<not>P \<or> Q)"
1601 "(P = Q) = ((P \<and> Q) \<or> (\<not>P \<and> \<not> Q))" "(\<not>(P = Q)) = ((P \<and> \<not> Q) \<or> (\<not>P \<and> Q))"
1602 "(\<not> \<not>(P)) = P"
1606 subsection {* Basic ML bindings *}
1609 val FalseE = @{thm FalseE}
1610 val Let_def = @{thm Let_def}
1611 val TrueI = @{thm TrueI}
1612 val allE = @{thm allE}
1613 val allI = @{thm allI}
1614 val all_dupE = @{thm all_dupE}
1615 val arg_cong = @{thm arg_cong}
1616 val box_equals = @{thm box_equals}
1617 val ccontr = @{thm ccontr}
1618 val classical = @{thm classical}
1619 val conjE = @{thm conjE}
1620 val conjI = @{thm conjI}
1621 val conjunct1 = @{thm conjunct1}
1622 val conjunct2 = @{thm conjunct2}
1623 val disjCI = @{thm disjCI}
1624 val disjE = @{thm disjE}
1625 val disjI1 = @{thm disjI1}
1626 val disjI2 = @{thm disjI2}
1627 val eq_reflection = @{thm eq_reflection}
1628 val ex1E = @{thm ex1E}
1629 val ex1I = @{thm ex1I}
1630 val ex1_implies_ex = @{thm ex1_implies_ex}
1631 val exE = @{thm exE}
1632 val exI = @{thm exI}
1633 val excluded_middle = @{thm excluded_middle}
1634 val ext = @{thm ext}
1635 val fun_cong = @{thm fun_cong}
1636 val iffD1 = @{thm iffD1}
1637 val iffD2 = @{thm iffD2}
1638 val iffI = @{thm iffI}
1639 val impE = @{thm impE}
1640 val impI = @{thm impI}
1641 val meta_eq_to_obj_eq = @{thm meta_eq_to_obj_eq}
1643 val notE = @{thm notE}
1644 val notI = @{thm notI}
1645 val not_all = @{thm not_all}
1646 val not_ex = @{thm not_ex}
1647 val not_iff = @{thm not_iff}
1648 val not_not = @{thm not_not}
1649 val not_sym = @{thm not_sym}
1650 val refl = @{thm refl}
1651 val rev_mp = @{thm rev_mp}
1652 val spec = @{thm spec}
1653 val ssubst = @{thm ssubst}
1654 val subst = @{thm subst}
1655 val sym = @{thm sym}
1656 val trans = @{thm trans}
1660 subsection {* Code generator basic setup -- see further @{text Code_Setup.thy} *}
1662 setup "CodeName.setup #> CodeTarget.setup #> Nbe.setup"
1664 code_datatype Trueprop "prop"
1666 code_datatype "TYPE('a\<Colon>{})"
1668 lemma Let_case_cert:
1669 assumes "CASE \<equiv> (\<lambda>x. Let x f)"
1670 shows "CASE x \<equiv> f x"
1671 using assms by simp_all
1674 includes meta_conjunction_syntax
1675 assumes "CASE \<equiv> (\<lambda>b. If b f g)"
1676 shows "(CASE True \<equiv> f) && (CASE False \<equiv> g)"
1677 using assms by simp_all
1680 Code.add_case @{thm Let_case_cert}
1681 #> Code.add_case @{thm If_case_cert}
1682 #> Code.add_undefined @{const_name undefined}
1686 fixes eq :: "'a \<Rightarrow> 'a \<Rightarrow> bool"
1687 assumes eq: "eq x y \<longleftrightarrow> x = y "
1690 lemma equals_eq [code inline, code func]: "op = \<equiv> eq"
1691 by (rule eq_reflection) (rule ext, rule ext, rule sym, rule eq)
1693 declare equals_eq [symmetric, code post]
1697 hide (open) const eq
1701 CodeUnit.add_const_alias @{thm equals_eq}
1705 shows "False \<and> x \<longleftrightarrow> False"
1706 and "True \<and> x \<longleftrightarrow> x"
1707 and "x \<and> False \<longleftrightarrow> False"
1708 and "x \<and> True \<longleftrightarrow> x" by simp_all
1711 shows "False \<or> x \<longleftrightarrow> x"
1712 and "True \<or> x \<longleftrightarrow> True"
1713 and "x \<or> False \<longleftrightarrow> x"
1714 and "x \<or> True \<longleftrightarrow> True" by simp_all
1717 shows "\<not> True \<longleftrightarrow> False"
1718 and "\<not> False \<longleftrightarrow> True" by (rule HOL.simp_thms)+
1722 subsection {* Legacy tactics and ML bindings *}
1725 fun strip_tac i = REPEAT (resolve_tac [impI, allI] i);
1727 (* combination of (spec RS spec RS ...(j times) ... spec RS mp) *)
1729 fun wrong_prem (Const ("All", _) $ (Abs (_, _, t))) = wrong_prem t
1730 | wrong_prem (Bound _) = true
1731 | wrong_prem _ = false;
1732 val filter_right = filter (not o wrong_prem o HOLogic.dest_Trueprop o hd o Thm.prems_of);
1734 fun smp i = funpow i (fn m => filter_right ([spec] RL m)) ([mp]);
1735 fun smp_tac j = EVERY'[dresolve_tac (smp j), atac];
1738 val all_conj_distrib = thm "all_conj_distrib";
1739 val all_simps = thms "all_simps";
1740 val atomize_not = thm "atomize_not";
1741 val case_split = thm "case_split";
1742 val case_split_thm = thm "case_split_thm"
1743 val cases_simp = thm "cases_simp";
1744 val choice_eq = thm "choice_eq"
1745 val cong = thm "cong"
1746 val conj_comms = thms "conj_comms";
1747 val conj_cong = thm "conj_cong";
1748 val de_Morgan_conj = thm "de_Morgan_conj";
1749 val de_Morgan_disj = thm "de_Morgan_disj";
1750 val disj_assoc = thm "disj_assoc";
1751 val disj_comms = thms "disj_comms";
1752 val disj_cong = thm "disj_cong";
1753 val eq_ac = thms "eq_ac";
1754 val eq_cong2 = thm "eq_cong2"
1755 val Eq_FalseI = thm "Eq_FalseI";
1756 val Eq_TrueI = thm "Eq_TrueI";
1757 val Ex1_def = thm "Ex1_def"
1758 val ex_disj_distrib = thm "ex_disj_distrib";
1759 val ex_simps = thms "ex_simps";
1760 val if_cancel = thm "if_cancel";
1761 val if_eq_cancel = thm "if_eq_cancel";
1762 val if_False = thm "if_False";
1763 val iff_conv_conj_imp = thm "iff_conv_conj_imp";
1765 val if_splits = thms "if_splits";
1766 val if_True = thm "if_True";
1767 val if_weak_cong = thm "if_weak_cong"
1768 val imp_all = thm "imp_all";
1769 val imp_cong = thm "imp_cong";
1770 val imp_conjL = thm "imp_conjL";
1771 val imp_conjR = thm "imp_conjR";
1772 val imp_conv_disj = thm "imp_conv_disj";
1773 val simp_implies_def = thm "simp_implies_def";
1774 val simp_thms = thms "simp_thms";
1775 val split_if = thm "split_if";
1776 val the1_equality = thm "the1_equality"
1777 val theI = thm "theI"
1778 val theI' = thm "theI'"
1779 val True_implies_equals = thm "True_implies_equals";
1780 val nnf_conv = Simplifier.rewrite (HOL_basic_ss addsimps simp_thms @ @{thms "nnf_simps"})