| 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 2751 in the proof. |
| Ref | Expression |
|---|---|
| zfcndinf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | el 2751 |
. . 3
| |
| 2 | ax-17 971 |
. . . . . 6
| |
| 3 | hbe1 1016 |
. . . . . . . 8
| |
| 4 | 2, 3 | hbim 1007 |
. . . . . . 7
|
| 5 | 4 | hbal 1005 |
. . . . . 6
|
| 6 | 2, 5 | hban 1009 |
. . . . 5
|
| 7 | 6 | hbex 1006 |
. . . 4
|
| 8 | ax-17 971 |
. . . . 5
| |
| 9 | axinfnd 4958 |
. . . . . 6
| |
| 10 | 9 | 19.35i 1076 |
. . . . 5
|
| 11 | 8, 10 | syl 10 |
. . . 4
|
| 12 | 7, 11 | 19.23ai 1064 |
. . 3
|
| 13 | 1, 12 | ax-mp 7 |
. 2
|
| 14 | elequ1 1136 |
. . . . . 6
| |
| 15 | elequ1 1136 |
. . . . . . . 8
| |
| 16 | 15 | anbi1d 617 |
. . . . . . 7
|
| 17 | 16 | exbidv 1279 |
. . . . . 6
|
| 18 | 14, 17 | imbi12d 626 |
. . . . 5
|
| 19 | 18 | cbvalv 1314 |
. . . 4
|
| 20 | 19 | anbi2i 480 |
. . 3
|
| 21 | 20 | exbii 1051 |
. 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 962 ax-gen 963 ax-8 964 ax-10 966 ax-11 967 ax-12 968 ax-13 969 ax-14 970 ax-17 971 ax-4 973 ax-5o 975 ax-6o 978 ax-9o 1123 ax-10o 1140 ax-16 1210 ax-11o 1218 ax-15 1360 ax-ext 1459 ax-sep 2703 ax-pow 2742 ax-reg 4593 ax-inf 4622 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 981 df-sb 1172 df-eu 1382 df-mo 1383 df-clab 1464 df-cleq 1469 df-clel 1472 df-ne 1587 df-ral 1649 df-rex 1650 df-v 1812 df-dif 2049 df-un 2050 df-in 2051 df-ss 2053 df-nul 2281 df-pw 2402 df-sn 2412 df-pr 2413 |