| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: The Axiom of Pairing using class variables. Theorem 7.13 of [Quine] p. 51. By virtue of its definition, an unordered pair remains a set (even though no longer a pair) even when its components are proper classes (see prprc 2517), so we can dispense with hypotheses requiring them to be sets. |
| Ref | Expression |
|---|---|
| prex |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | preq1 2509 |
. . . . 5
| |
| 2 | 1 | eleq1d 1583 |
. . . 4
|
| 3 | preq2 2510 |
. . . . . 6
| |
| 4 | 3 | eleq1d 1583 |
. . . . 5
|
| 5 | zfpair2 2856 |
. . . . 5
| |
| 6 | 4, 5 | vtoclg 1893 |
. . . 4
|
| 7 | 2, 6 | syl5bi 206 |
. . 3
|
| 8 | 7 | vtocleg 1901 |
. 2
|
| 9 | prprc1 2515 |
. . 3
| |
| 10 | snex 2826 |
. . 3
| |
| 11 | 9, 10 | syl6eqel 1599 |
. 2
|
| 12 | prprc2 2516 |
. . 3
| |
| 13 | snex 2826 |
. . 3
| |
| 14 | 12, 13 | syl6eqel 1599 |
. 2
|
| 15 | 8, 11, 14 | pm2.61nii 129 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem is referenced by: opex 2858 opi2 2861 opth 2863 opeqsn 2879 opeqpr 2880 opthwiener 2884 uniop 2885 unex 3095 tpex 3102 op1stb 3136 xpsspw 3346 relop 3365 opthreg 4749 rankop 4839 aceq6b 4888 xrex 5646 unctb 7789 indistop 7860 spwpr4 8925 spwpr4OLD 8926 spwpr4aOLD 8927 unpde2eg22 10826 set2elt 10827 cnfilca 11088 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 998 ax-gen 999 ax-8 1000 ax-10 1002 ax-11 1003 ax-12 1004 ax-13 1005 ax-14 1006 ax-17 1007 ax-4 1009 ax-5o 1011 ax-6o 1014 ax-9o 1159 ax-10o 1177 ax-16 1247 ax-11o 1255 ax-ext 1500 ax-sep 2777 ax-pow 2818 ax-pr 2855 |
| This theorem depends on definitions: df-bi 145 df-or 222 df-an 223 df-ex 1017 df-sb 1209 df-eu 1421 df-mo 1422 df-clab 1506 df-cleq 1511 df-clel 1514 df-ne 1630 df-v 1858 df-dif 2101 df-un 2102 df-in 2103 df-ss 2105 df-nul 2333 df-pw 2459 df-sn 2470 df-pr 2471 |