src/HOL/ex/set.thy
 author paulson Wed Feb 02 18:06:25 2005 +0100 (2005-02-02) changeset 15488 7c638a46dcbb parent 15481 fc075ae929e4 child 16417 9bc16273c2d4 permissions -rw-r--r--
tidying of some subst/simplesubst proofs
```     1 (*  Title:      HOL/ex/set.thy
```
```     2     ID:         \$Id\$
```
```     3     Author:     Tobias Nipkow and Lawrence C Paulson
```
```     4     Copyright   1991  University of Cambridge
```
```     5 *)
```
```     6
```
```     7 header {* Set Theory examples: Cantor's Theorem, Schröder-Berstein Theorem, etc. *}
```
```     8
```
```     9 theory set = Main:
```
```    10
```
```    11 text{*
```
```    12   These two are cited in Benzmueller and Kohlhase's system description
```
```    13   of LEO, CADE-15, 1998 (pages 139-143) as theorems LEO could not
```
```    14   prove.
```
```    15 *}
```
```    16
```
```    17 lemma "(X = Y \<union> Z) =
```
```    18     (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))"
```
```    19   by blast
```
```    20
```
```    21 lemma "(X = Y \<inter> Z) =
```
```    22     (X \<subseteq> Y \<and> X \<subseteq> Z \<and> (\<forall>V. V \<subseteq> Y \<and> V \<subseteq> Z \<longrightarrow> V \<subseteq> X))"
```
```    23   by blast
```
```    24
```
```    25 text {*
```
```    26   Trivial example of term synthesis: apparently hard for some provers!
```
```    27 *}
```
```    28
```
```    29 lemma "a \<noteq> b \<Longrightarrow> a \<in> ?X \<and> b \<notin> ?X"
```
```    30   by blast
```
```    31
```
```    32
```
```    33 subsection {* Examples for the @{text blast} paper *}
```
```    34
```
```    35 lemma "(\<Union>x \<in> C. f x \<union> g x) = \<Union>(f ` C)  \<union>  \<Union>(g ` C)"
```
```    36   -- {* Union-image, called @{text Un_Union_image} in Main HOL *}
```
```    37   by blast
```
```    38
```
```    39 lemma "(\<Inter>x \<in> C. f x \<inter> g x) = \<Inter>(f ` C) \<inter> \<Inter>(g ` C)"
```
```    40   -- {* Inter-image, called @{text Int_Inter_image} in Main HOL *}
```
```    41   by blast
```
```    42
```
```    43 lemma "\<And>S::'a set set. \<forall>x \<in> S. \<forall>y \<in> S. x \<subseteq> y \<Longrightarrow> \<exists>z. S \<subseteq> {z}"
```
```    44   -- {* Singleton I.  Nice demonstration of @{text blast}--and its limitations. *}
```
```    45   -- {* For some unfathomable reason, @{text UNIV_I} increases the search space greatly. *}
```
```    46   by (blast del: UNIV_I)
```
```    47
```
```    48 lemma "\<forall>x \<in> S. \<Union>S \<subseteq> x \<Longrightarrow> \<exists>z. S \<subseteq> {z}"
```
```    49   -- {*Singleton II.  Variant of the benchmark above. *}
```
```    50   by (blast del: UNIV_I)
```
```    51
```
```    52 lemma "\<exists>!x. f (g x) = x \<Longrightarrow> \<exists>!y. g (f y) = y"
```
```    53   -- {* A unique fixpoint theorem --- @{text fast}/@{text best}/@{text meson} all fail. *}
```
```    54   apply (erule ex1E, rule ex1I, erule arg_cong)
```
```    55   apply (rule subst, assumption, erule allE, rule arg_cong, erule mp)
```
```    56   apply (erule arg_cong)
```
```    57   done
```
```    58
```
```    59
```
```    60
```
```    61 subsection {* Cantor's Theorem: There is no surjection from a set to its powerset *}
```
```    62
```
```    63 lemma cantor1: "\<not> (\<exists>f:: 'a \<Rightarrow> 'a set. \<forall>S. \<exists>x. f x = S)"
```
```    64   -- {* Requires best-first search because it is undirectional. *}
```
```    65   by best
```
```    66
```
```    67 lemma "\<forall>f:: 'a \<Rightarrow> 'a set. \<forall>x. f x \<noteq> ?S f"
```
```    68   -- {*This form displays the diagonal term. *}
```
```    69   by best
```
```    70
```
```    71 lemma "?S \<notin> range (f :: 'a \<Rightarrow> 'a set)"
```
```    72   -- {* This form exploits the set constructs. *}
```
```    73   by (rule notI, erule rangeE, best)
```
```    74
```
```    75 lemma "?S \<notin> range (f :: 'a \<Rightarrow> 'a set)"
```
```    76   -- {* Or just this! *}
```
```    77   by best
```
```    78
```
```    79
```
```    80 subsection {* The Schröder-Berstein Theorem *}
```
```    81
```
```    82 lemma disj_lemma: "- (f ` X) = g ` (-X) \<Longrightarrow> f a = g b \<Longrightarrow> a \<in> X \<Longrightarrow> b \<in> X"
```
```    83   by blast
```
```    84
```
```    85 lemma surj_if_then_else:
```
```    86   "-(f ` X) = g ` (-X) \<Longrightarrow> surj (\<lambda>z. if z \<in> X then f z else g z)"
```
```    87   by (simp add: surj_def) blast
```
```    88
```
```    89 lemma bij_if_then_else:
```
```    90   "inj_on f X \<Longrightarrow> inj_on g (-X) \<Longrightarrow> -(f ` X) = g ` (-X) \<Longrightarrow>
```
```    91     h = (\<lambda>z. if z \<in> X then f z else g z) \<Longrightarrow> inj h \<and> surj h"
```
```    92   apply (unfold inj_on_def)
```
```    93   apply (simp add: surj_if_then_else)
```
```    94   apply (blast dest: disj_lemma sym)
```
```    95   done
```
```    96
```
```    97 lemma decomposition: "\<exists>X. X = - (g ` (- (f ` X)))"
```
```    98   apply (rule exI)
```
```    99   apply (rule lfp_unfold)
```
```   100   apply (rule monoI, blast)
```
```   101   done
```
```   102
```
```   103 theorem Schroeder_Bernstein:
```
```   104   "inj (f :: 'a \<Rightarrow> 'b) \<Longrightarrow> inj (g :: 'b \<Rightarrow> 'a)
```
```   105     \<Longrightarrow> \<exists>h:: 'a \<Rightarrow> 'b. inj h \<and> surj h"
```
```   106   apply (rule decomposition [where f=f and g=g, THEN exE])
```
```   107   apply (rule_tac x = "(\<lambda>z. if z \<in> x then f z else inv g z)" in exI)
```
```   108     --{*The term above can be synthesized by a sufficiently detailed proof.*}
```
```   109   apply (rule bij_if_then_else)
```
```   110      apply (rule_tac [4] refl)
```
```   111     apply (rule_tac [2] inj_on_inv)
```
```   112     apply (erule subset_inj_on [OF _ subset_UNIV])
```
```   113    apply blast
```
```   114   apply (erule ssubst, subst double_complement, erule inv_image_comp [symmetric])
```
```   115   done
```
```   116
```
```   117
```
```   118 text {*
```
```   119   From W. W. Bledsoe and Guohui Feng, SET-VAR. JAR 11 (3), 1993, pages
```
```   120   293-314.
```
```   121
```
```   122   Isabelle can prove the easy examples without any special mechanisms,
```
```   123   but it can't prove the hard ones.
```
```   124 *}
```
```   125
```
```   126 lemma "\<exists>A. (\<forall>x \<in> A. x \<le> (0::int))"
```
```   127   -- {* Example 1, page 295. *}
```
```   128   by force
```
```   129
```
```   130 lemma "D \<in> F \<Longrightarrow> \<exists>G. \<forall>A \<in> G. \<exists>B \<in> F. A \<subseteq> B"
```
```   131   -- {* Example 2. *}
```
```   132   by force
```
```   133
```
```   134 lemma "P a \<Longrightarrow> \<exists>A. (\<forall>x \<in> A. P x) \<and> (\<exists>y. y \<in> A)"
```
```   135   -- {* Example 3. *}
```
```   136   by force
```
```   137
```
```   138 lemma "a < b \<and> b < (c::int) \<Longrightarrow> \<exists>A. a \<notin> A \<and> b \<in> A \<and> c \<notin> A"
```
```   139   -- {* Example 4. *}
```
```   140   by force
```
```   141
```
```   142 lemma "P (f b) \<Longrightarrow> \<exists>s A. (\<forall>x \<in> A. P x) \<and> f s \<in> A"
```
```   143   -- {*Example 5, page 298. *}
```
```   144   by force
```
```   145
```
```   146 lemma "P (f b) \<Longrightarrow> \<exists>s A. (\<forall>x \<in> A. P x) \<and> f s \<in> A"
```
```   147   -- {* Example 6. *}
```
```   148   by force
```
```   149
```
```   150 lemma "\<exists>A. a \<notin> A"
```
```   151   -- {* Example 7. *}
```
```   152   by force
```
```   153
```
```   154 lemma "(\<forall>u v. u < (0::int) \<longrightarrow> u \<noteq> abs v)
```
```   155     \<longrightarrow> (\<exists>A::int set. (\<forall>y. abs y \<notin> A) \<and> -2 \<in> A)"
```
```   156   -- {* Example 8 now needs a small hint. *}
```
```   157   by (simp add: abs_if, force)
```
```   158     -- {* not @{text blast}, which can't simplify @{text "-2 < 0"} *}
```
```   159
```
```   160 text {* Example 9 omitted (requires the reals). *}
```
```   161
```
```   162 text {* The paper has no Example 10! *}
```
```   163
```
```   164 lemma "(\<forall>A. 0 \<in> A \<and> (\<forall>x \<in> A. Suc x \<in> A) \<longrightarrow> n \<in> A) \<and>
```
```   165   P 0 \<and> (\<forall>x. P x \<longrightarrow> P (Suc x)) \<longrightarrow> P n"
```
```   166   -- {* Example 11: needs a hint. *}
```
```   167   apply clarify
```
```   168   apply (drule_tac x = "{x. P x}" in spec)
```
```   169   apply force
```
```   170   done
```
```   171
```
```   172 lemma
```
```   173   "(\<forall>A. (0, 0) \<in> A \<and> (\<forall>x y. (x, y) \<in> A \<longrightarrow> (Suc x, Suc y) \<in> A) \<longrightarrow> (n, m) \<in> A)
```
```   174     \<and> P n \<longrightarrow> P m"
```
```   175   -- {* Example 12. *}
```
```   176   by auto
```
```   177
```
```   178 lemma
```
```   179   "(\<forall>x. (\<exists>u. x = 2 * u) = (\<not> (\<exists>v. Suc x = 2 * v))) \<longrightarrow>
```
```   180     (\<exists>A. \<forall>x. (x \<in> A) = (Suc x \<notin> A))"
```
```   181   -- {* Example EO1: typo in article, and with the obvious fix it seems
```
```   182       to require arithmetic reasoning. *}
```
```   183   apply clarify
```
```   184   apply (rule_tac x = "{x. \<exists>u. x = 2 * u}" in exI, auto)
```
```   185    apply (case_tac v, auto)
```
```   186   apply (drule_tac x = "Suc v" and P = "\<lambda>x. ?a x \<noteq> ?b x" in spec, force)
```
```   187   done
```
```   188
```
```   189 end
```