| 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 2719 in the proof. |
| Ref | Expression |
|---|---|
| zfcndinf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | el 2719 |
. . 3
| |
| 2 | ax-17 1190 |
. . . . . 6
| |
| 3 | hbe1 990 |
. . . . . . . 8
| |
| 4 | 2, 3 | hbim 983 |
. . . . . . 7
|
| 5 | 4 | hbal 981 |
. . . . . 6
|
| 6 | 2, 5 | hban 985 |
. . . . 5
|
| 7 | 6 | hbex 982 |
. . . 4
|
| 8 | ax-17 1190 |
. . . . 5
| |
| 9 | axinfnd 4881 |
. . . . . 6
| |
| 10 | 9 | 19.35i 1052 |
. . . . 5
|
| 11 | 8, 10 | syl 10 |
. . . 4
|
| 12 | 7, 11 | 19.23ai 1040 |
. . 3
|
| 13 | 1, 12 | ax-mp 7 |
. 2
|
| 14 | elequ1 1123 |
. . . . . 6
| |
| 15 | elequ1 1123 |
. . . . . . . 8
| |
| 16 | 15 | anbi1d 615 |
. . . . . . 7
|
| 17 | 16 | exbidv 1261 |
. . . . . 6
|
| 18 | 14, 17 | imbi12d 624 |
. . . . 5
|
| 19 | 18 | cbvalv 1296 |
. . . 4
|
| 20 | 19 | anbi2i 479 |
. . 3
|
| 21 | 20 | exbii 1027 |
. 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-4 951 ax-5 952 ax-6 953 ax-7 954 ax-gen 955 ax-8 1101 ax-9 1102 ax-10 1103 ax-12 1104 ax-13 1107 ax-14 1108 ax-11 1180 ax-17 1190 ax-16 1194 ax-11o 1202 ax-ext 1436 ax-sep 2671 ax-pow 2710 ax-reg 4517 ax-inf 4546 |
| This theorem depends on definitions: df-bi 147 df-or 224 df-an 225 df-ex 957 df-sb 1155 df-eu 1359 df-mo 1360 df-clab 1441 df-cleq 1446 df-clel 1449 df-ne 1563 df-ral 1625 df-rex 1626 df-v 1787 df-dif 2020 df-un 2021 df-in 2022 df-ss 2024 df-nul 2252 df-pw 2373 df-sn 2383 df-pr 2384 |