src/HOL/Hilbert_Choice.thy
author nipkow
Sun Dec 22 10:43:43 2002 +0100 (2002-12-22)
changeset 13763 f94b569cd610
parent 13585 db4005b40cc6
child 13764 3e180bf68496
permissions -rw-r--r--
added print translations tha avoid eta contraction for important binders.
paulson@11451
     1
(*  Title:      HOL/Hilbert_Choice.thy
paulson@11451
     2
    ID:         $Id$
paulson@11451
     3
    Author:     Lawrence C Paulson
paulson@11451
     4
    Copyright   2001  University of Cambridge
wenzelm@12023
     5
*)
paulson@11451
     6
wenzelm@12023
     7
header {* Hilbert's epsilon-operator and everything to do with the Axiom of Choice *}
paulson@11451
     8
paulson@11451
     9
theory Hilbert_Choice = NatArith
paulson@11451
    10
files ("Hilbert_Choice_lemmas.ML") ("meson_lemmas.ML") ("Tools/meson.ML"):
paulson@11451
    11
wenzelm@12298
    12
wenzelm@12298
    13
subsection {* Hilbert's epsilon *}
wenzelm@12298
    14
paulson@11451
    15
consts
paulson@11451
    16
  Eps           :: "('a => bool) => 'a"
paulson@11451
    17
paulson@11451
    18
syntax (input)
wenzelm@12298
    19
  "_Eps"        :: "[pttrn, bool] => 'a"    ("(3\<epsilon>_./ _)" [0, 10] 10)
paulson@11451
    20
syntax (HOL)
wenzelm@12298
    21
  "_Eps"        :: "[pttrn, bool] => 'a"    ("(3@ _./ _)" [0, 10] 10)
paulson@11451
    22
syntax
wenzelm@12298
    23
  "_Eps"        :: "[pttrn, bool] => 'a"    ("(3SOME _./ _)" [0, 10] 10)
paulson@11451
    24
translations
nipkow@13763
    25
  "SOME x. P" => "Eps (%x. P)"
nipkow@13763
    26
nipkow@13763
    27
print_translation {*
nipkow@13763
    28
(* to avoid eta-contraction of body *)
nipkow@13763
    29
[("Eps", fn [Abs abs] =>
nipkow@13763
    30
     let val (x,t) = atomic_abs_tr' abs
nipkow@13763
    31
     in Syntax.const "_Eps" $ x $ t end)]
nipkow@13763
    32
*}
paulson@11451
    33
wenzelm@12298
    34
axioms
wenzelm@12298
    35
  someI: "P (x::'a) ==> P (SOME x. P x)"
paulson@11451
    36
paulson@11451
    37
wenzelm@12298
    38
constdefs
wenzelm@12298
    39
  inv :: "('a => 'b) => ('b => 'a)"
wenzelm@12298
    40
  "inv(f :: 'a => 'b) == %y. SOME x. f x = y"
paulson@11454
    41
wenzelm@12298
    42
  Inv :: "'a set => ('a => 'b) => ('b => 'a)"
wenzelm@12298
    43
  "Inv A f == %x. SOME y. y : A & f y = x"
paulson@11451
    44
paulson@11451
    45
paulson@11451
    46
use "Hilbert_Choice_lemmas.ML"
wenzelm@12372
    47
declare someI_ex [elim?];
wenzelm@12372
    48
paulson@13585
    49
lemma Inv_mem: "[| f ` A = B;  x \<in> B |] ==> Inv A f x \<in> A"
paulson@13585
    50
apply (unfold Inv_def)
paulson@13585
    51
apply (fast intro: someI2)
paulson@13585
    52
done
paulson@11451
    53
wenzelm@12298
    54
lemma tfl_some: "\<forall>P x. P x --> P (Eps P)"
wenzelm@12298
    55
  -- {* dynamically-scoped fact for TFL *}
wenzelm@12298
    56
  by (blast intro: someI)
paulson@11451
    57
wenzelm@12298
    58
wenzelm@12298
    59
subsection {* Least value operator *}
paulson@11451
    60
paulson@11451
    61
constdefs
wenzelm@12298
    62
  LeastM :: "['a => 'b::ord, 'a => bool] => 'a"
wenzelm@12298
    63
  "LeastM m P == SOME x. P x & (ALL y. P y --> m x <= m y)"
paulson@11451
    64
paulson@11451
    65
syntax
wenzelm@12298
    66
  "_LeastM" :: "[pttrn, 'a => 'b::ord, bool] => 'a"    ("LEAST _ WRT _. _" [0, 4, 10] 10)
paulson@11451
    67
translations
wenzelm@12298
    68
  "LEAST x WRT m. P" == "LeastM m (%x. P)"
paulson@11451
    69
paulson@11451
    70
lemma LeastMI2:
wenzelm@12298
    71
  "P x ==> (!!y. P y ==> m x <= m y)
wenzelm@12298
    72
    ==> (!!x. P x ==> \<forall>y. P y --> m x \<le> m y ==> Q x)
wenzelm@12298
    73
    ==> Q (LeastM m P)"
wenzelm@12298
    74
  apply (unfold LeastM_def)
wenzelm@12298
    75
  apply (rule someI2_ex)
wenzelm@12298
    76
   apply blast
wenzelm@12298
    77
  apply blast
wenzelm@12298
    78
  done
paulson@11451
    79
paulson@11451
    80
lemma LeastM_equality:
wenzelm@12298
    81
  "P k ==> (!!x. P x ==> m k <= m x)
wenzelm@12298
    82
    ==> m (LEAST x WRT m. P x) = (m k::'a::order)"
wenzelm@12298
    83
  apply (rule LeastMI2)
wenzelm@12298
    84
    apply assumption
wenzelm@12298
    85
   apply blast
wenzelm@12298
    86
  apply (blast intro!: order_antisym)
wenzelm@12298
    87
  done
paulson@11451
    88
paulson@11454
    89
lemma wf_linord_ex_has_least:
wenzelm@12298
    90
  "wf r ==> ALL x y. ((x,y):r^+) = ((y,x)~:r^*) ==> P k
wenzelm@12298
    91
    ==> EX x. P x & (!y. P y --> (m x,m y):r^*)"
wenzelm@12298
    92
  apply (drule wf_trancl [THEN wf_eq_minimal [THEN iffD1]])
wenzelm@12298
    93
  apply (drule_tac x = "m`Collect P" in spec)
wenzelm@12298
    94
  apply force
wenzelm@12298
    95
  done
paulson@11454
    96
paulson@11454
    97
lemma ex_has_least_nat:
wenzelm@12298
    98
    "P k ==> EX x. P x & (ALL y. P y --> m x <= (m y::nat))"
wenzelm@12298
    99
  apply (simp only: pred_nat_trancl_eq_le [symmetric])
wenzelm@12298
   100
  apply (rule wf_pred_nat [THEN wf_linord_ex_has_least])
wenzelm@12298
   101
   apply (simp add: less_eq not_le_iff_less pred_nat_trancl_eq_le)
wenzelm@12298
   102
  apply assumption
wenzelm@12298
   103
  done
paulson@11454
   104
wenzelm@12298
   105
lemma LeastM_nat_lemma:
wenzelm@12298
   106
    "P k ==> P (LeastM m P) & (ALL y. P y --> m (LeastM m P) <= (m y::nat))"
wenzelm@12298
   107
  apply (unfold LeastM_def)
wenzelm@12298
   108
  apply (rule someI_ex)
wenzelm@12298
   109
  apply (erule ex_has_least_nat)
wenzelm@12298
   110
  done
paulson@11454
   111
paulson@11454
   112
lemmas LeastM_natI = LeastM_nat_lemma [THEN conjunct1, standard]
paulson@11454
   113
paulson@11454
   114
lemma LeastM_nat_le: "P x ==> m (LeastM m P) <= (m x::nat)"
wenzelm@12298
   115
  apply (rule LeastM_nat_lemma [THEN conjunct2, THEN spec, THEN mp])
wenzelm@12298
   116
   apply assumption
wenzelm@12298
   117
  apply assumption
wenzelm@12298
   118
  done
paulson@11454
   119
paulson@11451
   120
wenzelm@12298
   121
subsection {* Greatest value operator *}
paulson@11451
   122
paulson@11451
   123
constdefs
wenzelm@12298
   124
  GreatestM :: "['a => 'b::ord, 'a => bool] => 'a"
wenzelm@12298
   125
  "GreatestM m P == SOME x. P x & (ALL y. P y --> m y <= m x)"
wenzelm@12298
   126
wenzelm@12298
   127
  Greatest :: "('a::ord => bool) => 'a"    (binder "GREATEST " 10)
wenzelm@12298
   128
  "Greatest == GreatestM (%x. x)"
paulson@11451
   129
paulson@11451
   130
syntax
wenzelm@12298
   131
  "_GreatestM" :: "[pttrn, 'a=>'b::ord, bool] => 'a"
wenzelm@12298
   132
      ("GREATEST _ WRT _. _" [0, 4, 10] 10)
paulson@11451
   133
paulson@11451
   134
translations
wenzelm@12298
   135
  "GREATEST x WRT m. P" == "GreatestM m (%x. P)"
paulson@11451
   136
paulson@11451
   137
lemma GreatestMI2:
wenzelm@12298
   138
  "P x ==> (!!y. P y ==> m y <= m x)
wenzelm@12298
   139
    ==> (!!x. P x ==> \<forall>y. P y --> m y \<le> m x ==> Q x)
wenzelm@12298
   140
    ==> Q (GreatestM m P)"
wenzelm@12298
   141
  apply (unfold GreatestM_def)
wenzelm@12298
   142
  apply (rule someI2_ex)
wenzelm@12298
   143
   apply blast
wenzelm@12298
   144
  apply blast
wenzelm@12298
   145
  done
paulson@11451
   146
paulson@11451
   147
lemma GreatestM_equality:
wenzelm@12298
   148
 "P k ==> (!!x. P x ==> m x <= m k)
wenzelm@12298
   149
    ==> m (GREATEST x WRT m. P x) = (m k::'a::order)"
wenzelm@12298
   150
  apply (rule_tac m = m in GreatestMI2)
wenzelm@12298
   151
    apply assumption
wenzelm@12298
   152
   apply blast
wenzelm@12298
   153
  apply (blast intro!: order_antisym)
wenzelm@12298
   154
  done
paulson@11451
   155
paulson@11451
   156
lemma Greatest_equality:
wenzelm@12298
   157
  "P (k::'a::order) ==> (!!x. P x ==> x <= k) ==> (GREATEST x. P x) = k"
wenzelm@12298
   158
  apply (unfold Greatest_def)
wenzelm@12298
   159
  apply (erule GreatestM_equality)
wenzelm@12298
   160
  apply blast
wenzelm@12298
   161
  done
paulson@11451
   162
paulson@11451
   163
lemma ex_has_greatest_nat_lemma:
wenzelm@12298
   164
  "P k ==> ALL x. P x --> (EX y. P y & ~ ((m y::nat) <= m x))
wenzelm@12298
   165
    ==> EX y. P y & ~ (m y < m k + n)"
wenzelm@12298
   166
  apply (induct_tac n)
wenzelm@12298
   167
   apply force
wenzelm@12298
   168
  apply (force simp add: le_Suc_eq)
wenzelm@12298
   169
  done
paulson@11451
   170
wenzelm@12298
   171
lemma ex_has_greatest_nat:
wenzelm@12298
   172
  "P k ==> ALL y. P y --> m y < b
wenzelm@12298
   173
    ==> EX x. P x & (ALL y. P y --> (m y::nat) <= m x)"
wenzelm@12298
   174
  apply (rule ccontr)
wenzelm@12298
   175
  apply (cut_tac P = P and n = "b - m k" in ex_has_greatest_nat_lemma)
wenzelm@12298
   176
    apply (subgoal_tac [3] "m k <= b")
wenzelm@12298
   177
     apply auto
wenzelm@12298
   178
  done
paulson@11451
   179
wenzelm@12298
   180
lemma GreatestM_nat_lemma:
wenzelm@12298
   181
  "P k ==> ALL y. P y --> m y < b
wenzelm@12298
   182
    ==> P (GreatestM m P) & (ALL y. P y --> (m y::nat) <= m (GreatestM m P))"
wenzelm@12298
   183
  apply (unfold GreatestM_def)
wenzelm@12298
   184
  apply (rule someI_ex)
wenzelm@12298
   185
  apply (erule ex_has_greatest_nat)
wenzelm@12298
   186
  apply assumption
wenzelm@12298
   187
  done
paulson@11451
   188
paulson@11451
   189
lemmas GreatestM_natI = GreatestM_nat_lemma [THEN conjunct1, standard]
paulson@11451
   190
wenzelm@12298
   191
lemma GreatestM_nat_le:
wenzelm@12298
   192
  "P x ==> ALL y. P y --> m y < b
wenzelm@12298
   193
    ==> (m x::nat) <= m (GreatestM m P)"
wenzelm@12298
   194
  apply (blast dest: GreatestM_nat_lemma [THEN conjunct2, THEN spec])
wenzelm@12298
   195
  done
wenzelm@12298
   196
wenzelm@12298
   197
wenzelm@12298
   198
text {* \medskip Specialization to @{text GREATEST}. *}
wenzelm@12298
   199
wenzelm@12298
   200
lemma GreatestI: "P (k::nat) ==> ALL y. P y --> y < b ==> P (GREATEST x. P x)"
wenzelm@12298
   201
  apply (unfold Greatest_def)
wenzelm@12298
   202
  apply (rule GreatestM_natI)
wenzelm@12298
   203
   apply auto
wenzelm@12298
   204
  done
paulson@11451
   205
wenzelm@12298
   206
lemma Greatest_le:
wenzelm@12298
   207
    "P x ==> ALL y. P y --> y < b ==> (x::nat) <= (GREATEST x. P x)"
wenzelm@12298
   208
  apply (unfold Greatest_def)
wenzelm@12298
   209
  apply (rule GreatestM_nat_le)
wenzelm@12298
   210
   apply auto
wenzelm@12298
   211
  done
wenzelm@12298
   212
wenzelm@12298
   213
wenzelm@12298
   214
subsection {* The Meson proof procedure *}
paulson@11451
   215
wenzelm@12298
   216
subsubsection {* Negation Normal Form *}
wenzelm@12298
   217
wenzelm@12298
   218
text {* de Morgan laws *}
wenzelm@12298
   219
wenzelm@12298
   220
lemma meson_not_conjD: "~(P&Q) ==> ~P | ~Q"
wenzelm@12298
   221
  and meson_not_disjD: "~(P|Q) ==> ~P & ~Q"
wenzelm@12298
   222
  and meson_not_notD: "~~P ==> P"
wenzelm@12298
   223
  and meson_not_allD: "!!P. ~(ALL x. P(x)) ==> EX x. ~P(x)"
wenzelm@12298
   224
  and meson_not_exD: "!!P. ~(EX x. P(x)) ==> ALL x. ~P(x)"
wenzelm@12298
   225
  by fast+
paulson@11451
   226
wenzelm@12298
   227
text {* Removal of @{text "-->"} and @{text "<->"} (positive and
wenzelm@12298
   228
negative occurrences) *}
wenzelm@12298
   229
wenzelm@12298
   230
lemma meson_imp_to_disjD: "P-->Q ==> ~P | Q"
wenzelm@12298
   231
  and meson_not_impD: "~(P-->Q) ==> P & ~Q"
wenzelm@12298
   232
  and meson_iff_to_disjD: "P=Q ==> (~P | Q) & (~Q | P)"
wenzelm@12298
   233
  and meson_not_iffD: "~(P=Q) ==> (P | Q) & (~P | ~Q)"
wenzelm@12298
   234
    -- {* Much more efficient than @{prop "(P & ~Q) | (Q & ~P)"} for computing CNF *}
wenzelm@12298
   235
  by fast+
wenzelm@12298
   236
wenzelm@12298
   237
wenzelm@12298
   238
subsubsection {* Pulling out the existential quantifiers *}
wenzelm@12298
   239
wenzelm@12298
   240
text {* Conjunction *}
wenzelm@12298
   241
wenzelm@12298
   242
lemma meson_conj_exD1: "!!P Q. (EX x. P(x)) & Q ==> EX x. P(x) & Q"
wenzelm@12298
   243
  and meson_conj_exD2: "!!P Q. P & (EX x. Q(x)) ==> EX x. P & Q(x)"
wenzelm@12298
   244
  by fast+
wenzelm@12298
   245
paulson@11451
   246
wenzelm@12298
   247
text {* Disjunction *}
wenzelm@12298
   248
wenzelm@12298
   249
lemma meson_disj_exD: "!!P Q. (EX x. P(x)) | (EX x. Q(x)) ==> EX x. P(x) | Q(x)"
wenzelm@12298
   250
  -- {* DO NOT USE with forall-Skolemization: makes fewer schematic variables!! *}
wenzelm@12298
   251
  -- {* With ex-Skolemization, makes fewer Skolem constants *}
wenzelm@12298
   252
  and meson_disj_exD1: "!!P Q. (EX x. P(x)) | Q ==> EX x. P(x) | Q"
wenzelm@12298
   253
  and meson_disj_exD2: "!!P Q. P | (EX x. Q(x)) ==> EX x. P | Q(x)"
wenzelm@12298
   254
  by fast+
wenzelm@12298
   255
paulson@11451
   256
wenzelm@12298
   257
subsubsection {* Generating clauses for the Meson Proof Procedure *}
wenzelm@12298
   258
wenzelm@12298
   259
text {* Disjunctions *}
wenzelm@12298
   260
wenzelm@12298
   261
lemma meson_disj_assoc: "(P|Q)|R ==> P|(Q|R)"
wenzelm@12298
   262
  and meson_disj_comm: "P|Q ==> Q|P"
wenzelm@12298
   263
  and meson_disj_FalseD1: "False|P ==> P"
wenzelm@12298
   264
  and meson_disj_FalseD2: "P|False ==> P"
wenzelm@12298
   265
  by fast+
paulson@11451
   266
paulson@11451
   267
use "meson_lemmas.ML"
paulson@11451
   268
use "Tools/meson.ML"
paulson@11451
   269
setup meson_setup
paulson@11451
   270
paulson@11451
   271
end