Theorem endisj 7003

Description: Any two sets are equinumerous to disjoint sets. Exercise 4.39 of [Mendelson] p. 255. (Contributed by NM, 16-Apr-2004.)

Hypotheses

Ref	Expression
endisj.1	|- A e. _V
endisj.2	|- B e. _V

Assertion

Ref	Expression
endisj	|- E. x E. y ( ( x ~~ A /\ y ~~ B ) /\ ( x i^i y ) = (/) )

Distinct variable groups:   x, y, A   x, B, y

Proof of Theorem endisj

Step	Hyp	Ref	Expression
1		endisj.1	. . . 4 |- A e. _V
2		0ex 4214	. . . 4 |- (/) e. _V
3	1, 2	xpsnen 7000	. . 3 |- ( A X. { (/) } ) ~~ A
4		endisj.2	. . . 4 |- B e. _V
5		1on 6584	. . . . 5 |- 1o e. On
6	5	elexi 2813	. . . 4 |- 1o e. _V
7	4, 6	xpsnen 7000	. . 3 |- ( B X. { 1o } ) ~~ B
8	3, 7	pm3.2i 272	. 2 |- ( ( A X. { (/) } ) ~~ A /\ ( B X. { 1o } ) ~~ B )
9		xp01disj 6596	. 2 |- ( ( A X. { (/) } ) i^i ( B X. { 1o } ) ) = (/)
10		p0ex 4276	. . . 4 |- { (/) } e. _V
11	1, 10	xpex 4840	. . 3 |- ( A X. { (/) } ) e. _V
12	6	snex 4273	. . . 4 |- { 1o } e. _V
13	4, 12	xpex 4840	. . 3 |- ( B X. { 1o } ) e. _V
14		breq1 4089	. . . . 5 |- ( x = ( A X. { (/) } ) -> ( x ~~ A <-> ( A X. { (/) } ) ~~ A ) )
15		breq1 4089	. . . . 5 |- ( y = ( B X. { 1o } ) -> ( y ~~ B <-> ( B X. { 1o } ) ~~ B ) )
16	14, 15	bi2anan9 608	. . . 4 |- ( ( x = ( A X. { (/) } ) /\ y = ( B X. { 1o } ) ) -> ( ( x ~~ A /\ y ~~ B ) <-> ( ( A X. { (/) } ) ~~ A /\ ( B X. { 1o } ) ~~ B ) ) )
17		ineq12 3401	. . . . 5 |- ( ( x = ( A X. { (/) } ) /\ y = ( B X. { 1o } ) ) -> ( x i^i y ) = ( ( A X. { (/) } ) i^i ( B X. { 1o } ) ) )
18	17	eqeq1d 2238	. . . 4 |- ( ( x = ( A X. { (/) } ) /\ y = ( B X. { 1o } ) ) -> ( ( x i^i y ) = (/) <-> ( ( A X. { (/) } ) i^i ( B X. { 1o } ) ) = (/) ) )
19	16, 18	anbi12d 473	. . 3 |- ( ( x = ( A X. { (/) } ) /\ y = ( B X. { 1o } ) ) -> ( ( ( x ~~ A /\ y ~~ B ) /\ ( x i^i y ) = (/) ) <-> ( ( ( A X. { (/) } ) ~~ A /\ ( B X. { 1o } ) ~~ B ) /\ ( ( A X. { (/) } ) i^i ( B X. { 1o } ) ) = (/) ) ) )
20	11, 13, 19	spc2ev 2900	. 2 |- ( ( ( ( A X. { (/) } ) ~~ A /\ ( B X. { 1o } ) ~~ B ) /\ ( ( A X. { (/) } ) i^i ( B X. { 1o } ) ) = (/) ) -> E. x E. y ( ( x ~~ A /\ y ~~ B ) /\ ( x i^i y ) = (/) ) )
21	8, 9, 20	mp2an 426	1 |- E. x E. y ( ( x ~~ A /\ y ~~ B ) /\ ( x i^i y ) = (/) )

Syntax hints:   /\ wa 104   = wceq 1395   E.wex 1538   e. wcel 2200   _Vcvv 2800   i^i cin 3197   (/)c0 3492   {csn 3667   class class class wbr 4086   Oncon0 4458   X. cxp 4721   1oc1o 6570   ~~ cen 6902

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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-nul 4213  ax-pow 4262  ax-pr 4297  ax-un 4528

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-v 2802  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-tr 4186  df-id 4388  df-iord 4461  df-on 4463  df-suc 4466  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-fun 5326  df-fn 5327  df-f 5328  df-f1 5329  df-fo 5330  df-f1o 5331  df-1o 6577  df-en 6905

This theorem is referenced by: (None)