MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  zorng Structured version   Visualization version   GIF version

Theorem zorng 10489
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. Theorem 6M of [Enderton] p. 151. This version of zorn 10492 avoids the Axiom of Choice by assuming that 𝐴 is well-orderable. (Contributed by NM, 12-Aug-2004.) (Revised by Mario Carneiro, 9-May-2015.)
Assertion
Ref Expression
zorng ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → 𝑧𝐴)) → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥𝑦)
Distinct variable group:   𝑥,𝑦,𝑧,𝐴

Proof of Theorem zorng
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 risset 3240 . . . . . 6 ( 𝑧𝐴 ↔ ∃𝑥𝐴 𝑥 = 𝑧)
2 eqimss2 3997 . . . . . . . . 9 (𝑥 = 𝑧 𝑧𝑥)
3 unissb 4907 . . . . . . . . 9 ( 𝑧𝑥 ↔ ∀𝑢𝑧 𝑢𝑥)
42, 3sylib 221 . . . . . . . 8 (𝑥 = 𝑧 → ∀𝑢𝑧 𝑢𝑥)
5 vex 3459 . . . . . . . . . . . 12 𝑥 ∈ V
65brrpss 7725 . . . . . . . . . . 11 (𝑢 [] 𝑥𝑢𝑥)
76orbi1i 926 . . . . . . . . . 10 ((𝑢 [] 𝑥𝑢 = 𝑥) ↔ (𝑢𝑥𝑢 = 𝑥))
8 sspss 4057 . . . . . . . . . 10 (𝑢𝑥 ↔ (𝑢𝑥𝑢 = 𝑥))
97, 8bitr4i 281 . . . . . . . . 9 ((𝑢 [] 𝑥𝑢 = 𝑥) ↔ 𝑢𝑥)
109ralbii 3111 . . . . . . . 8 (∀𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥) ↔ ∀𝑢𝑧 𝑢𝑥)
114, 10sylibr 237 . . . . . . 7 (𝑥 = 𝑧 → ∀𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥))
1211reximi 3103 . . . . . 6 (∃𝑥𝐴 𝑥 = 𝑧 → ∃𝑥𝐴𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥))
131, 12sylbi 220 . . . . 5 ( 𝑧𝐴 → ∃𝑥𝐴𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥))
1413imim2i 17 . . . 4 (((𝑧𝐴 ∧ [] Or 𝑧) → 𝑧𝐴) → ((𝑧𝐴 ∧ [] Or 𝑧) → ∃𝑥𝐴𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥)))
1514alimi 1841 . . 3 (∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → 𝑧𝐴) → ∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → ∃𝑥𝐴𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥)))
16 porpss 7726 . . . 4 [] Po 𝐴
17 zorn2g 10488 . . . 4 ((𝐴 ∈ dom card ∧ [] Po 𝐴 ∧ ∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → ∃𝑥𝐴𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥))) → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 [] 𝑦)
1816, 17mp3an2 1478 . . 3 ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → ∃𝑥𝐴𝑢𝑧 (𝑢 [] 𝑥𝑢 = 𝑥))) → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 [] 𝑦)
1915, 18sylan2 604 . 2 ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → 𝑧𝐴)) → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥 [] 𝑦)
20 vex 3459 . . . . . 6 𝑦 ∈ V
2120brrpss 7725 . . . . 5 (𝑥 [] 𝑦𝑥𝑦)
2221notbii 323 . . . 4 𝑥 [] 𝑦 ↔ ¬ 𝑥𝑦)
2322ralbii 3111 . . 3 (∀𝑦𝐴 ¬ 𝑥 [] 𝑦 ↔ ∀𝑦𝐴 ¬ 𝑥𝑦)
2423rexbii 3112 . 2 (∃𝑥𝐴𝑦𝐴 ¬ 𝑥 [] 𝑦 ↔ ∃𝑥𝐴𝑦𝐴 ¬ 𝑥𝑦)
2519, 24sylib 221 1 ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧𝐴 ∧ [] Or 𝑧) → 𝑧𝐴)) → ∃𝑥𝐴𝑦𝐴 ¬ 𝑥𝑦)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  wo 860  wal 1568   = wceq 1570  wcel 2143  wral 3079  wrex 3089  wss 3906  wpss 3907   cuni 4873   class class class wbr 5110   Po wpo 5569   Or wor 5570  dom cdm 5663   [] crpss 7721  cardccrd 9922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-rpss 7722  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-en 8945  df-card 9926
This theorem is referenced by:  zornn0g  10490  zorn  10492
  Copyright terms: Public domain W3C validator