| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode 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 5958 for a version with general partial orderings. |
| Ref | Expression |
|---|---|
| zorn2.1 |
|
| Ref | Expression |
|---|---|
| zorn |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | zorn2.1 |
. . . 4
| |
| 2 | 1 | zorn2 5958 |
. . 3
|
| 3 | pssirr 2708 |
. . . . . . . 8
| |
| 4 | zornlem 5957 |
. . . . . . . 8
| |
| 5 | 3, 4 | mtbir 209 |
. . . . . . 7
|
| 6 | psstr 2714 |
. . . . . . . . 9
| |
| 7 | zornlem 5957 |
. . . . . . . . 9
| |
| 8 | 6, 7 | sylibr 217 |
. . . . . . . 8
|
| 9 | zornlem 5957 |
. . . . . . . 8
| |
| 10 | zornlem 5957 |
. . . . . . . 8
| |
| 11 | 8, 9, 10 | syl2anb 504 |
. . . . . . 7
|
| 12 | 5, 11 | pm3.2i 307 |
. . . . . 6
|
| 13 | 12 | a1i 8 |
. . . . 5
|
| 14 | 13 | rgen3 2187 |
. . . 4
|
| 15 | df-po 3591 |
. . . 4
| |
| 16 | 14, 15 | mpbir 207 |
. . 3
|
| 17 | df-so 3604 |
. . . . . . . 8
| |
| 18 | 17 | simprbi 353 |
. . . . . . 7
|
| 19 | zornlem 5957 |
. . . . . . . . . 10
| |
| 20 | biid 187 |
. . . . . . . . . 10
| |
| 21 | 19, 20, 10 | 3orbi123i 1057 |
. . . . . . . . 9
|
| 22 | sspsstri 2711 |
. . . . . . . . 9
| |
| 23 | 21, 22 | bitr4i 193 |
. . . . . . . 8
|
| 24 | 23 | 2ralbii 2129 |
. . . . . . 7
|
| 25 | 18, 24 | sylib 215 |
. . . . . 6
|
| 26 | 25 | anim2i 362 |
. . . . 5
|
| 27 | risset 2145 |
. . . . . 6
| |
| 28 | eqimss2 2667 |
. . . . . . . . 9
| |
| 29 | unissb 3208 |
. . . . . . . . 9
| |
| 30 | 28, 29 | sylib 215 |
. . . . . . . 8
|
| 31 | 7 | orbi1i 276 |
. . . . . . . . . 10
|
| 32 | sspss 2707 |
. . . . . . . . . 10
| |
| 33 | 31, 32 | bitr4i 193 |
. . . . . . . . 9
|
| 34 | 33 | ralbii 2127 |
. . . . . . . 8
|
| 35 | 30, 34 | sylibr 217 |
. . . . . . 7
|
| 36 | 35 | reximi 2198 |
. . . . . 6
|
| 37 | 27, 36 | sylbi 216 |
. . . . 5
|
| 38 | 26, 37 | imim12i 21 |
. . . 4
|
| 39 | 38 | alimi 1338 |
. . 3
|
| 40 | 2, 16, 39 | sylancr 526 |
. 2
|
| 41 | 19 | notbii 204 |
. . . 4
|
| 42 | 41 | ralbii 2127 |
. . 3
|
| 43 | 42 | rexbii 2128 |
. 2
|
| 44 | 40, 43 | sylib 215 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: infxpidmlem9 8829 alexsublem2 15438 filssufil 15571 zornn0 15764 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1304 ax-gen 1305 ax-8 1306 ax-9 1307 ax-10 1308 ax-11 1309 ax-12 1310 ax-13 1311 ax-14 1312 ax-17 1317 ax-4 1319 ax-5o 1321 ax-6o 1324 ax-9o 1481 ax-10o 1500 ax-16 1580 ax-11o 1588 ax-ext 1865 ax-rep 3428 ax-sep 3438 ax-nul 3445 ax-pow 3481 ax-pr 3524 ax-un 3790 ax-ac 5906 |
| This theorem depends on definitions: df-bi 164 df-or 241 df-an 242 df-3or 859 df-3an 860 df-ex 1327 df-sb 1536 df-eu 1775 df-mo 1776 df-clab 1872 df-cleq 1877 df-clel 1880 df-ne 2019 df-ral 2109 df-rex 2110 df-reu 2111 df-rab 2112 df-v 2294 df-sbc 2454 df-csb 2541 df-dif 2597 df-un 2600 df-in 2603 df-ss 2605 df-pss 2607 df-nul 2876 df-pw 3035 df-sn 3049 df-pr 3050 df-tp 3052 df-op 3053 df-uni 3178 df-int 3215 df-iun 3257 df-br 3339 df-opab 3396 df-tr 3412 df-eprel 3583 df-id 3586 df-po 3591 df-so 3604 df-fr 3625 df-we 3644 df-ord 3660 df-on 3661 df-suc 3663 df-xp 4000 df-rel 4001 df-cnv 4002 df-co 4003 df-dm 4004 df-rn 4005 df-res 4006 df-ima 4007 df-fun 4008 df-fn 4009 df-f 4010 df-f1 4011 df-fo 4012 df-f1o 4013 df-fv 4014 df-iso 4015 |