| Metamath Proof Explorer |
< Previous
Next >
Related theorems Unicode version |
| Description: Any two sets are equinumerous to disjoint sets. Exercise 4.39 of [Mendelson] p. 255. |
| Ref | Expression |
|---|---|
| endisj.1 |
|
| endisj.2 |
|
| Ref | Expression |
|---|---|
| endisj |
|
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | endisj.1 |
. . . 4
| |
| 2 | 0ex 1745 |
. . . 4
| |
| 3 | 1, 2 | xpsnen 3339 |
. . 3
|
| 4 | endisj.2 |
. . . 4
| |
| 5 | p0ex 1885 |
. . . 4
| |
| 6 | 4, 5 | xpsnen 3339 |
. . 3
|
| 7 | 3, 6 | pm3.2i 234 |
. 2
|
| 8 | 0nep0 1887 |
. . 3
| |
| 9 | xpsndisj 2655 |
. . 3
| |
| 10 | 8, 9 | ax-mp 6 |
. 2
|
| 11 | 1, 5 | xpex 2488 |
. . 3
|
| 12 | snex 1859 |
. . . 4
| |
| 13 | 4, 12 | xpex 2488 |
. . 3
|
| 14 | breq1 2065 |
. . . . 5
| |
| 15 | breq1 2065 |
. . . . 5
| |
| 16 | 14, 15 | bi2anan9 478 |
. . . 4
|
| 17 | ineq12 1640 |
. . . . 5
| |
| 18 | 17 | cleq1d 1109 |
. . . 4
|
| 19 | 16, 18 | anbi12d 476 |
. . 3
|
| 20 | 11, 13, 19 | cla4e2v 1406 |
. 2
|
| 21 | 7, 10, 20 | mp2an 520 |
1
|
| Colors of variables: wff set class |
| Syntax hints: |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-11 801 ax-12 802 ax-13 804 ax-14 805 ax-16 922 ax-17 925 ax-ext 1074 ax-rep 1075 ax-un 1076 ax-pow 1077 |
| This theorem depends on definitions: df-bi 128 df-or 197 df-an 198 df-3an 583 df-ex 679 df-sb 853 df-eu 1009 df-mo 1010 df-clab 1093 df-cleq 1097 df-clel 1099 df-ral 1205 df-rex 1206 df-v 1349 df-dif 1489 df-un 1490 df-in 1491 df-ss 1492 df-nul 1708 df-pw 1799 df-sn 1811 df-pr 1812 df-op 1815 df-uni 1920 df-int 1966 df-br 2063 df-opab 2098 df-id 2125 df-xp 2424 df-rel 2425 df-cnv 2426 df-co 2427 df-dm 2428 df-rn 2429 df-res 2430 df-ima 2431 df-fun 2432 df-fn 2433 df-f 2434 df-f1 2435 df-fo 2436 df-f1o 2437 df-en 3274 |