Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > prexg | Unicode version |
Description: The Axiom of Pairing using class variables. Theorem 7.13 of [Quine] p. 51, but restricted to classes which exist. For proper classes, see prprc 3693, prprc1 3691, and prprc2 3692. (Contributed by Jim Kingdon, 16-Sep-2018.) |
Ref | Expression |
---|---|
prexg |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | preq2 3661 | . . . . . 6 | |
2 | 1 | eleq1d 2239 | . . . . 5 |
3 | zfpair2 4195 | . . . . 5 | |
4 | 2, 3 | vtoclg 2790 | . . . 4 |
5 | preq1 3660 | . . . . 5 | |
6 | 5 | eleq1d 2239 | . . . 4 |
7 | 4, 6 | syl5ib 153 | . . 3 |
8 | 7 | vtocleg 2801 | . 2 |
9 | 8 | imp 123 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wceq 1348 wcel 2141 cvv 2730 cpr 3584 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 704 ax-5 1440 ax-7 1441 ax-gen 1442 ax-ie1 1486 ax-ie2 1487 ax-8 1497 ax-10 1498 ax-11 1499 ax-i12 1500 ax-bndl 1502 ax-4 1503 ax-17 1519 ax-i9 1523 ax-ial 1527 ax-i5r 1528 ax-14 2144 ax-ext 2152 ax-sep 4107 ax-pr 4194 |
This theorem depends on definitions: df-bi 116 df-tru 1351 df-nf 1454 df-sb 1756 df-clab 2157 df-cleq 2163 df-clel 2166 df-nfc 2301 df-v 2732 df-un 3125 df-sn 3589 df-pr 3590 |
This theorem is referenced by: prelpwi 4199 opexg 4213 opi2 4218 opth 4222 opeqsn 4237 opeqpr 4238 uniop 4240 unex 4426 tpexg 4429 op1stb 4463 op1stbg 4464 onun2 4474 opthreg 4540 relop 4761 acexmidlemv 5851 pr2ne 7169 exmidonfinlem 7170 exmidaclem 7185 sup3exmid 8873 xrex 9813 2strbasg 12519 2stropg 12520 isomninnlem 14062 trilpolemlt1 14073 iswomninnlem 14081 iswomni0 14083 ismkvnnlem 14084 |
Copyright terms: Public domain | W3C validator |