MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zorn Structured version   Unicode version

Theorem zorn 8779
Description: Zorn's Lemma. If the union of every chain (with respect to inclusion) in a set belongs to the set, then the set contains a maximal element. This theorem is equivalent to the Axiom of Choice. Theorem 6M of [Enderton] p. 151. See zorn2 8778 for a version with general partial orderings. (Contributed by NM, 12-Aug-2004.)
Hypothesis
Ref Expression
zornn0.1  |-  A  e. 
_V
Assertion
Ref Expression
zorn  |-  ( A. z ( ( z 
C_  A  /\ [ C.]  Or  z )  ->  U. z  e.  A )  ->  E. x  e.  A  A. y  e.  A  -.  x  C.  y )
Distinct variable group:    x, y, z, A

Proof of Theorem zorn
StepHypRef Expression
1 zornn0.1 . . 3  |-  A  e. 
_V
2 numth3 8742 . . 3  |-  ( A  e.  _V  ->  A  e.  dom  card )
31, 2ax-mp 5 . 2  |-  A  e. 
dom  card
4 zorng 8776 . 2  |-  ( ( A  e.  dom  card  /\ 
A. z ( ( z  C_  A  /\ [ C.] 
Or  z )  ->  U. z  e.  A
) )  ->  E. x  e.  A  A. y  e.  A  -.  x  C.  y )
53, 4mpan 670 1  |-  ( A. z ( ( z 
C_  A  /\ [ C.]  Or  z )  ->  U. z  e.  A )  ->  E. x  e.  A  A. y  e.  A  -.  x  C.  y )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369   A.wal 1368    e. wcel 1758   A.wral 2795   E.wrex 2796   _Vcvv 3070    C_ wss 3428    C. wpss 3429   U.cuni 4191    Or wor 4740   dom cdm 4940   [ C.] crpss 6461   cardccrd 8208
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-8 1760  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1952  ax-ext 2430  ax-rep 4503  ax-sep 4513  ax-nul 4521  ax-pow 4570  ax-pr 4631  ax-un 6474  ax-ac2 8735
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2264  df-mo 2265  df-clab 2437  df-cleq 2443  df-clel 2446  df-nfc 2601  df-ne 2646  df-ral 2800  df-rex 2801  df-reu 2802  df-rmo 2803  df-rab 2804  df-v 3072  df-sbc 3287  df-csb 3389  df-dif 3431  df-un 3433  df-in 3435  df-ss 3442  df-pss 3444  df-nul 3738  df-if 3892  df-pw 3962  df-sn 3978  df-pr 3980  df-tp 3982  df-op 3984  df-uni 4192  df-int 4229  df-iun 4273  df-br 4393  df-opab 4451  df-mpt 4452  df-tr 4486  df-eprel 4732  df-id 4736  df-po 4741  df-so 4742  df-fr 4779  df-se 4780  df-we 4781  df-ord 4822  df-on 4823  df-suc 4825  df-xp 4946  df-rel 4947  df-cnv 4948  df-co 4949  df-dm 4950  df-rn 4951  df-res 4952  df-ima 4953  df-iota 5481  df-fun 5520  df-fn 5521  df-f 5522  df-f1 5523  df-fo 5524  df-f1o 5525  df-fv 5526  df-isom 5527  df-riota 6153  df-rpss 6462  df-recs 6934  df-en 7413  df-card 8212  df-ac 8389
This theorem is referenced by:  alexsubALTlem2  19738
  Copyright terms: Public domain W3C validator