| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Axiom of Infinity expressed with fewest number of different variables. |
| Ref | Expression |
|---|---|
| axinf |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-inf 4605 |
. 2
| |
| 2 | elequ1 1135 |
. . . . . 6
| |
| 3 | elequ1 1135 |
. . . . . . . 8
| |
| 4 | 3 | anbi1d 616 |
. . . . . . 7
|
| 5 | 4 | exbidv 1278 |
. . . . . 6
|
| 6 | 2, 5 | imbi12d 625 |
. . . . 5
|
| 7 | 6 | cbvalv 1313 |
. . . 4
|
| 8 | 7 | anbi2i 480 |
. . 3
|
| 9 | 8 | exbii 1050 |
. 2
|
| 10 | 1, 9 | mpbi 189 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: axinf2 4607 axinfndlem1 4940 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 961 ax-gen 962 ax-8 963 ax-12 967 ax-13 968 ax-17 970 ax-4 972 ax-5o 974 ax-6o 977 ax-9o 1122 ax-inf 4605 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 980 |