| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zorn | Structured version Visualization version GIF version | ||
| 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 10418 for a version with general partial orderings. (Contributed by NM, 12-Aug-2004.) |
| Ref | Expression |
|---|---|
| zornn0.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| zorn | ⊢ (∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zornn0.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 2 | numth3 10382 | . . 3 ⊢ (𝐴 ∈ V → 𝐴 ∈ dom card) | |
| 3 | 1, 2 | ax-mp 5 | . 2 ⊢ 𝐴 ∈ dom card |
| 4 | zorng 10416 | . 2 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) | |
| 5 | 3, 4 | mpan 691 | 1 ⊢ (∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∀wal 1540 ∈ wcel 2114 ∀wral 3050 ∃wrex 3059 Vcvv 3439 ⊆ wss 3900 ⊊ wpss 3901 ∪ cuni 4862 Or wor 5530 dom cdm 5623 [⊊] crpss 7667 cardccrd 9849 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-ac2 10375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4902 df-iun 4947 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-isom 6500 df-riota 7315 df-ov 7361 df-rpss 7668 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-en 8886 df-card 9853 df-ac 10028 |
| This theorem is referenced by: alexsubALTlem2 23994 |
| Copyright terms: Public domain | W3C validator |