| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xpsnen | Unicode version | ||
| Description: A set is equinumerous to its Cartesian product with a singleton. Proposition 4.22(c) of [Mendelson] p. 254. (Contributed by NM, 4-Jan-2004.) (Revised by Mario Carneiro, 15-Nov-2014.) |
| Ref | Expression |
|---|---|
| xpsnen.1 |
|
| xpsnen.2 |
|
| Ref | Expression |
|---|---|
| xpsnen |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpsnen.1 |
. . 3
| |
| 2 | xpsnen.2 |
. . . 4
| |
| 3 | 2 | snex 4317 |
. . 3
|
| 4 | 1, 3 | xpex 4886 |
. 2
|
| 5 | elxp 4786 |
. . 3
| |
| 6 | inteq 3968 |
. . . . . . . 8
| |
| 7 | 6 | inteqd 3970 |
. . . . . . 7
|
| 8 | vex 2824 |
. . . . . . . 8
| |
| 9 | vex 2824 |
. . . . . . . 8
| |
| 10 | 8, 9 | op1stb 4619 |
. . . . . . 7
|
| 11 | 7, 10 | eqtrdi 2287 |
. . . . . 6
|
| 12 | 11, 8 | eqeltrdi 2329 |
. . . . 5
|
| 13 | 12 | adantr 276 |
. . . 4
|
| 14 | 13 | exlimivv 1952 |
. . 3
|
| 15 | 5, 14 | sylbi 121 |
. 2
|
| 16 | 8, 2 | opex 4364 |
. . 3
|
| 17 | 16 | a1i 9 |
. 2
|
| 18 | eqvisset 2832 |
. . . . 5
| |
| 19 | ancom 266 |
. . . . . . . . . . 11
| |
| 20 | anass 405 |
. . . . . . . . . . 11
| |
| 21 | velsn 3722 |
. . . . . . . . . . . 12
| |
| 22 | 21 | anbi1i 462 |
. . . . . . . . . . 11
|
| 23 | 19, 20, 22 | 3bitr3i 210 |
. . . . . . . . . 10
|
| 24 | 23 | exbii 1658 |
. . . . . . . . 9
|
| 25 | opeq2 3900 |
. . . . . . . . . . . 12
| |
| 26 | 25 | eqeq2d 2250 |
. . . . . . . . . . 11
|
| 27 | 26 | anbi1d 469 |
. . . . . . . . . 10
|
| 28 | 2, 27 | ceqsexv 2861 |
. . . . . . . . 9
|
| 29 | inteq 3968 |
. . . . . . . . . . . . . 14
| |
| 30 | 29 | inteqd 3970 |
. . . . . . . . . . . . 13
|
| 31 | 8, 2 | op1stb 4619 |
. . . . . . . . . . . . 13
|
| 32 | 30, 31 | eqtr2di 2288 |
. . . . . . . . . . . 12
|
| 33 | 32 | pm4.71ri 396 |
. . . . . . . . . . 11
|
| 34 | 33 | anbi1i 462 |
. . . . . . . . . 10
|
| 35 | anass 405 |
. . . . . . . . . 10
| |
| 36 | 34, 35 | bitri 184 |
. . . . . . . . 9
|
| 37 | 24, 28, 36 | 3bitri 206 |
. . . . . . . 8
|
| 38 | 37 | exbii 1658 |
. . . . . . 7
|
| 39 | 5, 38 | bitri 184 |
. . . . . 6
|
| 40 | opeq1 3899 |
. . . . . . . . 9
| |
| 41 | 40 | eqeq2d 2250 |
. . . . . . . 8
|
| 42 | eleq1 2301 |
. . . . . . . 8
| |
| 43 | 41, 42 | anbi12d 477 |
. . . . . . 7
|
| 44 | 43 | ceqsexgv 2955 |
. . . . . 6
|
| 45 | 39, 44 | bitrid 192 |
. . . . 5
|
| 46 | 18, 45 | syl 14 |
. . . 4
|
| 47 | 46 | pm5.32ri 459 |
. . 3
|
| 48 | 32 | adantr 276 |
. . . . 5
|
| 49 | 48 | pm4.71i 395 |
. . . 4
|
| 50 | 43 | pm5.32ri 459 |
. . . 4
|
| 51 | 49, 50 | bitr2i 185 |
. . 3
|
| 52 | ancom 266 |
. . 3
| |
| 53 | 47, 51, 52 | 3bitri 206 |
. 2
|
| 54 | 4, 1, 15, 17, 53 | en2i 7046 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 ax-un 4573 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-int 3966 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-rn 4780 df-fun 5374 df-fn 5375 df-f 5376 df-f1 5377 df-fo 5378 df-f1o 5379 df-en 7013 |
| This theorem is referenced by: xpsneng 7110 endisj 7112 |
| Copyright terms: Public domain | W3C validator |