src/HOL/Real/HahnBanach/ZornLemma.thy
author wenzelm
Thu Aug 22 20:49:43 2002 +0200 (2002-08-22)
changeset 13515 a6a7025fd7e8
parent 10687 c186279eecea
child 14024 213dcc39358f
permissions -rw-r--r--
updated to use locales (still some rough edges);
wenzelm@7917
     1
(*  Title:      HOL/Real/HahnBanach/ZornLemma.thy
wenzelm@7917
     2
    ID:         $Id$
wenzelm@7917
     3
    Author:     Gertrud Bauer, TU Munich
wenzelm@7917
     4
*)
wenzelm@7917
     5
wenzelm@9035
     6
header {* Zorn's Lemma *}
wenzelm@7917
     7
wenzelm@9035
     8
theory ZornLemma = Aux + Zorn:
wenzelm@7917
     9
wenzelm@10687
    10
text {*
wenzelm@10687
    11
  Zorn's Lemmas states: if every linear ordered subset of an ordered
wenzelm@10687
    12
  set @{text S} has an upper bound in @{text S}, then there exists a
wenzelm@10687
    13
  maximal element in @{text S}.  In our application, @{text S} is a
wenzelm@10687
    14
  set of sets ordered by set inclusion. Since the union of a chain of
wenzelm@10687
    15
  sets is an upper bound for all elements of the chain, the conditions
wenzelm@10687
    16
  of Zorn's lemma can be modified: if @{text S} is non-empty, it
wenzelm@10687
    17
  suffices to show that for every non-empty chain @{text c} in @{text
wenzelm@10687
    18
  S} the union of @{text c} also lies in @{text S}.
wenzelm@10687
    19
*}
wenzelm@7917
    20
wenzelm@10687
    21
theorem Zorn's_Lemma:
wenzelm@13515
    22
  assumes r: "\<And>c. c \<in> chain S \<Longrightarrow> \<exists>x. x \<in> c \<Longrightarrow> \<Union>c \<in> S"
wenzelm@13515
    23
    and aS: "a \<in> S"
wenzelm@13515
    24
  shows "\<exists>y \<in> S. \<forall>z \<in> S. y \<subseteq> z \<longrightarrow> y = z"
wenzelm@9035
    25
proof (rule Zorn_Lemma2)
wenzelm@8104
    26
  txt_raw {* \footnote{See
wenzelm@9035
    27
  \url{http://isabelle.in.tum.de/library/HOL/HOL-Real/Zorn.html}} \isanewline *}
wenzelm@10687
    28
  show "\<forall>c \<in> chain S. \<exists>y \<in> S. \<forall>z \<in> c. z \<subseteq> y"
wenzelm@9035
    29
  proof
wenzelm@10687
    30
    fix c assume "c \<in> chain S"
wenzelm@10687
    31
    show "\<exists>y \<in> S. \<forall>z \<in> c. z \<subseteq> y"
wenzelm@9035
    32
    proof cases
wenzelm@13515
    33
wenzelm@10687
    34
      txt {* If @{text c} is an empty chain, then every element in
wenzelm@10687
    35
      @{text S} is an upper bound of @{text c}. *}
wenzelm@7917
    36
wenzelm@13515
    37
      assume "c = {}"
wenzelm@9035
    38
      with aS show ?thesis by fast
wenzelm@7917
    39
wenzelm@10687
    40
      txt {* If @{text c} is non-empty, then @{text "\<Union>c"} is an upper
wenzelm@10687
    41
      bound of @{text c}, lying in @{text S}. *}
wenzelm@7917
    42
wenzelm@9035
    43
    next
wenzelm@10687
    44
      assume c: "c \<noteq> {}"
wenzelm@13515
    45
      show ?thesis
wenzelm@13515
    46
      proof
wenzelm@10687
    47
        show "\<forall>z \<in> c. z \<subseteq> \<Union>c" by fast
wenzelm@13515
    48
        show "\<Union>c \<in> S"
wenzelm@9035
    49
        proof (rule r)
wenzelm@13515
    50
          from c show "\<exists>x. x \<in> c" by fast
wenzelm@9035
    51
        qed
wenzelm@9035
    52
      qed
wenzelm@9035
    53
    qed
wenzelm@9035
    54
  qed
wenzelm@9035
    55
qed
wenzelm@7917
    56
wenzelm@10687
    57
end