src/HOL/Hilbert_Choice.thy
author paulson
Thu Jan 04 17:55:12 2007 +0100 (2007-01-04)
changeset 21999 0cf192e489e2
parent 21243 afffe1f72143
child 22690 0b08f218f260
permissions -rw-r--r--
improvements to proof reconstruction. Some files loaded in a different order
paulson@11451
     1
(*  Title:      HOL/Hilbert_Choice.thy
paulson@14760
     2
    ID: $Id$
paulson@11451
     3
    Author:     Lawrence C Paulson
paulson@11451
     4
    Copyright   2001  University of Cambridge
wenzelm@12023
     5
*)
paulson@11451
     6
paulson@14760
     7
header {* Hilbert's Epsilon-Operator and the Axiom of Choice *}
paulson@11451
     8
nipkow@15131
     9
theory Hilbert_Choice
wenzelm@21243
    10
imports Nat
haftmann@16417
    11
uses ("Tools/meson.ML") ("Tools/specification_package.ML")
nipkow@15131
    12
begin
wenzelm@12298
    13
wenzelm@12298
    14
subsection {* Hilbert's epsilon *}
wenzelm@12298
    15
paulson@11451
    16
consts
paulson@11451
    17
  Eps           :: "('a => bool) => 'a"
paulson@11451
    18
wenzelm@14872
    19
syntax (epsilon)
wenzelm@14872
    20
  "_Eps"        :: "[pttrn, bool] => 'a"    ("(3\<some>_./ _)" [0, 10] 10)
paulson@11451
    21
syntax (HOL)
wenzelm@12298
    22
  "_Eps"        :: "[pttrn, bool] => 'a"    ("(3@ _./ _)" [0, 10] 10)
paulson@11451
    23
syntax
wenzelm@12298
    24
  "_Eps"        :: "[pttrn, bool] => 'a"    ("(3SOME _./ _)" [0, 10] 10)
paulson@11451
    25
translations
nipkow@13764
    26
  "SOME x. P" == "Eps (%x. P)"
nipkow@13763
    27
nipkow@13763
    28
print_translation {*
nipkow@13763
    29
(* to avoid eta-contraction of body *)
nipkow@13763
    30
[("Eps", fn [Abs abs] =>
nipkow@13763
    31
     let val (x,t) = atomic_abs_tr' abs
nipkow@13763
    32
     in Syntax.const "_Eps" $ x $ t end)]
nipkow@13763
    33
*}
paulson@11451
    34
wenzelm@12298
    35
axioms
wenzelm@12298
    36
  someI: "P (x::'a) ==> P (SOME x. P x)"
wenzelm@17702
    37
finalconsts
wenzelm@17702
    38
  Eps
paulson@11451
    39
paulson@11451
    40
wenzelm@12298
    41
constdefs
wenzelm@12298
    42
  inv :: "('a => 'b) => ('b => 'a)"
wenzelm@12298
    43
  "inv(f :: 'a => 'b) == %y. SOME x. f x = y"
paulson@11454
    44
wenzelm@12298
    45
  Inv :: "'a set => ('a => 'b) => ('b => 'a)"
paulson@14760
    46
  "Inv A f == %x. SOME y. y \<in> A & f y = x"
paulson@14760
    47
paulson@14760
    48
paulson@14760
    49
subsection {*Hilbert's Epsilon-operator*}
paulson@14760
    50
paulson@14760
    51
text{*Easier to apply than @{text someI} if the witness comes from an
paulson@14760
    52
existential formula*}
paulson@14760
    53
lemma someI_ex [elim?]: "\<exists>x. P x ==> P (SOME x. P x)"
paulson@14760
    54
apply (erule exE)
paulson@14760
    55
apply (erule someI)
paulson@14760
    56
done
paulson@14760
    57
paulson@14760
    58
text{*Easier to apply than @{text someI} because the conclusion has only one
paulson@14760
    59
occurrence of @{term P}.*}
paulson@14760
    60
lemma someI2: "[| P a;  !!x. P x ==> Q x |] ==> Q (SOME x. P x)"
paulson@14760
    61
by (blast intro: someI)
paulson@14760
    62
paulson@14760
    63
text{*Easier to apply than @{text someI2} if the witness comes from an
paulson@14760
    64
existential formula*}
paulson@14760
    65
lemma someI2_ex: "[| \<exists>a. P a; !!x. P x ==> Q x |] ==> Q (SOME x. P x)"
paulson@14760
    66
by (blast intro: someI2)
paulson@14760
    67
paulson@14760
    68
lemma some_equality [intro]:
paulson@14760
    69
     "[| P a;  !!x. P x ==> x=a |] ==> (SOME x. P x) = a"
paulson@14760
    70
by (blast intro: someI2)
paulson@14760
    71
paulson@14760
    72
lemma some1_equality: "[| EX!x. P x; P a |] ==> (SOME x. P x) = a"
paulson@14760
    73
by (blast intro: some_equality)
paulson@14760
    74
paulson@14760
    75
lemma some_eq_ex: "P (SOME x. P x) =  (\<exists>x. P x)"
paulson@14760
    76
by (blast intro: someI)
paulson@14760
    77
paulson@14760
    78
lemma some_eq_trivial [simp]: "(SOME y. y=x) = x"
paulson@14760
    79
apply (rule some_equality)
paulson@14760
    80
apply (rule refl, assumption)
paulson@14760
    81
done
paulson@14760
    82
paulson@14760
    83
lemma some_sym_eq_trivial [simp]: "(SOME y. x=y) = x"
paulson@14760
    84
apply (rule some_equality)
paulson@14760
    85
apply (rule refl)
paulson@14760
    86
apply (erule sym)
paulson@14760
    87
done
paulson@14760
    88
paulson@14760
    89
paulson@14760
    90
subsection{*Axiom of Choice, Proved Using the Description Operator*}
paulson@14760
    91
paulson@14760
    92
text{*Used in @{text "Tools/meson.ML"}*}
paulson@14760
    93
lemma choice: "\<forall>x. \<exists>y. Q x y ==> \<exists>f. \<forall>x. Q x (f x)"
paulson@14760
    94
by (fast elim: someI)
paulson@14760
    95
paulson@14760
    96
lemma bchoice: "\<forall>x\<in>S. \<exists>y. Q x y ==> \<exists>f. \<forall>x\<in>S. Q x (f x)"
paulson@14760
    97
by (fast elim: someI)
paulson@14760
    98
paulson@14760
    99
paulson@14760
   100
subsection {*Function Inverse*}
paulson@14760
   101
paulson@14760
   102
lemma inv_id [simp]: "inv id = id"
paulson@14760
   103
by (simp add: inv_def id_def)
paulson@14760
   104
paulson@14760
   105
text{*A one-to-one function has an inverse.*}
paulson@14760
   106
lemma inv_f_f [simp]: "inj f ==> inv f (f x) = x"
paulson@14760
   107
by (simp add: inv_def inj_eq)
paulson@14760
   108
paulson@14760
   109
lemma inv_f_eq: "[| inj f;  f x = y |] ==> inv f y = x"
paulson@14760
   110
apply (erule subst)
paulson@14760
   111
apply (erule inv_f_f)
paulson@14760
   112
done
paulson@14760
   113
paulson@14760
   114
lemma inj_imp_inv_eq: "[| inj f; \<forall>x. f(g x) = x |] ==> inv f = g"
paulson@14760
   115
by (blast intro: ext inv_f_eq)
paulson@14760
   116
paulson@14760
   117
text{*But is it useful?*}
paulson@14760
   118
lemma inj_transfer:
paulson@14760
   119
  assumes injf: "inj f" and minor: "!!y. y \<in> range(f) ==> P(inv f y)"
paulson@14760
   120
  shows "P x"
paulson@14760
   121
proof -
paulson@14760
   122
  have "f x \<in> range f" by auto
paulson@14760
   123
  hence "P(inv f (f x))" by (rule minor)
paulson@14760
   124
  thus "P x" by (simp add: inv_f_f [OF injf])
paulson@14760
   125
qed
paulson@11451
   126
paulson@11451
   127
paulson@14760
   128
lemma inj_iff: "(inj f) = (inv f o f = id)"
paulson@14760
   129
apply (simp add: o_def expand_fun_eq)
paulson@14760
   130
apply (blast intro: inj_on_inverseI inv_f_f)
paulson@14760
   131
done
paulson@14760
   132
paulson@14760
   133
lemma inj_imp_surj_inv: "inj f ==> surj (inv f)"
paulson@14760
   134
by (blast intro: surjI inv_f_f)
paulson@14760
   135
paulson@14760
   136
lemma f_inv_f: "y \<in> range(f) ==> f(inv f y) = y"
paulson@14760
   137
apply (simp add: inv_def)
paulson@14760
   138
apply (fast intro: someI)
paulson@14760
   139
done
paulson@14760
   140
paulson@14760
   141
lemma surj_f_inv_f: "surj f ==> f(inv f y) = y"
paulson@14760
   142
by (simp add: f_inv_f surj_range)
paulson@14760
   143
paulson@14760
   144
lemma inv_injective:
paulson@14760
   145
  assumes eq: "inv f x = inv f y"
paulson@14760
   146
      and x: "x: range f"
paulson@14760
   147
      and y: "y: range f"
paulson@14760
   148
  shows "x=y"
paulson@14760
   149
proof -
paulson@14760
   150
  have "f (inv f x) = f (inv f y)" using eq by simp
paulson@14760
   151
  thus ?thesis by (simp add: f_inv_f x y) 
paulson@14760
   152
qed
paulson@14760
   153
paulson@14760
   154
lemma inj_on_inv: "A <= range(f) ==> inj_on (inv f) A"
paulson@14760
   155
by (fast intro: inj_onI elim: inv_injective injD)
paulson@14760
   156
paulson@14760
   157
lemma surj_imp_inj_inv: "surj f ==> inj (inv f)"
paulson@14760
   158
by (simp add: inj_on_inv surj_range)
paulson@14760
   159
paulson@14760
   160
lemma surj_iff: "(surj f) = (f o inv f = id)"
paulson@14760
   161
apply (simp add: o_def expand_fun_eq)
paulson@14760
   162
apply (blast intro: surjI surj_f_inv_f)
paulson@14760
   163
done
paulson@14760
   164
paulson@14760
   165
lemma surj_imp_inv_eq: "[| surj f; \<forall>x. g(f x) = x |] ==> inv f = g"
paulson@14760
   166
apply (rule ext)
paulson@14760
   167
apply (drule_tac x = "inv f x" in spec)
paulson@14760
   168
apply (simp add: surj_f_inv_f)
paulson@14760
   169
done
paulson@14760
   170
paulson@14760
   171
lemma bij_imp_bij_inv: "bij f ==> bij (inv f)"
paulson@14760
   172
by (simp add: bij_def inj_imp_surj_inv surj_imp_inj_inv)
wenzelm@12372
   173
paulson@14760
   174
lemma inv_equality: "[| !!x. g (f x) = x;  !!y. f (g y) = y |] ==> inv f = g"
paulson@14760
   175
apply (rule ext)
paulson@14760
   176
apply (auto simp add: inv_def)
paulson@14760
   177
done
paulson@14760
   178
paulson@14760
   179
lemma inv_inv_eq: "bij f ==> inv (inv f) = f"
paulson@14760
   180
apply (rule inv_equality)
paulson@14760
   181
apply (auto simp add: bij_def surj_f_inv_f)
paulson@14760
   182
done
paulson@14760
   183
paulson@14760
   184
(** bij(inv f) implies little about f.  Consider f::bool=>bool such that
paulson@14760
   185
    f(True)=f(False)=True.  Then it's consistent with axiom someI that
paulson@14760
   186
    inv f could be any function at all, including the identity function.
paulson@14760
   187
    If inv f=id then inv f is a bijection, but inj f, surj(f) and
paulson@14760
   188
    inv(inv f)=f all fail.
paulson@14760
   189
**)
paulson@14760
   190
paulson@14760
   191
lemma o_inv_distrib: "[| bij f; bij g |] ==> inv (f o g) = inv g o inv f"
paulson@14760
   192
apply (rule inv_equality)
paulson@14760
   193
apply (auto simp add: bij_def surj_f_inv_f)
paulson@14760
   194
done
paulson@14760
   195
paulson@14760
   196
paulson@14760
   197
lemma image_surj_f_inv_f: "surj f ==> f ` (inv f ` A) = A"
paulson@14760
   198
by (simp add: image_eq_UN surj_f_inv_f)
paulson@14760
   199
paulson@14760
   200
lemma image_inv_f_f: "inj f ==> (inv f) ` (f ` A) = A"
paulson@14760
   201
by (simp add: image_eq_UN)
paulson@14760
   202
paulson@14760
   203
lemma inv_image_comp: "inj f ==> inv f ` (f`X) = X"
paulson@14760
   204
by (auto simp add: image_def)
paulson@14760
   205
paulson@14760
   206
lemma bij_image_Collect_eq: "bij f ==> f ` Collect P = {y. P (inv f y)}"
paulson@14760
   207
apply auto
paulson@14760
   208
apply (force simp add: bij_is_inj)
paulson@14760
   209
apply (blast intro: bij_is_surj [THEN surj_f_inv_f, symmetric])
paulson@14760
   210
done
paulson@14760
   211
paulson@14760
   212
lemma bij_vimage_eq_inv_image: "bij f ==> f -` A = inv f ` A" 
paulson@14760
   213
apply (auto simp add: bij_is_surj [THEN surj_f_inv_f])
paulson@14760
   214
apply (blast intro: bij_is_inj [THEN inv_f_f, symmetric])
paulson@14760
   215
done
paulson@14760
   216
paulson@14760
   217
paulson@14760
   218
subsection {*Inverse of a PI-function (restricted domain)*}
paulson@14760
   219
paulson@14760
   220
lemma Inv_f_f: "[| inj_on f A;  x \<in> A |] ==> Inv A f (f x) = x"
paulson@14760
   221
apply (simp add: Inv_def inj_on_def)
paulson@14760
   222
apply (blast intro: someI2)
paulson@14760
   223
done
paulson@14760
   224
paulson@14760
   225
lemma f_Inv_f: "y \<in> f`A  ==> f (Inv A f y) = y"
paulson@14760
   226
apply (simp add: Inv_def)
paulson@13585
   227
apply (fast intro: someI2)
paulson@13585
   228
done
paulson@11451
   229
paulson@14760
   230
lemma Inv_injective:
paulson@14760
   231
  assumes eq: "Inv A f x = Inv A f y"
paulson@14760
   232
      and x: "x: f`A"
paulson@14760
   233
      and y: "y: f`A"
paulson@14760
   234
  shows "x=y"
paulson@14760
   235
proof -
paulson@14760
   236
  have "f (Inv A f x) = f (Inv A f y)" using eq by simp
paulson@14760
   237
  thus ?thesis by (simp add: f_Inv_f x y) 
paulson@14760
   238
qed
paulson@14760
   239
paulson@14760
   240
lemma inj_on_Inv: "B <= f`A ==> inj_on (Inv A f) B"
paulson@14760
   241
apply (rule inj_onI)
paulson@14760
   242
apply (blast intro: inj_onI dest: Inv_injective injD)
paulson@14760
   243
done
paulson@14760
   244
paulson@14760
   245
lemma Inv_mem: "[| f ` A = B;  x \<in> B |] ==> Inv A f x \<in> A"
paulson@14760
   246
apply (simp add: Inv_def)
paulson@14760
   247
apply (fast intro: someI2)
paulson@14760
   248
done
paulson@14760
   249
paulson@14760
   250
lemma Inv_f_eq: "[| inj_on f A; f x = y; x \<in> A |] ==> Inv A f y = x"
ballarin@14399
   251
  apply (erule subst)
paulson@14760
   252
  apply (erule Inv_f_f, assumption)
ballarin@14399
   253
  done
ballarin@14399
   254
ballarin@14399
   255
lemma Inv_comp:
paulson@14760
   256
  "[| inj_on f (g ` A); inj_on g A; x \<in> f ` g ` A |] ==>
ballarin@14399
   257
  Inv A (f o g) x = (Inv A g o Inv (g ` A) f) x"
ballarin@14399
   258
  apply simp
ballarin@14399
   259
  apply (rule Inv_f_eq)
ballarin@14399
   260
    apply (fast intro: comp_inj_on)
ballarin@14399
   261
   apply (simp add: f_Inv_f Inv_mem)
ballarin@14399
   262
  apply (simp add: Inv_mem)
ballarin@14399
   263
  done
ballarin@14399
   264
paulson@14760
   265
paulson@14760
   266
subsection {*Other Consequences of Hilbert's Epsilon*}
paulson@14760
   267
paulson@14760
   268
text {*Hilbert's Epsilon and the @{term split} Operator*}
paulson@14760
   269
paulson@14760
   270
text{*Looping simprule*}
paulson@14760
   271
lemma split_paired_Eps: "(SOME x. P x) = (SOME (a,b). P(a,b))"
paulson@14760
   272
by (simp add: split_Pair_apply)
paulson@14760
   273
paulson@14760
   274
lemma Eps_split: "Eps (split P) = (SOME xy. P (fst xy) (snd xy))"
paulson@14760
   275
by (simp add: split_def)
paulson@14760
   276
paulson@14760
   277
lemma Eps_split_eq [simp]: "(@(x',y'). x = x' & y = y') = (x,y)"
paulson@14760
   278
by blast
paulson@14760
   279
paulson@14760
   280
paulson@14760
   281
text{*A relation is wellfounded iff it has no infinite descending chain*}
paulson@14760
   282
lemma wf_iff_no_infinite_down_chain:
paulson@14760
   283
  "wf r = (~(\<exists>f. \<forall>i. (f(Suc i),f i) \<in> r))"
paulson@14760
   284
apply (simp only: wf_eq_minimal)
paulson@14760
   285
apply (rule iffI)
paulson@14760
   286
 apply (rule notI)
paulson@14760
   287
 apply (erule exE)
paulson@14760
   288
 apply (erule_tac x = "{w. \<exists>i. w=f i}" in allE, blast)
paulson@14760
   289
apply (erule contrapos_np, simp, clarify)
paulson@14760
   290
apply (subgoal_tac "\<forall>n. nat_rec x (%i y. @z. z:Q & (z,y) :r) n \<in> Q")
paulson@14760
   291
 apply (rule_tac x = "nat_rec x (%i y. @z. z:Q & (z,y) :r)" in exI)
paulson@14760
   292
 apply (rule allI, simp)
paulson@14760
   293
 apply (rule someI2_ex, blast, blast)
paulson@14760
   294
apply (rule allI)
paulson@14760
   295
apply (induct_tac "n", simp_all)
paulson@14760
   296
apply (rule someI2_ex, blast+)
paulson@14760
   297
done
paulson@14760
   298
paulson@14760
   299
text{*A dynamically-scoped fact for TFL *}
wenzelm@12298
   300
lemma tfl_some: "\<forall>P x. P x --> P (Eps P)"
wenzelm@12298
   301
  by (blast intro: someI)
paulson@11451
   302
wenzelm@12298
   303
wenzelm@12298
   304
subsection {* Least value operator *}
paulson@11451
   305
paulson@11451
   306
constdefs
wenzelm@12298
   307
  LeastM :: "['a => 'b::ord, 'a => bool] => 'a"
paulson@14760
   308
  "LeastM m P == SOME x. P x & (\<forall>y. P y --> m x <= m y)"
paulson@11451
   309
paulson@11451
   310
syntax
wenzelm@12298
   311
  "_LeastM" :: "[pttrn, 'a => 'b::ord, bool] => 'a"    ("LEAST _ WRT _. _" [0, 4, 10] 10)
paulson@11451
   312
translations
wenzelm@12298
   313
  "LEAST x WRT m. P" == "LeastM m (%x. P)"
paulson@11451
   314
paulson@11451
   315
lemma LeastMI2:
wenzelm@12298
   316
  "P x ==> (!!y. P y ==> m x <= m y)
wenzelm@12298
   317
    ==> (!!x. P x ==> \<forall>y. P y --> m x \<le> m y ==> Q x)
wenzelm@12298
   318
    ==> Q (LeastM m P)"
paulson@14760
   319
  apply (simp add: LeastM_def)
paulson@14208
   320
  apply (rule someI2_ex, blast, blast)
wenzelm@12298
   321
  done
paulson@11451
   322
paulson@11451
   323
lemma LeastM_equality:
wenzelm@12298
   324
  "P k ==> (!!x. P x ==> m k <= m x)
wenzelm@12298
   325
    ==> m (LEAST x WRT m. P x) = (m k::'a::order)"
paulson@14208
   326
  apply (rule LeastMI2, assumption, blast)
wenzelm@12298
   327
  apply (blast intro!: order_antisym)
wenzelm@12298
   328
  done
paulson@11451
   329
paulson@11454
   330
lemma wf_linord_ex_has_least:
paulson@14760
   331
  "wf r ==> \<forall>x y. ((x,y):r^+) = ((y,x)~:r^*) ==> P k
paulson@14760
   332
    ==> \<exists>x. P x & (!y. P y --> (m x,m y):r^*)"
wenzelm@12298
   333
  apply (drule wf_trancl [THEN wf_eq_minimal [THEN iffD1]])
paulson@14208
   334
  apply (drule_tac x = "m`Collect P" in spec, force)
wenzelm@12298
   335
  done
paulson@11454
   336
paulson@11454
   337
lemma ex_has_least_nat:
paulson@14760
   338
    "P k ==> \<exists>x. P x & (\<forall>y. P y --> m x <= (m y::nat))"
wenzelm@12298
   339
  apply (simp only: pred_nat_trancl_eq_le [symmetric])
wenzelm@12298
   340
  apply (rule wf_pred_nat [THEN wf_linord_ex_has_least])
paulson@16796
   341
   apply (simp add: less_eq linorder_not_le pred_nat_trancl_eq_le, assumption)
wenzelm@12298
   342
  done
paulson@11454
   343
wenzelm@12298
   344
lemma LeastM_nat_lemma:
paulson@14760
   345
    "P k ==> P (LeastM m P) & (\<forall>y. P y --> m (LeastM m P) <= (m y::nat))"
paulson@14760
   346
  apply (simp add: LeastM_def)
wenzelm@12298
   347
  apply (rule someI_ex)
wenzelm@12298
   348
  apply (erule ex_has_least_nat)
wenzelm@12298
   349
  done
paulson@11454
   350
paulson@11454
   351
lemmas LeastM_natI = LeastM_nat_lemma [THEN conjunct1, standard]
paulson@11454
   352
paulson@11454
   353
lemma LeastM_nat_le: "P x ==> m (LeastM m P) <= (m x::nat)"
paulson@14208
   354
by (rule LeastM_nat_lemma [THEN conjunct2, THEN spec, THEN mp], assumption, assumption)
paulson@11454
   355
paulson@11451
   356
wenzelm@12298
   357
subsection {* Greatest value operator *}
paulson@11451
   358
paulson@11451
   359
constdefs
wenzelm@12298
   360
  GreatestM :: "['a => 'b::ord, 'a => bool] => 'a"
paulson@14760
   361
  "GreatestM m P == SOME x. P x & (\<forall>y. P y --> m y <= m x)"
wenzelm@12298
   362
wenzelm@12298
   363
  Greatest :: "('a::ord => bool) => 'a"    (binder "GREATEST " 10)
wenzelm@12298
   364
  "Greatest == GreatestM (%x. x)"
paulson@11451
   365
paulson@11451
   366
syntax
wenzelm@12298
   367
  "_GreatestM" :: "[pttrn, 'a=>'b::ord, bool] => 'a"
wenzelm@12298
   368
      ("GREATEST _ WRT _. _" [0, 4, 10] 10)
paulson@11451
   369
paulson@11451
   370
translations
wenzelm@12298
   371
  "GREATEST x WRT m. P" == "GreatestM m (%x. P)"
paulson@11451
   372
paulson@11451
   373
lemma GreatestMI2:
wenzelm@12298
   374
  "P x ==> (!!y. P y ==> m y <= m x)
wenzelm@12298
   375
    ==> (!!x. P x ==> \<forall>y. P y --> m y \<le> m x ==> Q x)
wenzelm@12298
   376
    ==> Q (GreatestM m P)"
paulson@14760
   377
  apply (simp add: GreatestM_def)
paulson@14208
   378
  apply (rule someI2_ex, blast, blast)
wenzelm@12298
   379
  done
paulson@11451
   380
paulson@11451
   381
lemma GreatestM_equality:
wenzelm@12298
   382
 "P k ==> (!!x. P x ==> m x <= m k)
wenzelm@12298
   383
    ==> m (GREATEST x WRT m. P x) = (m k::'a::order)"
paulson@14208
   384
  apply (rule_tac m = m in GreatestMI2, assumption, blast)
wenzelm@12298
   385
  apply (blast intro!: order_antisym)
wenzelm@12298
   386
  done
paulson@11451
   387
paulson@11451
   388
lemma Greatest_equality:
wenzelm@12298
   389
  "P (k::'a::order) ==> (!!x. P x ==> x <= k) ==> (GREATEST x. P x) = k"
paulson@14760
   390
  apply (simp add: Greatest_def)
paulson@14208
   391
  apply (erule GreatestM_equality, blast)
wenzelm@12298
   392
  done
paulson@11451
   393
paulson@11451
   394
lemma ex_has_greatest_nat_lemma:
paulson@14760
   395
  "P k ==> \<forall>x. P x --> (\<exists>y. P y & ~ ((m y::nat) <= m x))
paulson@14760
   396
    ==> \<exists>y. P y & ~ (m y < m k + n)"
paulson@15251
   397
  apply (induct n, force)
wenzelm@12298
   398
  apply (force simp add: le_Suc_eq)
wenzelm@12298
   399
  done
paulson@11451
   400
wenzelm@12298
   401
lemma ex_has_greatest_nat:
paulson@14760
   402
  "P k ==> \<forall>y. P y --> m y < b
paulson@14760
   403
    ==> \<exists>x. P x & (\<forall>y. P y --> (m y::nat) <= m x)"
wenzelm@12298
   404
  apply (rule ccontr)
wenzelm@12298
   405
  apply (cut_tac P = P and n = "b - m k" in ex_has_greatest_nat_lemma)
paulson@14208
   406
    apply (subgoal_tac [3] "m k <= b", auto)
wenzelm@12298
   407
  done
paulson@11451
   408
wenzelm@12298
   409
lemma GreatestM_nat_lemma:
paulson@14760
   410
  "P k ==> \<forall>y. P y --> m y < b
paulson@14760
   411
    ==> P (GreatestM m P) & (\<forall>y. P y --> (m y::nat) <= m (GreatestM m P))"
paulson@14760
   412
  apply (simp add: GreatestM_def)
wenzelm@12298
   413
  apply (rule someI_ex)
paulson@14208
   414
  apply (erule ex_has_greatest_nat, assumption)
wenzelm@12298
   415
  done
paulson@11451
   416
paulson@11451
   417
lemmas GreatestM_natI = GreatestM_nat_lemma [THEN conjunct1, standard]
paulson@11451
   418
wenzelm@12298
   419
lemma GreatestM_nat_le:
paulson@14760
   420
  "P x ==> \<forall>y. P y --> m y < b
wenzelm@12298
   421
    ==> (m x::nat) <= m (GreatestM m P)"
berghofe@21020
   422
  apply (blast dest: GreatestM_nat_lemma [THEN conjunct2, THEN spec, of P])
wenzelm@12298
   423
  done
wenzelm@12298
   424
wenzelm@12298
   425
wenzelm@12298
   426
text {* \medskip Specialization to @{text GREATEST}. *}
wenzelm@12298
   427
paulson@14760
   428
lemma GreatestI: "P (k::nat) ==> \<forall>y. P y --> y < b ==> P (GREATEST x. P x)"
paulson@14760
   429
  apply (simp add: Greatest_def)
paulson@14208
   430
  apply (rule GreatestM_natI, auto)
wenzelm@12298
   431
  done
paulson@11451
   432
wenzelm@12298
   433
lemma Greatest_le:
paulson@14760
   434
    "P x ==> \<forall>y. P y --> y < b ==> (x::nat) <= (GREATEST x. P x)"
paulson@14760
   435
  apply (simp add: Greatest_def)
paulson@14208
   436
  apply (rule GreatestM_nat_le, auto)
wenzelm@12298
   437
  done
wenzelm@12298
   438
wenzelm@12298
   439
wenzelm@12298
   440
subsection {* The Meson proof procedure *}
paulson@11451
   441
wenzelm@12298
   442
subsubsection {* Negation Normal Form *}
wenzelm@12298
   443
wenzelm@12298
   444
text {* de Morgan laws *}
wenzelm@12298
   445
wenzelm@12298
   446
lemma meson_not_conjD: "~(P&Q) ==> ~P | ~Q"
wenzelm@12298
   447
  and meson_not_disjD: "~(P|Q) ==> ~P & ~Q"
wenzelm@12298
   448
  and meson_not_notD: "~~P ==> P"
paulson@14760
   449
  and meson_not_allD: "!!P. ~(\<forall>x. P(x)) ==> \<exists>x. ~P(x)"
paulson@14760
   450
  and meson_not_exD: "!!P. ~(\<exists>x. P(x)) ==> \<forall>x. ~P(x)"
wenzelm@12298
   451
  by fast+
paulson@11451
   452
wenzelm@12298
   453
text {* Removal of @{text "-->"} and @{text "<->"} (positive and
wenzelm@12298
   454
negative occurrences) *}
wenzelm@12298
   455
wenzelm@12298
   456
lemma meson_imp_to_disjD: "P-->Q ==> ~P | Q"
wenzelm@12298
   457
  and meson_not_impD: "~(P-->Q) ==> P & ~Q"
wenzelm@12298
   458
  and meson_iff_to_disjD: "P=Q ==> (~P | Q) & (~Q | P)"
wenzelm@12298
   459
  and meson_not_iffD: "~(P=Q) ==> (P | Q) & (~P | ~Q)"
wenzelm@12298
   460
    -- {* Much more efficient than @{prop "(P & ~Q) | (Q & ~P)"} for computing CNF *}
paulson@18389
   461
  and meson_not_refl_disj_D: "x ~= x | P ==> P"
wenzelm@12298
   462
  by fast+
wenzelm@12298
   463
wenzelm@12298
   464
wenzelm@12298
   465
subsubsection {* Pulling out the existential quantifiers *}
wenzelm@12298
   466
wenzelm@12298
   467
text {* Conjunction *}
wenzelm@12298
   468
paulson@14760
   469
lemma meson_conj_exD1: "!!P Q. (\<exists>x. P(x)) & Q ==> \<exists>x. P(x) & Q"
paulson@14760
   470
  and meson_conj_exD2: "!!P Q. P & (\<exists>x. Q(x)) ==> \<exists>x. P & Q(x)"
wenzelm@12298
   471
  by fast+
wenzelm@12298
   472
paulson@11451
   473
wenzelm@12298
   474
text {* Disjunction *}
wenzelm@12298
   475
paulson@14760
   476
lemma meson_disj_exD: "!!P Q. (\<exists>x. P(x)) | (\<exists>x. Q(x)) ==> \<exists>x. P(x) | Q(x)"
wenzelm@12298
   477
  -- {* DO NOT USE with forall-Skolemization: makes fewer schematic variables!! *}
wenzelm@12298
   478
  -- {* With ex-Skolemization, makes fewer Skolem constants *}
paulson@14760
   479
  and meson_disj_exD1: "!!P Q. (\<exists>x. P(x)) | Q ==> \<exists>x. P(x) | Q"
paulson@14760
   480
  and meson_disj_exD2: "!!P Q. P | (\<exists>x. Q(x)) ==> \<exists>x. P | Q(x)"
wenzelm@12298
   481
  by fast+
wenzelm@12298
   482
paulson@11451
   483
wenzelm@12298
   484
subsubsection {* Generating clauses for the Meson Proof Procedure *}
wenzelm@12298
   485
wenzelm@12298
   486
text {* Disjunctions *}
wenzelm@12298
   487
wenzelm@12298
   488
lemma meson_disj_assoc: "(P|Q)|R ==> P|(Q|R)"
wenzelm@12298
   489
  and meson_disj_comm: "P|Q ==> Q|P"
wenzelm@12298
   490
  and meson_disj_FalseD1: "False|P ==> P"
wenzelm@12298
   491
  and meson_disj_FalseD2: "P|False ==> P"
wenzelm@12298
   492
  by fast+
paulson@11451
   493
paulson@14760
   494
paulson@14760
   495
subsection{*Lemmas for Meson, the Model Elimination Procedure*}
paulson@14760
   496
paulson@14760
   497
text{* Generation of contrapositives *}
paulson@14760
   498
paulson@14760
   499
text{*Inserts negated disjunct after removing the negation; P is a literal.
paulson@14760
   500
  Model elimination requires assuming the negation of every attempted subgoal,
paulson@14760
   501
  hence the negated disjuncts.*}
paulson@14760
   502
lemma make_neg_rule: "~P|Q ==> ((~P==>P) ==> Q)"
paulson@14760
   503
by blast
paulson@14760
   504
paulson@14760
   505
text{*Version for Plaisted's "Postive refinement" of the Meson procedure*}
paulson@14760
   506
lemma make_refined_neg_rule: "~P|Q ==> (P ==> Q)"
paulson@14760
   507
by blast
paulson@14760
   508
paulson@14760
   509
text{*@{term P} should be a literal*}
paulson@14760
   510
lemma make_pos_rule: "P|Q ==> ((P==>~P) ==> Q)"
paulson@14760
   511
by blast
paulson@14760
   512
paulson@14760
   513
text{*Versions of @{text make_neg_rule} and @{text make_pos_rule} that don't
paulson@14760
   514
insert new assumptions, for ordinary resolution.*}
paulson@14760
   515
paulson@14760
   516
lemmas make_neg_rule' = make_refined_neg_rule
paulson@14760
   517
paulson@14760
   518
lemma make_pos_rule': "[|P|Q; ~P|] ==> Q"
paulson@14760
   519
by blast
paulson@14760
   520
paulson@14760
   521
text{* Generation of a goal clause -- put away the final literal *}
paulson@14760
   522
paulson@14760
   523
lemma make_neg_goal: "~P ==> ((~P==>P) ==> False)"
paulson@14760
   524
by blast
paulson@14760
   525
paulson@14760
   526
lemma make_pos_goal: "P ==> ((P==>~P) ==> False)"
paulson@14760
   527
by blast
paulson@14760
   528
paulson@14760
   529
paulson@14760
   530
subsubsection{* Lemmas for Forward Proof*}
paulson@14760
   531
paulson@14760
   532
text{*There is a similarity to congruence rules*}
paulson@14760
   533
paulson@14760
   534
(*NOTE: could handle conjunctions (faster?) by
paulson@14760
   535
    nf(th RS conjunct2) RS (nf(th RS conjunct1) RS conjI) *)
paulson@14760
   536
lemma conj_forward: "[| P'&Q';  P' ==> P;  Q' ==> Q |] ==> P&Q"
paulson@14760
   537
by blast
paulson@14760
   538
paulson@14760
   539
lemma disj_forward: "[| P'|Q';  P' ==> P;  Q' ==> Q |] ==> P|Q"
paulson@14760
   540
by blast
paulson@14760
   541
paulson@14760
   542
(*Version of @{text disj_forward} for removal of duplicate literals*)
paulson@14760
   543
lemma disj_forward2:
paulson@14760
   544
    "[| P'|Q';  P' ==> P;  [| Q'; P==>False |] ==> Q |] ==> P|Q"
paulson@14760
   545
apply blast 
paulson@14760
   546
done
paulson@14760
   547
paulson@14760
   548
lemma all_forward: "[| \<forall>x. P'(x);  !!x. P'(x) ==> P(x) |] ==> \<forall>x. P(x)"
paulson@14760
   549
by blast
paulson@14760
   550
paulson@14760
   551
lemma ex_forward: "[| \<exists>x. P'(x);  !!x. P'(x) ==> P(x) |] ==> \<exists>x. P(x)"
paulson@14760
   552
by blast
paulson@14760
   553
paulson@17420
   554
paulson@17420
   555
text{*Many of these bindings are used by the ATP linkup, and not just by
paulson@17420
   556
legacy proof scripts.*}
paulson@14760
   557
ML
paulson@14760
   558
{*
paulson@14760
   559
val inv_def = thm "inv_def";
paulson@14760
   560
val Inv_def = thm "Inv_def";
paulson@14760
   561
paulson@14760
   562
val someI = thm "someI";
paulson@14760
   563
val someI_ex = thm "someI_ex";
paulson@14760
   564
val someI2 = thm "someI2";
paulson@14760
   565
val someI2_ex = thm "someI2_ex";
paulson@14760
   566
val some_equality = thm "some_equality";
paulson@14760
   567
val some1_equality = thm "some1_equality";
paulson@14760
   568
val some_eq_ex = thm "some_eq_ex";
paulson@14760
   569
val some_eq_trivial = thm "some_eq_trivial";
paulson@14760
   570
val some_sym_eq_trivial = thm "some_sym_eq_trivial";
paulson@14760
   571
val choice = thm "choice";
paulson@14760
   572
val bchoice = thm "bchoice";
paulson@14760
   573
val inv_id = thm "inv_id";
paulson@14760
   574
val inv_f_f = thm "inv_f_f";
paulson@14760
   575
val inv_f_eq = thm "inv_f_eq";
paulson@14760
   576
val inj_imp_inv_eq = thm "inj_imp_inv_eq";
paulson@14760
   577
val inj_transfer = thm "inj_transfer";
paulson@14760
   578
val inj_iff = thm "inj_iff";
paulson@14760
   579
val inj_imp_surj_inv = thm "inj_imp_surj_inv";
paulson@14760
   580
val f_inv_f = thm "f_inv_f";
paulson@14760
   581
val surj_f_inv_f = thm "surj_f_inv_f";
paulson@14760
   582
val inv_injective = thm "inv_injective";
paulson@14760
   583
val inj_on_inv = thm "inj_on_inv";
paulson@14760
   584
val surj_imp_inj_inv = thm "surj_imp_inj_inv";
paulson@14760
   585
val surj_iff = thm "surj_iff";
paulson@14760
   586
val surj_imp_inv_eq = thm "surj_imp_inv_eq";
paulson@14760
   587
val bij_imp_bij_inv = thm "bij_imp_bij_inv";
paulson@14760
   588
val inv_equality = thm "inv_equality";
paulson@14760
   589
val inv_inv_eq = thm "inv_inv_eq";
paulson@14760
   590
val o_inv_distrib = thm "o_inv_distrib";
paulson@14760
   591
val image_surj_f_inv_f = thm "image_surj_f_inv_f";
paulson@14760
   592
val image_inv_f_f = thm "image_inv_f_f";
paulson@14760
   593
val inv_image_comp = thm "inv_image_comp";
paulson@14760
   594
val bij_image_Collect_eq = thm "bij_image_Collect_eq";
paulson@14760
   595
val bij_vimage_eq_inv_image = thm "bij_vimage_eq_inv_image";
paulson@14760
   596
val Inv_f_f = thm "Inv_f_f";
paulson@14760
   597
val f_Inv_f = thm "f_Inv_f";
paulson@14760
   598
val Inv_injective = thm "Inv_injective";
paulson@14760
   599
val inj_on_Inv = thm "inj_on_Inv";
paulson@14760
   600
val split_paired_Eps = thm "split_paired_Eps";
paulson@14760
   601
val Eps_split = thm "Eps_split";
paulson@14760
   602
val Eps_split_eq = thm "Eps_split_eq";
paulson@14760
   603
val wf_iff_no_infinite_down_chain = thm "wf_iff_no_infinite_down_chain";
paulson@14760
   604
val Inv_mem = thm "Inv_mem";
paulson@14760
   605
val Inv_f_eq = thm "Inv_f_eq";
paulson@14760
   606
val Inv_comp = thm "Inv_comp";
paulson@14760
   607
val tfl_some = thm "tfl_some";
paulson@14760
   608
val make_neg_rule = thm "make_neg_rule";
paulson@14760
   609
val make_refined_neg_rule = thm "make_refined_neg_rule";
paulson@14760
   610
val make_pos_rule = thm "make_pos_rule";
paulson@14760
   611
val make_neg_rule' = thm "make_neg_rule'";
paulson@14760
   612
val make_pos_rule' = thm "make_pos_rule'";
paulson@14760
   613
val make_neg_goal = thm "make_neg_goal";
paulson@14760
   614
val make_pos_goal = thm "make_pos_goal";
paulson@14760
   615
val conj_forward = thm "conj_forward";
paulson@14760
   616
val disj_forward = thm "disj_forward";
paulson@14760
   617
val disj_forward2 = thm "disj_forward2";
paulson@14760
   618
val all_forward = thm "all_forward";
paulson@14760
   619
val ex_forward = thm "ex_forward";
paulson@14760
   620
*}
paulson@14760
   621
paulson@14760
   622
paulson@21999
   623
subsection {* Meson package *}
wenzelm@17893
   624
paulson@11451
   625
use "Tools/meson.ML"
paulson@11451
   626
wenzelm@17893
   627
wenzelm@17893
   628
subsection {* Specification package -- Hilbertized version *}
wenzelm@17893
   629
wenzelm@17893
   630
lemma exE_some: "[| Ex P ; c == Eps P |] ==> P c"
wenzelm@17893
   631
  by (simp only: someI_ex)
wenzelm@17893
   632
skalberg@14115
   633
use "Tools/specification_package.ML"
skalberg@14115
   634
paulson@11451
   635
end