| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Axiom of Infinity, reproved from conditionless ZFC axioms. Since we have already reproved Extensionality, Replacement, and Power Sets, we are justified in referencing theorem el 2741 in the proof. |
| Ref | Expression |
|---|---|
| zfcndinf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | el 2741 |
. . 3
| |
| 2 | ax-17 968 |
. . . . . 6
| |
| 3 | hbe1 1012 |
. . . . . . . 8
| |
| 4 | 2, 3 | hbim 1004 |
. . . . . . 7
|
| 5 | 4 | hbal 1002 |
. . . . . 6
|
| 6 | 2, 5 | hban 1006 |
. . . . 5
|
| 7 | 6 | hbex 1003 |
. . . 4
|
| 8 | ax-17 968 |
. . . . 5
| |
| 9 | axinfnd 4930 |
. . . . . 6
| |
| 10 | 9 | 19.35i 1072 |
. . . . 5
|
| 11 | 8, 10 | syl 10 |
. . . 4
|
| 12 | 7, 11 | 19.23ai 1060 |
. . 3
|
| 13 | 1, 12 | ax-mp 7 |
. 2
|
| 14 | elequ1 1132 |
. . . . . 6
| |
| 15 | elequ1 1132 |
. . . . . . . 8
| |
| 16 | 15 | anbi1d 615 |
. . . . . . 7
|
| 17 | 16 | exbidv 1274 |
. . . . . 6
|
| 18 | 14, 17 | imbi12d 624 |
. . . . 5
|
| 19 | 18 | cbvalv 1309 |
. . . 4
|
| 20 | 19 | anbi2i 479 |
. . 3
|
| 21 | 20 | exbii 1047 |
. 2
|
| 22 | 13, 21 | mpbir 190 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 959 ax-gen 960 ax-8 961 ax-10 963 ax-11 964 ax-12 965 ax-13 966 ax-14 967 ax-17 968 ax-4 970 ax-5o 972 ax-6o 975 ax-9o 1119 ax-10o 1136 ax-16 1206 ax-11o 1213 ax-15 1353 ax-ext 1452 ax-sep 2693 ax-pow 2732 ax-reg 4565 ax-inf 4594 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 978 df-sb 1168 df-eu 1375 df-mo 1376 df-clab 1457 df-cleq 1462 df-clel 1465 df-ne 1579 df-ral 1641 df-rex 1642 df-v 1803 df-dif 2039 df-un 2040 df-in 2041 df-ss 2043 df-nul 2271 df-pw 2392 df-sn 2402 df-pr 2403 |