| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > zorng | 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. Theorem 6M of [Enderton] p. 151. This version of zorn 10390 avoids the Axiom of Choice by assuming that 𝐴 is well-orderable. (Contributed by NM, 12-Aug-2004.) (Revised by Mario Carneiro, 9-May-2015.) |
| Ref | Expression |
|---|---|
| zorng | ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | risset 3205 | . . . . . 6 ⊢ (∪ 𝑧 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝑧) | |
| 2 | eqimss2 3992 | . . . . . . . . 9 ⊢ (𝑥 = ∪ 𝑧 → ∪ 𝑧 ⊆ 𝑥) | |
| 3 | unissb 4889 | . . . . . . . . 9 ⊢ (∪ 𝑧 ⊆ 𝑥 ↔ ∀𝑢 ∈ 𝑧 𝑢 ⊆ 𝑥) | |
| 4 | 2, 3 | sylib 218 | . . . . . . . 8 ⊢ (𝑥 = ∪ 𝑧 → ∀𝑢 ∈ 𝑧 𝑢 ⊆ 𝑥) |
| 5 | vex 3438 | . . . . . . . . . . . 12 ⊢ 𝑥 ∈ V | |
| 6 | 5 | brrpss 7654 | . . . . . . . . . . 11 ⊢ (𝑢 [⊊] 𝑥 ↔ 𝑢 ⊊ 𝑥) |
| 7 | 6 | orbi1i 913 | . . . . . . . . . 10 ⊢ ((𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥) ↔ (𝑢 ⊊ 𝑥 ∨ 𝑢 = 𝑥)) |
| 8 | sspss 4050 | . . . . . . . . . 10 ⊢ (𝑢 ⊆ 𝑥 ↔ (𝑢 ⊊ 𝑥 ∨ 𝑢 = 𝑥)) | |
| 9 | 7, 8 | bitr4i 278 | . . . . . . . . 9 ⊢ ((𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥) ↔ 𝑢 ⊆ 𝑥) |
| 10 | 9 | ralbii 3076 | . . . . . . . 8 ⊢ (∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥) ↔ ∀𝑢 ∈ 𝑧 𝑢 ⊆ 𝑥) |
| 11 | 4, 10 | sylibr 234 | . . . . . . 7 ⊢ (𝑥 = ∪ 𝑧 → ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥)) |
| 12 | 11 | reximi 3068 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝐴 𝑥 = ∪ 𝑧 → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥)) |
| 13 | 1, 12 | sylbi 217 | . . . . 5 ⊢ (∪ 𝑧 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥)) |
| 14 | 13 | imim2i 16 | . . . 4 ⊢ (((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴) → ((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))) |
| 15 | 14 | alimi 1812 | . . 3 ⊢ (∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴) → ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))) |
| 16 | porpss 7655 | . . . 4 ⊢ [⊊] Po 𝐴 | |
| 17 | zorn2g 10386 | . . . 4 ⊢ ((𝐴 ∈ dom card ∧ [⊊] Po 𝐴 ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦) | |
| 18 | 16, 17 | mp3an2 1451 | . . 3 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∃𝑥 ∈ 𝐴 ∀𝑢 ∈ 𝑧 (𝑢 [⊊] 𝑥 ∨ 𝑢 = 𝑥))) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦) |
| 19 | 15, 18 | sylan2 593 | . 2 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦) |
| 20 | vex 3438 | . . . . . 6 ⊢ 𝑦 ∈ V | |
| 21 | 20 | brrpss 7654 | . . . . 5 ⊢ (𝑥 [⊊] 𝑦 ↔ 𝑥 ⊊ 𝑦) |
| 22 | 21 | notbii 320 | . . . 4 ⊢ (¬ 𝑥 [⊊] 𝑦 ↔ ¬ 𝑥 ⊊ 𝑦) |
| 23 | 22 | ralbii 3076 | . . 3 ⊢ (∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦 ↔ ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| 24 | 23 | rexbii 3077 | . 2 ⊢ (∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 [⊊] 𝑦 ↔ ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| 25 | 19, 24 | sylib 218 | 1 ⊢ ((𝐴 ∈ dom card ∧ ∀𝑧((𝑧 ⊆ 𝐴 ∧ [⊊] Or 𝑧) → ∪ 𝑧 ∈ 𝐴)) → ∃𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ¬ 𝑥 ⊊ 𝑦) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 ∀wal 1539 = wceq 1541 ∈ wcel 2110 ∀wral 3045 ∃wrex 3054 ⊆ wss 3900 ⊊ wpss 3901 ∪ cuni 4857 class class class wbr 5089 Po wpo 5520 Or wor 5521 dom cdm 5614 [⊊] crpss 7650 cardccrd 9820 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-isom 6486 df-riota 7298 df-ov 7344 df-rpss 7651 df-2nd 7917 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-en 8865 df-card 9824 |
| This theorem is referenced by: zornn0g 10388 zorn 10390 |
| Copyright terms: Public domain | W3C validator |