| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: A lemma for proving conditionless ZFC axioms. |
| Ref | Expression |
|---|---|
| nd2 |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elirrv 5933 |
. . 3
| |
| 2 | stdpc4 1829 |
. . . 4
| |
| 3 | 1 | pm2.21i 126 |
. . . . 5
|
| 4 | elequ2 1778 |
. . . . 5
| |
| 5 | 3, 4 | sbie 1840 |
. . . 4
|
| 6 | 2, 5 | sylib 242 |
. . 3
|
| 7 | 1, 6 | mto 151 |
. 2
|
| 8 | ax-10o 1781 |
. 2
| |
| 9 | 7, 8 | mtoi 153 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: axrepnd 6464 axpownd 6471 axinfndlem1 6475 axacndlem4 6480 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 1592 ax-gen 1593 ax-8 1594 ax-9 1595 ax-10 1596 ax-11 1597 ax-12 1598 ax-14 1600 ax-17 1605 ax-4 1608 ax-5o 1610 ax-6o 1613 ax-9o 1763 ax-10o 1781 ax-16 1854 ax-11o 1864 ax-ext 2123 ax-sep 3606 ax-nul 3613 ax-pow 3649 ax-reg 5928 |
| This theorem depends on definitions: df-bi 220 df-or 338 df-an 339 df-ex 1616 df-sb 1816 df-clab 2129 df-cleq 2134 df-clel 2137 df-ne 2268 df-ral 2359 df-rex 2360 df-v 2540 df-dif 2830 df-in 2834 df-ss 2836 df-nul 3083 df-pw 3229 df-sn 3242 |