| 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 4631 |
. 2
| |
| 2 | elequ1 1138 |
. . . . . 6
| |
| 3 | elequ1 1138 |
. . . . . . . 8
| |
| 4 | 3 | anbi1d 619 |
. . . . . . 7
|
| 5 | 4 | exbidv 1281 |
. . . . . 6
|
| 6 | 2, 5 | imbi12d 628 |
. . . . 5
|
| 7 | 6 | cbvalv 1316 |
. . . 4
|
| 8 | 7 | anbi2i 482 |
. . 3
|
| 9 | 8 | exbii 1053 |
. 2
|
| 10 | 1, 9 | mpbi 189 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: axinf2 4633 axinfndlem1 4969 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 964 ax-gen 965 ax-8 966 ax-12 970 ax-13 971 ax-17 973 ax-4 975 ax-5o 977 ax-6o 980 ax-9o 1125 ax-inf 4631 |
| This theorem depends on definitions: df-bi 147 df-an 225 df-ex 983 |