src/HOL/HOL.thy
author wenzelm
Sun, 19 Jul 2015 00:03:10 +0200
changeset 60759 36d9f215c982
parent 60758 d8d85a8172b5
child 60761 a443b08281e2
permissions -rw-r--r--
more symbols;
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     1
(*  Title:      HOL/HOL.thy
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     2
    Author:     Tobias Nipkow, Markus Wenzel, and Larry Paulson
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
     3
*)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     4
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
     5
section \<open>The basis of Higher-Order Logic\<close>
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
     6
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15103
diff changeset
     7
theory HOL
30929
d9343c0aac11 code generator bootstrap theory src/Tools/Code_Generator.thy
haftmann
parents: 30927
diff changeset
     8
imports Pure "~~/src/Tools/Code_Generator"
46950
d0181abdbdac declare command keywords via theory header, including strict checking outside Pure;
wenzelm
parents: 46497
diff changeset
     9
keywords
52432
c03090937c3b tuned message -- more markup;
wenzelm
parents: 52230
diff changeset
    10
  "try" "solve_direct" "quickcheck" "print_coercions" "print_claset"
c03090937c3b tuned message -- more markup;
wenzelm
parents: 52230
diff changeset
    11
    "print_induct_rules" :: diag and
47657
1ba213363d0c moved modules with only vague relation to the code generator to theory HOL rather than theory Code_Generator
haftmann
parents: 46973
diff changeset
    12
  "quickcheck_params" :: thy_decl
15131
c69542757a4d New theory header syntax.
nipkow
parents: 15103
diff changeset
    13
begin
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    14
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    15
ML_file "~~/src/Tools/misc_legacy.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    16
ML_file "~~/src/Tools/try.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    17
ML_file "~~/src/Tools/quickcheck.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    18
ML_file "~~/src/Tools/solve_direct.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    19
ML_file "~~/src/Tools/IsaPlanner/zipper.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    20
ML_file "~~/src/Tools/IsaPlanner/isand.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    21
ML_file "~~/src/Tools/IsaPlanner/rw_inst.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    22
ML_file "~~/src/Provers/hypsubst.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    23
ML_file "~~/src/Provers/splitter.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    24
ML_file "~~/src/Provers/classical.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    25
ML_file "~~/src/Provers/blast.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    26
ML_file "~~/src/Provers/clasimp.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    27
ML_file "~~/src/Tools/eqsubst.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    28
ML_file "~~/src/Provers/quantifier1.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    29
ML_file "~~/src/Tools/atomize_elim.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    30
ML_file "~~/src/Tools/cong_tac.ML"
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
    31
ML_file "~~/src/Tools/intuitionistic.ML" setup \<open>Intuitionistic.method_setup @{binding iprover}\<close>
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    32
ML_file "~~/src/Tools/project_rule.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    33
ML_file "~~/src/Tools/subtyping.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    34
ML_file "~~/src/Tools/case_product.ML"
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
    35
30165
6ee87f67d9cd moved generic intuitionistic prover to src/Tools/intuitionistic.ML;
wenzelm
parents: 30160
diff changeset
    36
58659
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    37
ML \<open>Plugin_Name.declare_setup @{binding extraction}\<close>
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    38
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    39
ML \<open>
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    40
  Plugin_Name.declare_setup @{binding quickcheck_random};
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    41
  Plugin_Name.declare_setup @{binding quickcheck_exhaustive};
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    42
  Plugin_Name.declare_setup @{binding quickcheck_bounded_forall};
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    43
  Plugin_Name.declare_setup @{binding quickcheck_full_exhaustive};
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    44
  Plugin_Name.declare_setup @{binding quickcheck_narrowing};
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    45
\<close>
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    46
ML \<open>
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    47
  Plugin_Name.define_setup @{binding quickcheck}
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    48
   [@{plugin quickcheck_exhaustive},
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    49
    @{plugin quickcheck_random},
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    50
    @{plugin quickcheck_bounded_forall},
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    51
    @{plugin quickcheck_full_exhaustive},
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    52
    @{plugin quickcheck_narrowing}]
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    53
\<close>
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    54
6c9821c32dd5 Local_Interpretation is superseded by Plugin with formal Plugin_Name management, avoiding undeclared strings;
wenzelm
parents: 57964
diff changeset
    55
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
    56
subsection \<open>Primitive logic\<close>
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    57
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
    58
subsubsection \<open>Core syntax\<close>
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    59
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
    60
setup \<open>Axclass.class_axiomatization (@{binding type}, [])\<close>
36452
d37c6eed8117 renamed command 'defaultsort' to 'default_sort';
wenzelm
parents: 36365
diff changeset
    61
default_sort type
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
    62
setup \<open>Object_Logic.add_base_sort @{sort type}\<close>
25460
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    63
55383
a416780523e2 more explicit axiomatization;
wenzelm
parents: 55239
diff changeset
    64
axiomatization where fun_arity: "OFCLASS('a \<Rightarrow> 'b, type_class)"
a416780523e2 more explicit axiomatization;
wenzelm
parents: 55239
diff changeset
    65
instance "fun" :: (type, type) type by (rule fun_arity)
a416780523e2 more explicit axiomatization;
wenzelm
parents: 55239
diff changeset
    66
a416780523e2 more explicit axiomatization;
wenzelm
parents: 55239
diff changeset
    67
axiomatization where itself_arity: "OFCLASS('a itself, type_class)"
a416780523e2 more explicit axiomatization;
wenzelm
parents: 55239
diff changeset
    68
instance itself :: (type) type by (rule itself_arity)
25460
b80087af2274 interpretation of typedecls: instantiation to class type
haftmann
parents: 25388
diff changeset
    69
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    70
typedecl bool
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    71
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    72
judgment
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    73
  Trueprop      :: "bool \<Rightarrow> prop"                   ("(_)" 5)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    74
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
    75
axiomatization
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    76
  implies       :: "[bool, bool] \<Rightarrow> bool"           (infixr "-->" 25)  and
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    77
  eq            :: "['a, 'a] \<Rightarrow> bool"               (infixl "=" 50)  and
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    78
  The           :: "('a \<Rightarrow> bool) \<Rightarrow> 'a"
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
    79
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
    80
consts
7357
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    81
  True          :: bool
d0e16da40ea2 proper bootstrap of HOL theory and packages;
wenzelm
parents: 7238
diff changeset
    82
  False         :: bool
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    83
  Not           :: "bool \<Rightarrow> bool"                   ("~ _" [40] 40)
38795
848be46708dc formerly unnamed infix conjunction and disjunction now named HOL.conj and HOL.disj
haftmann
parents: 38786
diff changeset
    84
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    85
  conj          :: "[bool, bool] \<Rightarrow> bool"           (infixr "&" 35)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    86
  disj          :: "[bool, bool] \<Rightarrow> bool"           (infixr "|" 30)
38555
bd6359ed1636 deglobalized named HOL constants
haftmann
parents: 38547
diff changeset
    87
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    88
  All           :: "('a \<Rightarrow> bool) \<Rightarrow> bool"           (binder "ALL " 10)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    89
  Ex            :: "('a \<Rightarrow> bool) \<Rightarrow> bool"           (binder "EX " 10)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    90
  Ex1           :: "('a \<Rightarrow> bool) \<Rightarrow> bool"           (binder "EX! " 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
    91
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    92
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
    93
subsubsection \<open>Additional concrete syntax\<close>
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
    94
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
    95
notation (output)
38864
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38857
diff changeset
    96
  eq  (infix "=" 50)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    97
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
    98
abbreviation
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
    99
  not_equal :: "['a, 'a] \<Rightarrow> bool"  (infixl "~=" 50) where
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   100
  "x ~= y \<equiv> ~ (x = y)"
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   101
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
   102
notation (output)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   103
  not_equal  (infix "~=" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   104
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
   105
notation (xsymbols)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
   106
  Not  ("\<not> _" [40] 40) and
38864
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38857
diff changeset
   107
  conj  (infixr "\<and>" 35) and
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38857
diff changeset
   108
  disj  (infixr "\<or>" 30) and
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38857
diff changeset
   109
  implies  (infixr "\<longrightarrow>" 25) and
50360
628b37b9e8a2 \<noteq> now has the same associativity as ~= and =
nipkow
parents: 49339
diff changeset
   110
  not_equal  (infixl "\<noteq>" 50)
628b37b9e8a2 \<noteq> now has the same associativity as ~= and =
nipkow
parents: 49339
diff changeset
   111
628b37b9e8a2 \<noteq> now has the same associativity as ~= and =
nipkow
parents: 49339
diff changeset
   112
notation (xsymbols output)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   113
  not_equal  (infix "\<noteq>" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   114
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
   115
notation (HTML output)
21404
eb85850d3eb7 more robust syntax for definition/abbreviation/notation;
wenzelm
parents: 21250
diff changeset
   116
  Not  ("\<not> _" [40] 40) and
38864
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38857
diff changeset
   117
  conj  (infixr "\<and>" 35) and
4abe644fcea5 formerly unnamed infix equality now named HOL.eq
haftmann
parents: 38857
diff changeset
   118
  disj  (infixr "\<or>" 30) and
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   119
  not_equal  (infix "\<noteq>" 50)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   120
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   121
abbreviation (iff)
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   122
  iff :: "[bool, bool] \<Rightarrow> bool"  (infixr "<->" 25) where
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   123
  "A <-> B \<equiv> A = B"
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   124
21210
c17fd2df4e9e renamed 'const_syntax' to 'notation';
wenzelm
parents: 21179
diff changeset
   125
notation (xsymbols)
19656
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   126
  iff  (infixr "\<longleftrightarrow>" 25)
09be06943252 tuned concrete syntax -- abbreviation/const_syntax;
wenzelm
parents: 19607
diff changeset
   127
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   128
syntax "_The" :: "[pttrn, bool] \<Rightarrow> 'a"  ("(3THE _./ _)" [0, 10] 10)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   129
translations "THE x. P" \<rightleftharpoons> "CONST The (\<lambda>x. P)"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   130
print_translation \<open>
52143
36ffe23b25f8 syntax translations always depend on context;
wenzelm
parents: 51798
diff changeset
   131
  [(@{const_syntax The}, fn _ => fn [Abs abs] =>
46125
00cd193a48dc improved case syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 45654
diff changeset
   132
      let val (x, t) = Syntax_Trans.atomic_abs_tr' abs
00cd193a48dc improved case syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 45654
diff changeset
   133
      in Syntax.const @{syntax_const "_The"} $ x $ t end)]
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   134
\<close>  -- \<open>To avoid eta-contraction of body\<close>
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   135
46125
00cd193a48dc improved case syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 45654
diff changeset
   136
nonterminal letbinds and letbind
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   137
syntax
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   138
  "_bind"       :: "[pttrn, 'a] \<Rightarrow> letbind"              ("(2_ =/ _)" 10)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   139
  ""            :: "letbind \<Rightarrow> letbinds"                 ("_")
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   140
  "_binds"      :: "[letbind, letbinds] \<Rightarrow> letbinds"     ("_;/ _")
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   141
  "_Let"        :: "[letbinds, 'a] \<Rightarrow> 'a"                ("(let (_)/ in (_))" [0, 10] 10)
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   142
46125
00cd193a48dc improved case syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 45654
diff changeset
   143
nonterminal case_syn and cases_syn
00cd193a48dc improved case syntax: more careful treatment of position constraints, which enables PIDE markup;
wenzelm
parents: 45654
diff changeset
   144
syntax
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   145
  "_case_syntax" :: "['a, cases_syn] \<Rightarrow> 'b"  ("(case _ of/ _)" 10)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   146
  "_case1" :: "['a, 'b] \<Rightarrow> case_syn"  ("(2_ =>/ _)" 10)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   147
  "" :: "case_syn \<Rightarrow> cases_syn"  ("_")
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   148
  "_case2" :: "[case_syn, cases_syn] \<Rightarrow> cases_syn"  ("_/ | _")
42057
3eba96ff3d3e more selective strip_positions in case patterns -- reactivate translations based on "case _ of _" in HOL and special patterns in HOLCF;
wenzelm
parents: 41865
diff changeset
   149
syntax (xsymbols)
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   150
  "_case1" :: "['a, 'b] \<Rightarrow> case_syn"  ("(2_ \<Rightarrow>/ _)" 10)
13763
f94b569cd610 added print translations tha avoid eta contraction for important binders.
nipkow
parents: 13723
diff changeset
   151
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   152
notation (xsymbols)
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   153
  All  (binder "\<forall>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   154
  Ex  (binder "\<exists>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   155
  Ex1  (binder "\<exists>!" 10)
2372
a2999e19703b fixed alternative quantifier symbol syntax;
wenzelm
parents: 2368
diff changeset
   156
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   157
notation (HTML output)
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   158
  All  (binder "\<forall>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   159
  Ex  (binder "\<exists>" 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   160
  Ex1  (binder "\<exists>!" 10)
6340
7d5cbd5819a0 HTML output;
wenzelm
parents: 6289
diff changeset
   161
21524
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   162
notation (HOL)
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   163
  All  (binder "! " 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   164
  Ex  (binder "? " 10) and
7843e2fd14a9 updated (binder) syntax/notation;
wenzelm
parents: 21504
diff changeset
   165
  Ex1  (binder "?! " 10)
7238
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   166
36e58620ffc8 replaced HOL_quantifiers flag by "HOL" print mode;
wenzelm
parents: 7220
diff changeset
   167
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   168
subsubsection \<open>Axioms and basic definitions\<close>
2260
b59781f2b809 added symbols syntax;
wenzelm
parents: 1674
diff changeset
   169
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   170
axiomatization where
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   171
  refl: "t = (t::'a)" and
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   172
  subst: "s = t \<Longrightarrow> P s \<Longrightarrow> P t" and
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   173
  ext: "(\<And>x::'a. (f x ::'b) = g x) \<Longrightarrow> (\<lambda>x. f x) = (\<lambda>x. g x)"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   174
    -- \<open>Extensionality is built into the meta-logic, and this rule expresses
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   175
         a related property.  It is an eta-expanded version of the traditional
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   176
         rule, and similar to the ABS rule of HOL\<close> and
6289
062aa156a300 added a commment on the "ext" rule
paulson
parents: 6027
diff changeset
   177
11432
8a203ae6efe3 added "The" (definite description operator) (by Larry);
wenzelm
parents: 10489
diff changeset
   178
  the_eq_trivial: "(THE x. x = a) = (a::'a)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   179
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   180
axiomatization where
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   181
  impI: "(P \<Longrightarrow> Q) \<Longrightarrow> P \<longrightarrow> Q" and
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   182
  mp: "\<lbrakk>P \<longrightarrow> Q; P\<rbrakk> \<Longrightarrow> Q" and
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   183
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   184
  iff: "(P \<longrightarrow> Q) \<longrightarrow> (Q \<longrightarrow> P) \<longrightarrow> (P = Q)" and
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   185
  True_or_False: "(P = True) \<or> (P = False)"
15380
455cfa766dad proof of subst by S Merz
paulson
parents: 15363
diff changeset
   186
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   187
defs
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   188
  True_def:     "True      \<equiv> ((\<lambda>x::bool. x) = (\<lambda>x. x))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   189
  All_def:      "All P     \<equiv> (P = (\<lambda>x. True))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   190
  Ex_def:       "Ex P      \<equiv> \<forall>Q. (\<forall>x. P x \<longrightarrow> Q) \<longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   191
  False_def:    "False     \<equiv> (\<forall>P. P)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   192
  not_def:      "\<not> P       \<equiv> P \<longrightarrow> False"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   193
  and_def:      "P \<and> Q     \<equiv> \<forall>R. (P \<longrightarrow> Q \<longrightarrow> R) \<longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   194
  or_def:       "P \<or> Q     \<equiv> \<forall>R. (P \<longrightarrow> R) \<longrightarrow> (Q \<longrightarrow> R) \<longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   195
  Ex1_def:      "Ex1 P     \<equiv> \<exists>x. P x \<and> (\<forall>y. P y \<longrightarrow> y = x)"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   196
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   197
definition If :: "bool \<Rightarrow> 'a \<Rightarrow> 'a \<Rightarrow> 'a" ("(if (_)/ then (_)/ else (_))" [0, 0, 10] 10)
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   198
  where "If P x y \<equiv> (THE z::'a. (P = True \<longrightarrow> z = x) \<and> (P = False \<longrightarrow> z = y))"
923
ff1574a81019 new version of HOL with curried function application
clasohm
parents:
diff changeset
   199
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   200
definition Let :: "'a \<Rightarrow> ('a \<Rightarrow> 'b) \<Rightarrow> 'b"
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   201
  where "Let s f \<equiv> f s"
38525
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
   202
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
   203
translations
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   204
  "_Let (_binds b bs) e"  \<rightleftharpoons> "_Let b (_Let bs e)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   205
  "let x = a in e"        \<rightleftharpoons> "CONST Let a (\<lambda>x. e)"
38525
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
   206
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   207
axiomatization undefined :: 'a
22481
79c2724c36b5 added class "default" and expansion axioms for undefined
haftmann
parents: 22473
diff changeset
   208
46973
d68798000e46 modernized axiomatization;
wenzelm
parents: 46950
diff changeset
   209
class default = fixes default :: 'a
4868
843a9f5b3c3d nonterminals;
wenzelm
parents: 4793
diff changeset
   210
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   211
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   212
subsection \<open>Fundamental rules\<close>
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   213
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   214
subsubsection \<open>Equality\<close>
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   215
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   216
lemma sym: "s = t \<Longrightarrow> t = s"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   217
  by (erule subst) (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   218
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   219
lemma ssubst: "t = s \<Longrightarrow> P s \<Longrightarrow> P t"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   220
  by (drule sym) (erule subst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   221
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   222
lemma trans: "\<lbrakk>r = s; s = t\<rbrakk> \<Longrightarrow> r = t"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   223
  by (erule subst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   224
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   225
lemma trans_sym [Pure.elim?]: "r = s \<Longrightarrow> t = s \<Longrightarrow> r = t"
40715
3ba17f07b23c lemma trans_sym allows single-step "normalization" in Isar, e.g. via moreover/ultimately;
wenzelm
parents: 40582
diff changeset
   226
  by (rule trans [OF _ sym])
3ba17f07b23c lemma trans_sym allows single-step "normalization" in Isar, e.g. via moreover/ultimately;
wenzelm
parents: 40582
diff changeset
   227
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   228
lemma meta_eq_to_obj_eq:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   229
  assumes meq: "A \<equiv> B"
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   230
  shows "A = B"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   231
  by (unfold meq) (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   232
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   233
text \<open>Useful with @{text erule} for proving equalities from known equalities.\<close>
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   234
     (* a = b
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   235
        |   |
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   236
        c = d   *)
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   237
lemma box_equals: "\<lbrakk>a = b; a = c; b = d\<rbrakk> \<Longrightarrow> c = d"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   238
apply (rule trans)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   239
apply (rule trans)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   240
apply (rule sym)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   241
apply assumption+
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   242
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   243
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   244
text \<open>For calculational reasoning:\<close>
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   245
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   246
lemma forw_subst: "a = b \<Longrightarrow> P b \<Longrightarrow> P a"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   247
  by (rule ssubst)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   248
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   249
lemma back_subst: "P a \<Longrightarrow> a = b \<Longrightarrow> P b"
15524
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   250
  by (rule subst)
2ef571f80a55 Moved oderings from HOL into the new Orderings.thy
nipkow
parents: 15481
diff changeset
   251
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   252
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   253
subsubsection \<open>Congruence rules for application\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   254
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   255
text \<open>Similar to @{text AP_THM} in Gordon's HOL.\<close>
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   256
lemma fun_cong: "(f :: 'a \<Rightarrow> 'b) = g \<Longrightarrow> f x = g x"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   257
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   258
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   259
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   260
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   261
text \<open>Similar to @{text AP_TERM} in Gordon's HOL and FOL's @{text subst_context}.\<close>
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   262
lemma arg_cong: "x = y \<Longrightarrow> f x = f y"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   263
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   264
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   265
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   266
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   267
lemma arg_cong2: "\<lbrakk>a = b; c = d\<rbrakk> \<Longrightarrow> f a c = f b d"
15655
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   268
apply (erule ssubst)+
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   269
apply (rule refl)
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   270
done
157f3988f775 arg_cong2 by Norbert Voelker
paulson
parents: 15570
diff changeset
   271
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   272
lemma cong: "\<lbrakk>f = g; (x::'a) = y\<rbrakk> \<Longrightarrow> f x = g y"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   273
apply (erule subst)+
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   274
apply (rule refl)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   275
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   276
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   277
ML \<open>fun cong_tac ctxt = Cong_Tac.cong_tac ctxt @{thm cong}\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   278
32733
71618deaf777 moved generic cong_tac from HOL/Tools/datatype_aux.ML to Tools/cong_tac.ML, proper subgoal selection (failure, not exception);
wenzelm
parents: 32668
diff changeset
   279
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   280
subsubsection \<open>Equality of booleans -- iff\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   281
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   282
lemma iffI: assumes "P \<Longrightarrow> Q" and "Q \<Longrightarrow> P" shows "P = Q"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   283
  by (iprover intro: iff [THEN mp, THEN mp] impI assms)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   284
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   285
lemma iffD2: "\<lbrakk>P = Q; Q\<rbrakk> \<Longrightarrow> P"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   286
  by (erule ssubst)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   287
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   288
lemma rev_iffD2: "\<lbrakk>Q; P = Q\<rbrakk> \<Longrightarrow> P"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   289
  by (erule iffD2)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   290
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   291
lemma iffD1: "Q = P \<Longrightarrow> Q \<Longrightarrow> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   292
  by (drule sym) (rule iffD2)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   293
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   294
lemma rev_iffD1: "Q \<Longrightarrow> Q = P \<Longrightarrow> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   295
  by (drule sym) (rule rev_iffD2)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   296
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   297
lemma iffE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   298
  assumes major: "P = Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   299
    and minor: "\<lbrakk>P \<longrightarrow> Q; Q \<longrightarrow> P\<rbrakk> \<Longrightarrow> R"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   300
  shows R
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   301
  by (iprover intro: minor impI major [THEN iffD2] major [THEN iffD1])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   302
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   303
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   304
subsubsection \<open>True\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   305
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   306
lemma TrueI: "True"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   307
  unfolding True_def by (rule refl)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   308
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   309
lemma eqTrueI: "P \<Longrightarrow> P = True"
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
   310
  by (iprover intro: iffI TrueI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   311
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   312
lemma eqTrueE: "P = True \<Longrightarrow> P"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   313
  by (erule iffD2) (rule TrueI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   314
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   315
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   316
subsubsection \<open>Universal quantifier\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   317
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   318
lemma allI: assumes "\<And>x::'a. P x" shows "\<forall>x. P x"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   319
  unfolding All_def by (iprover intro: ext eqTrueI assms)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   320
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   321
lemma spec: "\<forall>x::'a. P x \<Longrightarrow> P x"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   322
apply (unfold All_def)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   323
apply (rule eqTrueE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   324
apply (erule fun_cong)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   325
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   326
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   327
lemma allE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   328
  assumes major: "\<forall>x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   329
    and minor: "P x \<Longrightarrow> R"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   330
  shows R
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   331
  by (iprover intro: minor major [THEN spec])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   332
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   333
lemma all_dupE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   334
  assumes major: "\<forall>x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   335
    and minor: "\<lbrakk>P x; \<forall>x. P x\<rbrakk> \<Longrightarrow> R"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   336
  shows R
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   337
  by (iprover intro: minor major major [THEN spec])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   338
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   339
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   340
subsubsection \<open>False\<close>
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   341
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   342
text \<open>
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   343
  Depends upon @{text spec}; it is impossible to do propositional
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   344
  logic before quantifiers!
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   345
\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   346
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   347
lemma FalseE: "False \<Longrightarrow> P"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   348
  apply (unfold False_def)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   349
  apply (erule spec)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   350
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   351
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   352
lemma False_neq_True: "False = True \<Longrightarrow> P"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   353
  by (erule eqTrueE [THEN FalseE])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   354
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   355
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   356
subsubsection \<open>Negation\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   357
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   358
lemma notI:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   359
  assumes "P \<Longrightarrow> False"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   360
  shows "\<not> P"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   361
  apply (unfold not_def)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   362
  apply (iprover intro: impI assms)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   363
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   364
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   365
lemma False_not_True: "False \<noteq> True"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   366
  apply (rule notI)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   367
  apply (erule False_neq_True)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   368
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   369
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   370
lemma True_not_False: "True \<noteq> False"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   371
  apply (rule notI)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   372
  apply (drule sym)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   373
  apply (erule False_neq_True)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   374
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   375
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   376
lemma notE: "\<lbrakk>\<not> P; P\<rbrakk> \<Longrightarrow> R"
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   377
  apply (unfold not_def)
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   378
  apply (erule mp [THEN FalseE])
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   379
  apply assumption
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   380
  done
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   381
21504
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   382
lemma notI2: "(P \<Longrightarrow> \<not> Pa) \<Longrightarrow> (P \<Longrightarrow> Pa) \<Longrightarrow> \<not> P"
9c97af4a1567 tuned proofs;
wenzelm
parents: 21502
diff changeset
   383
  by (erule notE [THEN notI]) (erule meta_mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   384
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   385
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   386
subsubsection \<open>Implication\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   387
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   388
lemma impE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   389
  assumes "P \<longrightarrow> Q" P "Q \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   390
  shows R
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   391
by (iprover intro: assms mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   392
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   393
(* Reduces Q to P \<longrightarrow> Q, allowing substitution in P. *)
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   394
lemma rev_mp: "\<lbrakk>P; P \<longrightarrow> Q\<rbrakk> \<Longrightarrow> Q"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   395
by (iprover intro: mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   396
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   397
lemma contrapos_nn:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   398
  assumes major: "\<not> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   399
      and minor: "P \<Longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   400
  shows "\<not> P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   401
by (iprover intro: notI minor major [THEN notE])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   402
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   403
(*not used at all, but we already have the other 3 combinations *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   404
lemma contrapos_pn:
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   405
  assumes major: "Q"
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   406
      and minor: "P \<Longrightarrow> \<not> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   407
  shows "\<not> P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   408
by (iprover intro: notI minor major notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   409
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   410
lemma not_sym: "t \<noteq> s \<Longrightarrow> s \<noteq> t"
21250
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   411
  by (erule contrapos_nn) (erule sym)
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   412
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   413
lemma eq_neq_eq_imp_neq: "\<lbrakk>x = a; a \<noteq> b; b = y\<rbrakk> \<Longrightarrow> x \<noteq> y"
21250
a268f6288fb6 moved lemma eq_neq_eq_imp_neq to HOL
haftmann
parents: 21218
diff changeset
   414
  by (erule subst, erule ssubst, assumption)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   415
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   416
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   417
subsubsection \<open>Existential quantifier\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   418
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   419
lemma exI: "P x \<Longrightarrow> \<exists>x::'a. P x"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   420
apply (unfold Ex_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   421
apply (iprover intro: allI allE impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   422
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   423
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   424
lemma exE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   425
  assumes major: "\<exists>x::'a. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   426
      and minor: "\<And>x. P x \<Longrightarrow> Q"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   427
  shows "Q"
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   428
apply (rule major [unfolded Ex_def, THEN spec, THEN mp])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   429
apply (iprover intro: impI [THEN allI] minor)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   430
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   431
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   432
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   433
subsubsection \<open>Conjunction\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   434
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   435
lemma conjI: "\<lbrakk>P; Q\<rbrakk> \<Longrightarrow> P \<and> Q"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   436
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   437
apply (iprover intro: impI [THEN allI] mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   438
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   439
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   440
lemma conjunct1: "\<lbrakk>P \<and> Q\<rbrakk> \<Longrightarrow> P"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   441
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   442
apply (iprover intro: impI dest: spec mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   443
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   444
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   445
lemma conjunct2: "\<lbrakk>P \<and> Q\<rbrakk> \<Longrightarrow> Q"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   446
apply (unfold and_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   447
apply (iprover intro: impI dest: spec mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   448
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   449
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   450
lemma conjE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   451
  assumes major: "P \<and> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   452
      and minor: "\<lbrakk>P; Q\<rbrakk> \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   453
  shows R
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   454
apply (rule minor)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   455
apply (rule major [THEN conjunct1])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   456
apply (rule major [THEN conjunct2])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   457
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   458
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   459
lemma context_conjI:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   460
  assumes P "P \<Longrightarrow> Q" shows "P \<and> Q"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   461
by (iprover intro: conjI assms)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   462
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   463
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   464
subsubsection \<open>Disjunction\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   465
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   466
lemma disjI1: "P \<Longrightarrow> P \<or> Q"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   467
apply (unfold or_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   468
apply (iprover intro: allI impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   469
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   470
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   471
lemma disjI2: "Q \<Longrightarrow> P \<or> Q"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   472
apply (unfold or_def)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   473
apply (iprover intro: allI impI mp)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   474
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   475
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   476
lemma disjE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   477
  assumes major: "P \<or> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   478
      and minorP: "P \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   479
      and minorQ: "Q \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   480
  shows R
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   481
by (iprover intro: minorP minorQ impI
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   482
                 major [unfolded or_def, THEN spec, THEN mp, THEN mp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   483
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   484
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   485
subsubsection \<open>Classical logic\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   486
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   487
lemma classical:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   488
  assumes prem: "\<not> P \<Longrightarrow> P"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   489
  shows P
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   490
apply (rule True_or_False [THEN disjE, THEN eqTrueE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   491
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   492
apply (rule notI [THEN prem, THEN eqTrueI])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   493
apply (erule subst)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   494
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   495
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   496
45607
16b4f5774621 eliminated obsolete "standard";
wenzelm
parents: 45294
diff changeset
   497
lemmas ccontr = FalseE [THEN classical]
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   498
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   499
(*notE with premises exchanged; it discharges \<not> R so that it can be used to
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   500
  make elimination rules*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   501
lemma rev_notE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   502
  assumes premp: P
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   503
      and premnot: "\<not> R \<Longrightarrow> \<not> P"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   504
  shows R
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   505
apply (rule ccontr)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   506
apply (erule notE [OF premnot premp])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   507
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   508
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   509
(*Double negation law*)
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   510
lemma notnotD: "\<not>\<not> P \<Longrightarrow> P"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   511
apply (rule classical)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   512
apply (erule notE)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   513
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   514
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   515
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   516
lemma contrapos_pp:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   517
  assumes p1: Q
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   518
      and p2: "\<not> P \<Longrightarrow> \<not> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   519
  shows P
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   520
by (iprover intro: classical p1 p2 notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   521
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   522
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   523
subsubsection \<open>Unique existence\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   524
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   525
lemma ex1I:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   526
  assumes "P a" "\<And>x. P x \<Longrightarrow> x = a"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   527
  shows "\<exists>!x. P x"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   528
by (unfold Ex1_def, iprover intro: assms exI conjI allI impI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   529
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   530
text\<open>Sometimes easier to use: the premises have no shared variables.  Safe!\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   531
lemma ex_ex1I:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   532
  assumes ex_prem: "\<exists>x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   533
      and eq: "\<And>x y. \<lbrakk>P x; P y\<rbrakk> \<Longrightarrow> x = y"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   534
  shows "\<exists>!x. P x"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   535
by (iprover intro: ex_prem [THEN exE] ex1I eq)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   536
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   537
lemma ex1E:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   538
  assumes major: "\<exists>!x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   539
      and minor: "\<And>x. \<lbrakk>P x; \<forall>y. P y \<longrightarrow> y = x\<rbrakk> \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   540
  shows R
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   541
apply (rule major [unfolded Ex1_def, THEN exE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   542
apply (erule conjE)
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   543
apply (iprover intro: minor)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   544
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   545
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   546
lemma ex1_implies_ex: "\<exists>!x. P x \<Longrightarrow> \<exists>x. P x"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   547
apply (erule ex1E)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   548
apply (rule exI)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   549
apply assumption
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   550
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   551
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   552
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   553
subsubsection \<open>Classical intro rules for disjunction and existential quantifiers\<close>
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   554
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   555
lemma disjCI:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   556
  assumes "\<not> Q \<Longrightarrow> P" shows "P \<or> Q"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   557
apply (rule classical)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   558
apply (iprover intro: assms disjI1 disjI2 notI elim: notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   559
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   560
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   561
lemma excluded_middle: "\<not> P \<or> P"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   562
by (iprover intro: disjCI)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   563
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   564
text \<open>
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   565
  case distinction as a natural deduction rule.
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   566
  Note that @{term "\<not> P"} is the second case, not the first
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   567
\<close>
27126
3ede9103de8e eliminated obsolete case_split_thm -- use case_split;
wenzelm
parents: 27107
diff changeset
   568
lemma case_split [case_names True False]:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   569
  assumes prem1: "P \<Longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   570
      and prem2: "\<not> P \<Longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   571
  shows Q
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   572
apply (rule excluded_middle [THEN disjE])
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   573
apply (erule prem2)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   574
apply (erule prem1)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   575
done
27126
3ede9103de8e eliminated obsolete case_split_thm -- use case_split;
wenzelm
parents: 27107
diff changeset
   576
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   577
(*Classical implies (\<longrightarrow>) elimination. *)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   578
lemma impCE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   579
  assumes major: "P \<longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   580
      and minor: "\<not> P \<Longrightarrow> R" "Q \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   581
  shows R
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   582
apply (rule excluded_middle [of P, THEN disjE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   583
apply (iprover intro: minor major [THEN mp])+
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   584
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   585
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   586
(*This version of \<longrightarrow> elimination works on Q before P.  It works best for
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   587
  those cases in which P holds "almost everywhere".  Can't install as
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   588
  default: would break old proofs.*)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   589
lemma impCE':
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   590
  assumes major: "P \<longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   591
      and minor: "Q \<Longrightarrow> R" "\<not> P \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   592
  shows R
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   593
apply (rule excluded_middle [of P, THEN disjE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   594
apply (iprover intro: minor major [THEN mp])+
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   595
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   596
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   597
(*Classical <-> elimination. *)
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   598
lemma iffCE:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   599
  assumes major: "P = Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   600
      and minor: "\<lbrakk>P; Q\<rbrakk> \<Longrightarrow> R" "\<lbrakk>\<not> P; \<not> Q\<rbrakk> \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   601
  shows R
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   602
apply (rule major [THEN iffE])
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   603
apply (iprover intro: minor elim: impCE notE)
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   604
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   605
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   606
lemma exCI:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   607
  assumes "\<forall>x. \<not> P x \<Longrightarrow> P a"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   608
  shows "\<exists>x. P x"
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   609
apply (rule ccontr)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   610
apply (iprover intro: assms exI allI notI notE [of "\<exists>x. P x"])
15411
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   611
done
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   612
1d195de59497 removal of HOL_Lemmas
paulson
parents: 15380
diff changeset
   613
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   614
subsubsection \<open>Intuitionistic Reasoning\<close>
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   615
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   616
lemma impE':
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   617
  assumes 1: "P \<longrightarrow> Q"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   618
    and 2: "Q \<Longrightarrow> R"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   619
    and 3: "P \<longrightarrow> Q \<Longrightarrow> P"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   620
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   621
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   622
  from 3 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   623
  with 1 have Q by (rule impE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   624
  with 2 show R .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   625
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   626
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   627
lemma allE':
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   628
  assumes 1: "\<forall>x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   629
    and 2: "P x \<Longrightarrow> \<forall>x. P x \<Longrightarrow> Q"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   630
  shows Q
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   631
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   632
  from 1 have "P x" by (rule spec)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   633
  from this and 1 show Q by (rule 2)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   634
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   635
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   636
lemma notE':
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   637
  assumes 1: "\<not> P"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   638
    and 2: "\<not> P \<Longrightarrow> P"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   639
  shows R
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   640
proof -
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   641
  from 2 and 1 have P .
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   642
  with 1 show R by (rule notE)
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   643
qed
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   644
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   645
lemma TrueE: "True \<Longrightarrow> P \<Longrightarrow> P" .
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   646
lemma notFalseE: "\<not> False \<Longrightarrow> P \<Longrightarrow> P" .
22444
fb80fedd192d added safe intro rules for removing "True" subgoals as well as "~ False" ones.
dixon
parents: 22377
diff changeset
   647
22467
c9357ef01168 TrueElim and notTrueElim tested and added as safe elim rules.
dixon
parents: 22445
diff changeset
   648
lemmas [Pure.elim!] = disjE iffE FalseE conjE exE TrueE notFalseE
15801
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   649
  and [Pure.intro!] = iffI conjI impI TrueI notI allI refl
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   650
  and [Pure.elim 2] = allE notE' impE'
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   651
  and [Pure.intro] = exI disjI2 disjI1
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   652
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   653
lemmas [trans] = trans
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   654
  and [sym] = sym not_sym
15801
d2f5ca3c048d superceded by Pure.thy and CPure.thy;
wenzelm
parents: 15676
diff changeset
   655
  and [Pure.elim?] = iffD1 iffD2 impE
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   656
11438
3d9222b80989 declare trans [trans] (*overridden in theory Calculation*);
wenzelm
parents: 11432
diff changeset
   657
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   658
subsubsection \<open>Atomizing meta-level connectives\<close>
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   659
28513
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   660
axiomatization where
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   661
  eq_reflection: "x = y \<Longrightarrow> x \<equiv> y" (*admissible axiom*)
b0b30fd6c264 re-introduces axiom subst
haftmann
parents: 28400
diff changeset
   662
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   663
lemma atomize_all [atomize]: "(\<And>x. P x) \<equiv> Trueprop (\<forall>x. P x)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   664
proof
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   665
  assume "\<And>x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   666
  then show "\<forall>x. P x" ..
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   667
next
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   668
  assume "\<forall>x. P x"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   669
  then show "\<And>x. P x" by (rule allE)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   670
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   671
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   672
lemma atomize_imp [atomize]: "(A \<Longrightarrow> B) \<equiv> Trueprop (A \<longrightarrow> B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   673
proof
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   674
  assume r: "A \<Longrightarrow> B"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   675
  show "A \<longrightarrow> B" by (rule impI) (rule r)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   676
next
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   677
  assume "A \<longrightarrow> B" and A
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   678
  then show B by (rule mp)
9488
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   679
qed
f11bece4e2db added all_eq, imp_eq (for blast);
wenzelm
parents: 9352
diff changeset
   680
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   681
lemma atomize_not: "(A \<Longrightarrow> False) \<equiv> Trueprop (\<not> A)"
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   682
proof
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   683
  assume r: "A \<Longrightarrow> False"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   684
  show "\<not> A" by (rule notI) (rule r)
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   685
next
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   686
  assume "\<not> A" and A
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
   687
  then show False by (rule notE)
14749
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   688
qed
9ccfd0f59e11 new atomize theorem
paulson
parents: 14690
diff changeset
   689
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   690
lemma atomize_eq [atomize, code]: "(x \<equiv> y) \<equiv> Trueprop (x = y)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   691
proof
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   692
  assume "x \<equiv> y"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   693
  show "x = y" by (unfold \<open>x \<equiv> y\<close>) (rule refl)
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   694
next
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   695
  assume "x = y"
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   696
  then show "x \<equiv> y" by (rule eq_reflection)
10432
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   697
qed
3dfbc913d184 added axclass inverse and consts inverse, divide (infix "/");
wenzelm
parents: 10383
diff changeset
   698
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   699
lemma atomize_conj [atomize]: "(A &&& B) \<equiv> Trueprop (A \<and> B)"
12003
c09427e5f554 removed obsolete (rule equal_intr_rule);
wenzelm
parents: 11989
diff changeset
   700
proof
28856
5e009a80fe6d Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents: 28741
diff changeset
   701
  assume conj: "A &&& B"
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   702
  show "A \<and> B"
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   703
  proof (rule conjI)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   704
    from conj show A by (rule conjunctionD1)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   705
    from conj show B by (rule conjunctionD2)
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   706
  qed
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   707
next
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   708
  assume conj: "A \<and> B"
28856
5e009a80fe6d Pure syntax: more coherent treatment of aprop, permanent TERM and &&&;
wenzelm
parents: 28741
diff changeset
   709
  show "A &&& B"
19121
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   710
  proof -
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   711
    from conj show A ..
d7fd5415a781 simplified Pure conjunction;
wenzelm
parents: 19039
diff changeset
   712
    from conj show B ..
11953
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   713
  qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   714
qed
f98623fdf6ef atomize_conj;
wenzelm
parents: 11824
diff changeset
   715
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   716
lemmas [symmetric, rulify] = atomize_all atomize_imp
18832
6ab4de872a70 declare 'defn' rules;
wenzelm
parents: 18757
diff changeset
   717
  and [symmetric, defn] = atomize_all atomize_imp atomize_eq
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   718
11750
3e400964893e judgment Trueprop;
wenzelm
parents: 11724
diff changeset
   719
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   720
subsubsection \<open>Atomizing elimination rules\<close>
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   721
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   722
lemma atomize_exL[atomize_elim]: "(\<And>x. P x \<Longrightarrow> Q) \<equiv> ((\<exists>x. P x) \<Longrightarrow> Q)"
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   723
  by rule iprover+
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   724
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   725
lemma atomize_conjL[atomize_elim]: "(A \<Longrightarrow> B \<Longrightarrow> C) \<equiv> (A \<and> B \<Longrightarrow> C)"
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   726
  by rule iprover+
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   727
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   728
lemma atomize_disjL[atomize_elim]: "((A \<Longrightarrow> C) \<Longrightarrow> (B \<Longrightarrow> C) \<Longrightarrow> C) \<equiv> ((A \<or> B \<Longrightarrow> C) \<Longrightarrow> C)"
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   729
  by rule iprover+
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   730
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   731
lemma atomize_elimL[atomize_elim]: "(\<And>B. (A \<Longrightarrow> B) \<Longrightarrow> B) \<equiv> Trueprop A" ..
26580
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   732
c3e597a476fd Generic conversion and tactic "atomize_elim" to convert elimination rules
krauss
parents: 26555
diff changeset
   733
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   734
subsection \<open>Package setup\<close>
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   735
51314
eac4bb5adbf9 just one HOLogic.Trueprop_conv, with regular exception CTERM;
wenzelm
parents: 51304
diff changeset
   736
ML_file "Tools/hologic.ML"
eac4bb5adbf9 just one HOLogic.Trueprop_conv, with regular exception CTERM;
wenzelm
parents: 51304
diff changeset
   737
eac4bb5adbf9 just one HOLogic.Trueprop_conv, with regular exception CTERM;
wenzelm
parents: 51304
diff changeset
   738
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   739
subsubsection \<open>Sledgehammer setup\<close>
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   740
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   741
text \<open>
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   742
Theorems blacklisted to Sledgehammer. These theorems typically produce clauses
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   743
that are prolific (match too many equality or membership literals) and relate to
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   744
seldom-used facts. Some duplicate other rules.
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   745
\<close>
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   746
57963
cb67fac9bd89 updated to named_theorems;
wenzelm
parents: 57962
diff changeset
   747
named_theorems no_atp "theorems that should be filtered out by Sledgehammer"
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   748
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
   749
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   750
subsubsection \<open>Classical Reasoner setup\<close>
9529
d9434a9277a4 lemmas atomize = all_eq imp_eq;
wenzelm
parents: 9488
diff changeset
   751
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   752
lemma imp_elim: "P \<longrightarrow> Q \<Longrightarrow> (\<not> R \<Longrightarrow> P) \<Longrightarrow> (Q \<Longrightarrow> R) \<Longrightarrow> R"
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   753
  by (rule classical) iprover
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   754
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   755
lemma swap: "\<not> P \<Longrightarrow> (\<not> R \<Longrightarrow> P) \<Longrightarrow> R"
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   756
  by (rule classical) iprover
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   757
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   758
lemma thin_refl: "\<And>X. \<lbrakk>x = x; PROP W\<rbrakk> \<Longrightarrow> PROP W" .
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   759
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   760
ML \<open>
42799
4e33894aec6d modernized functor names;
wenzelm
parents: 42795
diff changeset
   761
structure Hypsubst = Hypsubst
4e33894aec6d modernized functor names;
wenzelm
parents: 42795
diff changeset
   762
(
21218
38013c3a77a2 tuned hypsubst setup;
wenzelm
parents: 21210
diff changeset
   763
  val dest_eq = HOLogic.dest_eq
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   764
  val dest_Trueprop = HOLogic.dest_Trueprop
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   765
  val dest_imp = HOLogic.dest_imp
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   766
  val eq_reflection = @{thm eq_reflection}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   767
  val rev_eq_reflection = @{thm meta_eq_to_obj_eq}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   768
  val imp_intr = @{thm impI}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   769
  val rev_mp = @{thm rev_mp}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   770
  val subst = @{thm subst}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   771
  val sym = @{thm sym}
22129
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   772
  val thin_refl = @{thm thin_refl};
42799
4e33894aec6d modernized functor names;
wenzelm
parents: 42795
diff changeset
   773
);
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
   774
open Hypsubst;
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   775
42799
4e33894aec6d modernized functor names;
wenzelm
parents: 42795
diff changeset
   776
structure Classical = Classical
4e33894aec6d modernized functor names;
wenzelm
parents: 42795
diff changeset
   777
(
26411
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   778
  val imp_elim = @{thm imp_elim}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   779
  val not_elim = @{thm notE}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   780
  val swap = @{thm swap}
cd74690f3bfb pass imp_elim, swap to classical prover;
wenzelm
parents: 25966
diff changeset
   781
  val classical = @{thm classical}
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   782
  val sizef = Drule.size_of_thm
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   783
  val hyp_subst_tacs = [Hypsubst.hyp_subst_tac]
42799
4e33894aec6d modernized functor names;
wenzelm
parents: 42795
diff changeset
   784
);
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   785
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   786
structure Basic_Classical: BASIC_CLASSICAL = Classical;
33308
cf62d1690d04 separate ResBlacklist, based on scalable persistent data -- avoids inefficient hashing later on;
wenzelm
parents: 33185
diff changeset
   787
open Basic_Classical;
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   788
\<close>
22129
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   789
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   790
setup \<open>
35389
2be5440f7271 tuned hyp_subst_tac';
wenzelm
parents: 35364
diff changeset
   791
  (*prevent substitution on bool*)
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   792
  let
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   793
    fun non_bool_eq (@{const_name HOL.eq}, Type (_, [T, _])) = T <> @{typ bool}
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   794
      | non_bool_eq _ = false;
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   795
    fun hyp_subst_tac' ctxt =
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   796
      SUBGOAL (fn (goal, i) =>
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   797
        if Term.exists_Const non_bool_eq goal
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   798
        then Hypsubst.hyp_subst_tac ctxt i
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   799
        else no_tac);
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   800
  in
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   801
    Context_Rules.addSWrapper (fn ctxt => fn tac => hyp_subst_tac' ctxt ORELSE' tac)
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
   802
  end
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   803
\<close>
21009
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   804
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   805
declare iffI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   806
  and notI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   807
  and impI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   808
  and disjCI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   809
  and conjI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   810
  and TrueI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   811
  and refl [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   812
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   813
declare iffCE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   814
  and FalseE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   815
  and impCE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   816
  and disjE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   817
  and conjE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   818
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   819
declare ex_ex1I [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   820
  and allI [intro!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   821
  and exI [intro]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   822
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   823
declare exE [elim!]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   824
  allE [elim]
0eae3fb48936 lifted claset setup from ML to Isar level
haftmann
parents: 20973
diff changeset
   825
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   826
ML \<open>val HOL_cs = claset_of @{context}\<close>
19162
67436e2a16df Added setup for "atpset" (a rule set for ATPs).
mengj
parents: 19138
diff changeset
   827
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   828
lemma contrapos_np: "\<not> Q \<Longrightarrow> (\<not> P \<Longrightarrow> Q) \<Longrightarrow> P"
20223
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   829
  apply (erule swap)
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   830
  apply (erule (1) meta_mp)
89d2758ecddf tuned proofs;
wenzelm
parents: 20172
diff changeset
   831
  done
10383
a092ae7bb2a6 "atomize" for classical tactics;
wenzelm
parents: 9970
diff changeset
   832
18689
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   833
declare ex_ex1I [rule del, intro! 2]
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   834
  and ex1I [intro]
a50587cd8414 prefer ex1I over ex_ex1I in single-step reasoning;
wenzelm
parents: 18595
diff changeset
   835
41865
4e8483cc2cc5 declare ext [intro]: Extensionality now available by default
paulson
parents: 41827
diff changeset
   836
declare ext [intro]
4e8483cc2cc5 declare ext [intro]: Extensionality now available by default
paulson
parents: 41827
diff changeset
   837
12386
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   838
lemmas [intro?] = ext
9c38ec9eca1c tuned declarations (rules, sym, etc.);
wenzelm
parents: 12354
diff changeset
   839
  and [elim?] = ex1_implies_ex
11977
2e7c54b86763 tuned declaration of rules;
wenzelm
parents: 11953
diff changeset
   840
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   841
(*Better then ex1E for classical reasoner: needs no quantifier duplication!*)
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
   842
lemma alt_ex1E [elim!]:
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   843
  assumes major: "\<exists>!x. P x"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   844
      and prem: "\<And>x. \<lbrakk> P x; \<forall>y y'. P y \<and> P y' \<longrightarrow> y = y' \<rbrakk> \<Longrightarrow> R"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   845
  shows R
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   846
apply (rule ex1E [OF major])
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   847
apply (rule prem)
59499
14095f771781 misc tuning;
wenzelm
parents: 59498
diff changeset
   848
apply assumption
14095f771781 misc tuning;
wenzelm
parents: 59498
diff changeset
   849
apply (rule allI)+
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   850
apply (tactic \<open>eresolve_tac @{context} [Classical.dup_elim @{context} @{thm allE}] 1\<close>)
22129
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   851
apply iprover
bb2203c93316 tuned ML setup;
wenzelm
parents: 21671
diff changeset
   852
done
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   853
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   854
ML \<open>
42477
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   855
  structure Blast = Blast
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   856
  (
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   857
    structure Classical = Classical
42802
51d7e74f6899 simplified BLAST_DATA;
wenzelm
parents: 42799
diff changeset
   858
    val Trueprop_const = dest_Const @{const Trueprop}
42477
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   859
    val equality_name = @{const_name HOL.eq}
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   860
    val not_name = @{const_name Not}
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   861
    val notE = @{thm notE}
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   862
    val ccontr = @{thm ccontr}
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   863
    val hyp_subst_tac = Hypsubst.blast_hyp_subst_tac
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   864
  );
52fa26b6c524 simplified Blast setup;
wenzelm
parents: 42459
diff changeset
   865
  val blast_tac = Blast.blast_tac;
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   866
\<close>
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   867
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   868
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   869
subsubsection \<open>THE: definite description operator\<close>
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   870
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   871
lemma the_equality [intro]:
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   872
  assumes "P a"
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   873
      and "\<And>x. P x \<Longrightarrow> x = a"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   874
  shows "(THE x. P x) = a"
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   875
  by (blast intro: assms trans [OF arg_cong [where f=The] the_eq_trivial])
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   876
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   877
lemma theI:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   878
  assumes "P a" and "\<And>x. P x \<Longrightarrow> x = a"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   879
  shows "P (THE x. P x)"
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   880
by (iprover intro: assms the_equality [THEN ssubst])
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   881
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   882
lemma theI': "\<exists>!x. P x \<Longrightarrow> P (THE x. P x)"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   883
  by (blast intro: theI)
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   884
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   885
(*Easier to apply than theI: only one occurrence of P*)
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   886
lemma theI2:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   887
  assumes "P a" "\<And>x. P x \<Longrightarrow> x = a" "\<And>x. P x \<Longrightarrow> Q x"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   888
  shows "Q (THE x. P x)"
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   889
by (iprover intro: assms theI)
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   890
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   891
lemma the1I2: assumes "\<exists>!x. P x" "\<And>x. P x \<Longrightarrow> Q x" shows "Q (THE x. P x)"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   892
by(iprover intro:assms(2) theI2[where P=P and Q=Q] ex1E[OF assms(1)]
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   893
           elim:allE impE)
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   894
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   895
lemma the1_equality [elim?]: "\<lbrakk>\<exists>!x. P x; P a\<rbrakk> \<Longrightarrow> (THE x. P x) = a"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   896
  by blast
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   897
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   898
lemma the_sym_eq_trivial: "(THE y. x = y) = x"
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   899
  by blast
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   900
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
   901
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   902
subsubsection \<open>Simplifier\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   903
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   904
lemma eta_contract_eq: "(\<lambda>s. f s) = f" ..
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   905
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   906
lemma simp_thms:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   907
  shows not_not: "(\<not> \<not> P) = P"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   908
  and Not_eq_iff: "((\<not> P) = (\<not> Q)) = (P = Q)"
12937
0c4fd7529467 clarified syntax of ``long'' statements: fixes/assumes/shows;
wenzelm
parents: 12892
diff changeset
   909
  and
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   910
    "(P \<noteq> Q) = (P = (\<not> Q))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   911
    "(P \<or> \<not>P) = True"    "(\<not> P \<or> P) = True"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   912
    "(x = x) = True"
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
   913
  and not_True_eq_False [code]: "(\<not> True) = False"
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
   914
  and not_False_eq_True [code]: "(\<not> False) = True"
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   915
  and
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   916
    "(\<not> P) \<noteq> P"  "P \<noteq> (\<not> P)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   917
    "(True = P) = P"
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   918
  and eq_True: "(P = True) = P"
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   919
  and "(False = P) = (\<not> P)"
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   920
  and eq_False: "(P = False) = (\<not> P)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
   921
  and
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   922
    "(True \<longrightarrow> P) = P"  "(False \<longrightarrow> P) = True"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   923
    "(P \<longrightarrow> True) = True"  "(P \<longrightarrow> P) = True"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   924
    "(P \<longrightarrow> False) = (\<not> P)"  "(P \<longrightarrow> \<not> P) = (\<not> P)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   925
    "(P \<and> True) = P"  "(True \<and> P) = P"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   926
    "(P \<and> False) = False"  "(False \<and> P) = False"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   927
    "(P \<and> P) = P"  "(P \<and> (P \<and> Q)) = (P \<and> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   928
    "(P \<and> \<not> P) = False"    "(\<not> P \<and> P) = False"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   929
    "(P \<or> True) = True"  "(True \<or> P) = True"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   930
    "(P \<or> False) = P"  "(False \<or> P) = P"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   931
    "(P \<or> P) = P"  "(P \<or> (P \<or> Q)) = (P \<or> Q)" and
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   932
    "(\<forall>x. P) = P"  "(\<exists>x. P) = P"  "\<exists>x. x = t"  "\<exists>x. t = x"
31166
a90fe83f58ea "{x. P x & x=t & Q x}" is now rewritten to "if P t & Q t then {t} else {}"
nipkow
parents: 31156
diff changeset
   933
  and
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   934
    "\<And>P. (\<exists>x. x = t \<and> P x) = P t"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   935
    "\<And>P. (\<exists>x. t = x \<and> P x) = P t"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   936
    "\<And>P. (\<forall>x. x = t \<longrightarrow> P x) = P t"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   937
    "\<And>P. (\<forall>x. t = x \<longrightarrow> P x) = P t"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
   938
  by (blast, blast, blast, blast, blast, iprover+)
13421
8fcdf4a26468 simplified locale predicates;
wenzelm
parents: 13412
diff changeset
   939
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   940
lemma disj_absorb: "(A \<or> A) = A"
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   941
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   942
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   943
lemma disj_left_absorb: "(A \<or> (A \<or> B)) = (A \<or> B)"
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   944
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   945
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   946
lemma conj_absorb: "(A \<and> A) = A"
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   947
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   948
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   949
lemma conj_left_absorb: "(A \<and> (A \<and> B)) = (A \<and> B)"
14201
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   950
  by blast
7ad7ab89c402 some basic new lemmas
paulson
parents: 13764
diff changeset
   951
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   952
lemma eq_ac:
57512
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56941
diff changeset
   953
  shows eq_commute: "a = b \<longleftrightarrow> b = a"
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56941
diff changeset
   954
    and iff_left_commute: "(P \<longleftrightarrow> (Q \<longleftrightarrow> R)) \<longleftrightarrow> (Q \<longleftrightarrow> (P \<longleftrightarrow> R))"
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56941
diff changeset
   955
    and iff_assoc: "((P \<longleftrightarrow> Q) \<longleftrightarrow> R) \<longleftrightarrow> (P \<longleftrightarrow> (Q \<longleftrightarrow> R))" by (iprover, blast+)
cc97b347b301 reduced name variants for assoc and commute on plus and mult
haftmann
parents: 56941
diff changeset
   956
lemma neq_commute: "a \<noteq> b \<longleftrightarrow> b \<noteq> a" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   957
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   958
lemma conj_comms:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   959
  shows conj_commute: "(P \<and> Q) = (Q \<and> P)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   960
    and conj_left_commute: "(P \<and> (Q \<and> R)) = (Q \<and> (P \<and> R))" by iprover+
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   961
lemma conj_assoc: "((P \<and> Q) \<and> R) = (P \<and> (Q \<and> R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   962
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
   963
lemmas conj_ac = conj_commute conj_left_commute conj_assoc
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
   964
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   965
lemma disj_comms:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   966
  shows disj_commute: "(P \<or> Q) = (Q \<or> P)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   967
    and disj_left_commute: "(P \<or> (Q \<or> R)) = (Q \<or> (P \<or> R))" by iprover+
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   968
lemma disj_assoc: "((P \<or> Q) \<or> R) = (P \<or> (Q \<or> R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   969
19174
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
   970
lemmas disj_ac = disj_commute disj_left_commute disj_assoc
df9de25e87b3 moved the "use" directive
paulson
parents: 19162
diff changeset
   971
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   972
lemma conj_disj_distribL: "(P \<and> (Q \<or> R)) = (P \<and> Q \<or> P \<and> R)" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   973
lemma conj_disj_distribR: "((P \<or> Q) \<and> R) = (P \<and> R \<or> Q \<and> R)" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   974
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   975
lemma disj_conj_distribL: "(P \<or> (Q \<and> R)) = ((P \<or> Q) \<and> (P \<or> R))" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   976
lemma disj_conj_distribR: "((P \<and> Q) \<or> R) = ((P \<or> R) \<and> (Q \<or> R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   977
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   978
lemma imp_conjR: "(P \<longrightarrow> (Q \<and> R)) = ((P \<longrightarrow> Q) \<and> (P \<longrightarrow> R))" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   979
lemma imp_conjL: "((P \<and> Q) \<longrightarrow> R) = (P \<longrightarrow> (Q \<longrightarrow> R))" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   980
lemma imp_disjL: "((P \<or> Q) \<longrightarrow> R) = ((P \<longrightarrow> R) \<and> (Q \<longrightarrow> R))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   981
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
   982
text \<open>These two are specialized, but @{text imp_disj_not1} is useful in @{text "Auth/Yahalom"}.\<close>
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   983
lemma imp_disj_not1: "(P \<longrightarrow> Q \<or> R) = (\<not> Q \<longrightarrow> P \<longrightarrow> R)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   984
lemma imp_disj_not2: "(P \<longrightarrow> Q \<or> R) = (\<not> R \<longrightarrow> P \<longrightarrow> Q)" by blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   985
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   986
lemma imp_disj1: "((P \<longrightarrow> Q) \<or> R) = (P \<longrightarrow> Q \<or> R)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   987
lemma imp_disj2: "(Q \<or> (P \<longrightarrow> R)) = (P \<longrightarrow> Q \<or> R)" by blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   988
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   989
lemma imp_cong: "(P = P') \<Longrightarrow> (P' \<Longrightarrow> (Q = Q')) \<Longrightarrow> ((P \<longrightarrow> Q) = (P' \<longrightarrow> Q'))"
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   990
  by iprover
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
   991
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   992
lemma de_Morgan_disj: "(\<not> (P \<or> Q)) = (\<not> P \<and> \<not> Q)" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   993
lemma de_Morgan_conj: "(\<not> (P \<and> Q)) = (\<not> P \<or> \<not> Q)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   994
lemma not_imp: "(\<not> (P \<longrightarrow> Q)) = (P \<and> \<not> Q)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   995
lemma not_iff: "(P \<noteq> Q) = (P = (\<not> Q))" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   996
lemma disj_not1: "(\<not> P \<or> Q) = (P \<longrightarrow> Q)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   997
lemma disj_not2: "(P \<or> \<not> Q) = (Q \<longrightarrow> P)"  -- \<open>changes orientation :-(\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
   998
  by blast
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
   999
lemma imp_conv_disj: "(P \<longrightarrow> Q) = ((\<not> P) \<or> Q)" by blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1000
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1001
lemma iff_conv_conj_imp: "(P = Q) = ((P \<longrightarrow> Q) \<and> (Q \<longrightarrow> P))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1002
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1003
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1004
lemma cases_simp: "((P \<longrightarrow> Q) \<and> (\<not> P \<longrightarrow> Q)) = Q"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1005
  -- \<open>Avoids duplication of subgoals after @{text split_if}, when the true and false\<close>
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1006
  -- \<open>cases boil down to the same thing.\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1007
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1008
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1009
lemma not_all: "(\<not> (\<forall>x. P x)) = (\<exists>x. \<not> P x)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1010
lemma imp_all: "((\<forall>x. P x) \<longrightarrow> Q) = (\<exists>x. P x \<longrightarrow> Q)" by blast
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1011
lemma not_ex: "(\<not> (\<exists>x. P x)) = (\<forall>x. \<not> P x)" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1012
lemma imp_ex: "((\<exists>x. P x) \<longrightarrow> Q) = (\<forall>x. P x \<longrightarrow> Q)" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1013
lemma all_not_ex: "(\<forall>x. P x) = (\<not> (\<exists>x. \<not> P x ))" by blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1014
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
  1015
declare All_def [no_atp]
24286
7619080e49f0 ATP blacklisting is now in theory data, attribute noatp
paulson
parents: 24280
diff changeset
  1016
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1017
lemma ex_disj_distrib: "(\<exists>x. P x \<or> Q x) = ((\<exists>x. P x) \<or> (\<exists>x. Q x))" by iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1018
lemma all_conj_distrib: "(\<forall>x. P x \<and> Q x) = ((\<forall>x. P x) \<and> (\<forall>x. Q x))" by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1019
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1020
text \<open>
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1021
  \medskip The @{text "\<and>"} congruence rule: not included by default!
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1022
  May slow rewrite proofs down by as much as 50\%\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1023
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1024
lemma conj_cong:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1025
    "(P = P') \<Longrightarrow> (P' \<Longrightarrow> (Q = Q')) \<Longrightarrow> ((P \<and> Q) = (P' \<and> Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1026
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1027
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1028
lemma rev_conj_cong:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1029
    "(Q = Q') \<Longrightarrow> (Q' \<Longrightarrow> (P = P')) \<Longrightarrow> ((P \<and> Q) = (P' \<and> Q'))"
17589
58eeffd73be1 renamed rules to iprover
nipkow
parents: 17459
diff changeset
  1030
  by iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1031
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1032
text \<open>The @{text "|"} congruence rule: not included by default!\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1033
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1034
lemma disj_cong:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1035
    "(P = P') \<Longrightarrow> (\<not> P' \<Longrightarrow> (Q = Q')) \<Longrightarrow> ((P \<or> Q) = (P' \<or> Q'))"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1036
  by blast
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1037
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1038
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1039
text \<open>\medskip if-then-else rules\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1040
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
  1041
lemma if_True [code]: "(if True then x else y) = x"
38525
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
  1042
  by (unfold If_def) blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1043
32068
98acc234d683 tuned code annotations
haftmann
parents: 31998
diff changeset
  1044
lemma if_False [code]: "(if False then x else y) = y"
38525
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
  1045
  by (unfold If_def) blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1046
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1047
lemma if_P: "P \<Longrightarrow> (if P then x else y) = x"
38525
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
  1048
  by (unfold If_def) blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1049
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1050
lemma if_not_P: "\<not> P \<Longrightarrow> (if P then x else y) = y"
38525
324219de6ee3 qualified constants Let and If
haftmann
parents: 37877
diff changeset
  1051
  by (unfold If_def) blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1052
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1053
lemma split_if: "P (if Q then x else y) = ((Q \<longrightarrow> P x) \<and> (\<not> Q \<longrightarrow> P y))"
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1054
  apply (rule case_split [of Q])
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1055
   apply (simplesubst if_P)
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1056
    prefer 3 apply (simplesubst if_not_P, blast+)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1057
  done
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1058
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1059
lemma split_if_asm: "P (if Q then x else y) = (\<not> ((Q \<and> \<not> P x) \<or> (\<not> Q \<and> \<not> P y)))"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1060
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1061
35828
46cfc4b8112e now use "Named_Thms" for "noatp", and renamed "noatp" to "no_atp"
blanchet
parents: 35808
diff changeset
  1062
lemmas if_splits [no_atp] = split_if split_if_asm
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1063
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1064
lemma if_cancel: "(if c then x else x) = x"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1065
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1066
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1067
lemma if_eq_cancel: "(if x = y then y else x) = x"
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1068
by (simplesubst split_if, blast)
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1069
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1070
lemma if_bool_eq_conj: "(if P then Q else R) = ((P \<longrightarrow> Q) \<and> (\<not> P \<longrightarrow> R))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1071
  -- \<open>This form is useful for expanding @{text "if"}s on the RIGHT of the @{text "\<Longrightarrow>"} symbol.\<close>
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1072
  by (rule split_if)
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1073
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1074
lemma if_bool_eq_disj: "(if P then Q else R) = ((P \<and> Q) \<or> (\<not> P \<and> R))"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1075
  -- \<open>And this form is useful for expanding @{text "if"}s on the LEFT.\<close>
59504
8c6747dba731 New lemmas and a bit of tidying up.
paulson <lp15@cam.ac.uk>
parents: 59028
diff changeset
  1076
  by (simplesubst split_if) blast
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1077
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1078
lemma Eq_TrueI: "P \<Longrightarrow> P \<equiv> True" by (unfold atomize_eq) iprover
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1079
lemma Eq_FalseI: "\<not> P \<Longrightarrow> P \<equiv> False" by (unfold atomize_eq) iprover
12281
3bd113b8f7a6 converted simp lemmas;
wenzelm
parents: 12256
diff changeset
  1080
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1081
text \<open>\medskip let rules for simproc\<close>
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1082
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1083
lemma Let_folded: "f x \<equiv> g x \<Longrightarrow> Let x f \<equiv> Let x g"
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1084
  by (unfold Let_def)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1085
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1086
lemma Let_unfold: "f x \<equiv> g \<Longrightarrow> Let x f \<equiv> g"
15423
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1087
  by (unfold Let_def)
761a4f8e6ad6 added simproc for Let
schirmer
parents: 15411
diff changeset
  1088
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1089
text \<open>
16999
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1090
  The following copy of the implication operator is useful for
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1091
  fine-tuning congruence rules.  It instructs the simplifier to simplify
307b2ec590ff Turned simp_implies into binary operator.
ballarin
parents: 16775
diff changeset
  1092
  its premise.
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1093
\<close>
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1094
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1095
definition simp_implies :: "[prop, prop] \<Rightarrow> prop"  (infixr "=simp=>" 1) where
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1096
  "simp_implies \<equiv> op \<Longrightarrow>"
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1097
18457
356a9f711899 structure ProjectRule;
wenzelm
parents: 17992
diff changeset
  1098
lemma simp_impliesI:
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1099
  assumes PQ: "(PROP P \<Longrightarrow> PROP Q)"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1100
  shows "PROP P =simp=> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1101
  apply (unfold simp_implies_def)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1102
  apply (rule PQ)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1103
  apply assumption
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1104
  done
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1105
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1106
lemma simp_impliesE:
25388
5cd130251825 tuned specifications of 'notation';
wenzelm
parents: 25297
diff changeset
  1107
  assumes PQ: "PROP P =simp=> PROP Q"
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1108
  and P: "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1109
  and QR: "PROP Q \<Longrightarrow> PROP R"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1110
  shows "PROP R"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1111
  apply (rule QR)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1112
  apply (rule PQ [unfolded simp_implies_def])
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1113
  apply (rule P)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1114
  done
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1115
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1116
lemma simp_implies_cong:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1117
  assumes PP' :"PROP P \<equiv> PROP P'"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1118
  and P'QQ': "PROP P' \<Longrightarrow> (PROP Q \<equiv> PROP Q')"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1119
  shows "(PROP P =simp=> PROP Q) \<equiv> (PROP P' =simp=> PROP Q')"
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1120
proof (unfold simp_implies_def, rule equal_intr_rule)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1121
  assume PQ: "PROP P \<Longrightarrow> PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1122
  and P': "PROP P'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1123
  from PP' [symmetric] and P' have "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1124
    by (rule equal_elim_rule1)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1125
  then have "PROP Q" by (rule PQ)
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1126
  with P'QQ' [OF P'] show "PROP Q'" by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1127
next
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1128
  assume P'Q': "PROP P' \<Longrightarrow> PROP Q'"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1129
  and P: "PROP P"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1130
  from PP' and P have P': "PROP P'" by (rule equal_elim_rule1)
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1131
  then have "PROP Q'" by (rule P'Q')
16633
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1132
  with P'QQ' [OF P', symmetric] show "PROP Q"
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1133
    by (rule equal_elim_rule1)
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1134
qed
208ebc9311f2 Implemented trick (due to Tobias Nipkow) for fine-tuning simplification
berghofe
parents: 16587
diff changeset
  1135
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1136
lemma uncurry:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1137
  assumes "P \<longrightarrow> Q \<longrightarrow> R"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1138
  shows "P \<and> Q \<longrightarrow> R"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1139
  using assms by blast
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1140
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1141
lemma iff_allI:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1142
  assumes "\<And>x. P x = Q x"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1143
  shows "(\<forall>x. P x) = (\<forall>x. Q x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1144
  using assms by blast
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1145
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1146
lemma iff_exI:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1147
  assumes "\<And>x. P x = Q x"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1148
  shows "(\<exists>x. P x) = (\<exists>x. Q x)"
23553
af8ae54238f5 use hologic.ML in basic HOL context;
wenzelm
parents: 23530
diff changeset
  1149
  using assms by blast
20944
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1150
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1151
lemma all_comm:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1152
  "(\<forall>x y. P x y) = (\<forall>y x. P x y)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1153
  by blast
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1154
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1155
lemma ex_comm:
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1156
  "(\<exists>x y. P x y) = (\<exists>y x. P x y)"
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1157
  by blast
34b2c1bb7178 cleanup basic HOL bootstrap
haftmann
parents: 20833
diff changeset
  1158
48891
c0eafbd55de3 prefer ML_file over old uses;
wenzelm
parents: 48776
diff changeset
  1159
ML_file "Tools/simpdata.ML"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1160
ML \<open>open Simpdata\<close>
42455
6702c984bf5a modernized Quantifier1 simproc setup;
wenzelm
parents: 42453
diff changeset
  1161
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1162
setup \<open>
58826
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
  1163
  map_theory_simpset (put_simpset HOL_basic_ss) #>
2ed2eaabe3df modernized setup;
wenzelm
parents: 58775
diff changeset
  1164
  Simplifier.method_setup Splitter.split_modifiers
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1165
\<close>
42455
6702c984bf5a modernized Quantifier1 simproc setup;
wenzelm
parents: 42453
diff changeset
  1166
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1167
simproc_setup defined_Ex ("\<exists>x. P x") = \<open>fn _ => Quantifier1.rearrange_ex\<close>
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1168
simproc_setup defined_All ("\<forall>x. P x") = \<open>fn _ => Quantifier1.rearrange_all\<close>
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1169
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1170
text \<open>Simproc for proving @{text "(y = x) \<equiv> False"} from premise @{text "\<not> (x = y)"}:\<close>
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1171
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1172
simproc_setup neq ("x = y") = \<open>fn _ =>
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1173
let
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1174
  val neq_to_EQ_False = @{thm not_sym} RS @{thm Eq_FalseI};
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1175
  fun is_neq eq lhs rhs thm =
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1176
    (case Thm.prop_of thm of
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1177
      _ $ (Not $ (eq' $ l' $ r')) =>
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1178
        Not = HOLogic.Not andalso eq' = eq andalso
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1179
        r' aconv lhs andalso l' aconv rhs
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1180
    | _ => false);
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1181
  fun proc ss ct =
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1182
    (case Thm.term_of ct of
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1183
      eq $ lhs $ rhs =>
43597
b4a093e755db tuned signature;
wenzelm
parents: 43560
diff changeset
  1184
        (case find_first (is_neq eq lhs rhs) (Simplifier.prems_of ss) of
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1185
          SOME thm => SOME (thm RS neq_to_EQ_False)
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1186
        | NONE => NONE)
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1187
     | _ => NONE);
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1188
in proc end;
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1189
\<close>
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1190
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1191
simproc_setup let_simp ("Let x f") = \<open>
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1192
let
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1193
  val (f_Let_unfold, x_Let_unfold) =
59582
0fbed69ff081 tuned signature -- prefer qualified names;
wenzelm
parents: 59507
diff changeset
  1194
    let val [(_ $ (f $ x) $ _)] = Thm.prems_of @{thm Let_unfold}
59628
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1195
    in apply2 (Thm.cterm_of @{context}) (f, x) end
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1196
  val (f_Let_folded, x_Let_folded) =
59582
0fbed69ff081 tuned signature -- prefer qualified names;
wenzelm
parents: 59507
diff changeset
  1197
    let val [(_ $ (f $ x) $ _)] = Thm.prems_of @{thm Let_folded}
59628
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1198
    in apply2 (Thm.cterm_of @{context}) (f, x) end;
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1199
  val g_Let_folded =
59582
0fbed69ff081 tuned signature -- prefer qualified names;
wenzelm
parents: 59507
diff changeset
  1200
    let val [(_ $ _ $ (g $ _))] = Thm.prems_of @{thm Let_folded}
59628
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1201
    in Thm.cterm_of @{context} g end;
28741
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1202
  fun count_loose (Bound i) k = if i >= k then 1 else 0
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1203
    | count_loose (s $ t) k = count_loose s k + count_loose t k
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1204
    | count_loose (Abs (_, _, t)) k = count_loose  t (k + 1)
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1205
    | count_loose _ _ = 0;
1b257449f804 simproc for let
haftmann
parents: 28699
diff changeset
  1206
  fun is_trivial_let (Const (@{const_name Let}, _) $ x $ t) =
59628
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1207
    (case t of
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1208
      Abs (_, _, t') => count_loose t' 0 <= 1
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1209
    | _ => true);
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1210
in
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1211
  fn _ => fn ctxt => fn ct =>
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1212
    if is_trivial_let (Thm.term_of ct)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1213
    then SOME @{thm Let_def} (*no or one ocurrence of bound variable*)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1214
    else
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1215
      let (*Norbert Schirmer's case*)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1216
        val t = Thm.term_of ct;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1217
        val ([t'], ctxt') = Variable.import_terms false [t] ctxt;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1218
      in
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1219
        Option.map (hd o Variable.export ctxt' ctxt o single)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1220
          (case t' of Const (@{const_name Let},_) $ x $ f => (* x and f are already in normal form *)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1221
            if is_Free x orelse is_Bound x orelse is_Const x
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1222
            then SOME @{thm Let_def}
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1223
            else
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1224
              let
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1225
                val n = case f of (Abs (x, _, _)) => x | _ => "x";
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1226
                val cx = Thm.cterm_of ctxt x;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1227
                val xT = Thm.typ_of_cterm cx;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1228
                val cf = Thm.cterm_of ctxt f;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1229
                val fx_g = Simplifier.rewrite ctxt (Thm.apply cf cx);
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1230
                val (_ $ _ $ g) = Thm.prop_of fx_g;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1231
                val g' = abstract_over (x, g);
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1232
                val abs_g'= Abs (n, xT, g');
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1233
              in
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1234
                if g aconv g' then
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1235
                  let
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1236
                    val rl =
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1237
                      cterm_instantiate [(f_Let_unfold, cf), (x_Let_unfold, cx)] @{thm Let_unfold};
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1238
                  in SOME (rl OF [fx_g]) end
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1239
                else if (Envir.beta_eta_contract f) aconv (Envir.beta_eta_contract abs_g')
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1240
                then NONE (*avoid identity conversion*)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1241
                else
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1242
                  let
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1243
                    val g'x = abs_g' $ x;
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1244
                    val g_g'x = Thm.symmetric (Thm.beta_conversion false (Thm.cterm_of ctxt g'x));
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1245
                    val rl =
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1246
                      @{thm Let_folded} |> cterm_instantiate
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1247
                        [(f_Let_folded, Thm.cterm_of ctxt f),
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1248
                         (x_Let_folded, cx),
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1249
                         (g_Let_folded, Thm.cterm_of ctxt abs_g')];
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1250
                  in SOME (rl OF [Thm.transitive fx_g g_g'x]) end
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1251
              end
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1252
          | _ => NONE)
2b15625b85fc clarified context;
wenzelm
parents: 59621
diff changeset
  1253
      end
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1254
end\<close>
24035
74c032aea9ed simplified ResAtpset via NamedThmsFun;
wenzelm
parents: 23948
diff changeset
  1255
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1256
lemma True_implies_equals: "(True \<Longrightarrow> PROP P) \<equiv> PROP P"
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1257
proof
23389
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
  1258
  assume "True \<Longrightarrow> PROP P"
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
  1259
  from this [OF TrueI] show "PROP P" .
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1260
next
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1261
  assume "PROP P"
23389
aaca6a8e5414 tuned proofs: avoid implicit prems;
wenzelm
parents: 23263
diff changeset
  1262
  then show "PROP P" .
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1263
qed
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1264
59864
c777743294e1 added lemmas
nipkow
parents: 59779
diff changeset
  1265
lemma implies_True_equals: "(PROP P \<Longrightarrow> True) \<equiv> Trueprop True"
c777743294e1 added lemmas
nipkow
parents: 59779
diff changeset
  1266
by default (intro TrueI)
c777743294e1 added lemmas
nipkow
parents: 59779
diff changeset
  1267
c777743294e1 added lemmas
nipkow
parents: 59779
diff changeset
  1268
lemma False_implies_equals: "(False \<Longrightarrow> P) \<equiv> Trueprop True"
c777743294e1 added lemmas
nipkow
parents: 59779
diff changeset
  1269
by default simp_all
c777743294e1 added lemmas
nipkow
parents: 59779
diff changeset
  1270
60183
4cd4c204578c undid 6d7b7a037e8d because it does not help but slows simplification down by up to 5% (AODV)
nipkow
parents: 60169
diff changeset
  1271
(* This is not made a simp rule because it does not improve any proofs
4cd4c204578c undid 6d7b7a037e8d because it does not help but slows simplification down by up to 5% (AODV)
nipkow
parents: 60169
diff changeset
  1272
   but slows some AFP entries down by 5% (cpu time). May 2015 *)
60169
5ef8ed685965 swap False to the right in assumptions to be eliminated at the right end
nipkow
parents: 60151
diff changeset
  1273
lemma implies_False_swap: "NO_MATCH (Trueprop False) P \<Longrightarrow>
5ef8ed685965 swap False to the right in assumptions to be eliminated at the right end
nipkow
parents: 60151
diff changeset
  1274
  (False \<Longrightarrow> PROP P \<Longrightarrow> PROP Q) \<equiv> (PROP P \<Longrightarrow> False \<Longrightarrow> PROP Q)"
5ef8ed685965 swap False to the right in assumptions to be eliminated at the right end
nipkow
parents: 60151
diff changeset
  1275
by(rule swap_prems_eq)
5ef8ed685965 swap False to the right in assumptions to be eliminated at the right end
nipkow
parents: 60151
diff changeset
  1276
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1277
lemma ex_simps:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1278
  "\<And>P Q. (\<exists>x. P x \<and> Q)   = ((\<exists>x. P x) \<and> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1279
  "\<And>P Q. (\<exists>x. P \<and> Q x)   = (P \<and> (\<exists>x. Q x))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1280
  "\<And>P Q. (\<exists>x. P x \<or> Q)   = ((\<exists>x. P x) \<or> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1281
  "\<And>P Q. (\<exists>x. P \<or> Q x)   = (P \<or> (\<exists>x. Q x))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1282
  "\<And>P Q. (\<exists>x. P x \<longrightarrow> Q) = ((\<forall>x. P x) \<longrightarrow> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1283
  "\<And>P Q. (\<exists>x. P \<longrightarrow> Q x) = (P \<longrightarrow> (\<exists>x. Q x))"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1284
  -- \<open>Miniscoping: pushing in existential quantifiers.\<close>
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1285
  by (iprover | blast)+
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1286
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1287
lemma all_simps:
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1288
  "\<And>P Q. (\<forall>x. P x \<and> Q)   = ((\<forall>x. P x) \<and> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1289
  "\<And>P Q. (\<forall>x. P \<and> Q x)   = (P \<and> (\<forall>x. Q x))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1290
  "\<And>P Q. (\<forall>x. P x \<or> Q)   = ((\<forall>x. P x) \<or> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1291
  "\<And>P Q. (\<forall>x. P \<or> Q x)   = (P \<or> (\<forall>x. Q x))"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1292
  "\<And>P Q. (\<forall>x. P x \<longrightarrow> Q) = ((\<exists>x. P x) \<longrightarrow> Q)"
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1293
  "\<And>P Q. (\<forall>x. P \<longrightarrow> Q x) = (P \<longrightarrow> (\<forall>x. Q x))"
60758
d8d85a8172b5 isabelle update_cartouches;
wenzelm
parents: 60183
diff changeset
  1294
  -- \<open>Miniscoping: pushing in universal quantifiers.\<close>
21151
25bd46916c12 simplified reasoning tools setup
haftmann
parents: 21112
diff changeset
  1295
  by (iprover | blast)+
15481
fc075ae929e4 the new subst tactic, by Lucas Dixon
paulson
parents: 15423
diff changeset
  1296
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1297
lemmas [simp] =
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1298
  triv_forall_equality (*prunes params*)
60143
2cd31c81e0e7 added simp rules for ==>
nipkow
parents: 59990
diff changeset
  1299
  True_implies_equals implies_True_equals (*prune True in asms*)
60183
4cd4c204578c undid 6d7b7a037e8d because it does not help but slows simplification down by up to 5% (AODV)
nipkow
parents: 60169
diff changeset
  1300
  False_implies_equals (*prune False in asms*)
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1301
  if_True
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1302
  if_False
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1303
  if_cancel
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1304
  if_eq_cancel
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1305
  imp_disjL
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1306
  (*In general it seems wrong to add distributive laws by default: they
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1307
    might cause exponential blow-up.  But imp_disjL has been in for a while
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1308
    and cannot be removed without affecting existing proofs.  Moreover,
60759
36d9f215c982 more symbols;
wenzelm
parents: 60758
diff changeset
  1309
    rewriting by "(P \<or> Q \<longrightarrow> R) = ((P \<longrightarrow> R) \<and> (Q \<longrightarrow> R))" might be justified on the
20973
0b8e436ed071 cleaned up HOL bootstrap
haftmann
parents: 20944
diff changeset
  1310
    grounds that it allows simplification of R in the two cases.*)
21671
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1311
  conj_assoc
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1312
  disj_assoc
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1313
  de_Morgan_conj
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1314
  de_Morgan_disj
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1315
  imp_disj1
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1316
  imp_disj2
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1317
  not_imp
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1318
  disj_not1
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1319
  not_all
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1320
  not_ex
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1321
  cases_simp
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1322
  the_eq_trivial
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1323
  the_sym_eq_trivial
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 21547
diff changeset
  1324
  ex_simps
f7d652ffef09 removed legacy ML bindings;
wenzelm
parents: 2154