Theorem unen 7105

Description: Equinumerosity of union of disjoint sets. Theorem 4 of [Suppes] p. 92. (Contributed by NM, 11-Jun-1998.) (Revised by Mario Carneiro, 26-Apr-2015.)

Assertion

Ref	Expression
unen	|- ( ( ( A ~~ B /\ C ~~ D ) /\ ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) ) -> ( A u. C ) ~~ ( B u. D ) )

Proof of Theorem unen

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		bren 7030	. . 3 |- ( A ~~ B <-> E. x x : A -1-1-onto-> B )
2		bren 7030	. . 3 |- ( C ~~ D <-> E. y y : C -1-1-onto-> D )
3		eeanv 1992	. . . 4 |- ( E. x E. y ( x : A -1-1-onto-> B /\ y : C -1-1-onto-> D ) <-> ( E. x x : A -1-1-onto-> B /\ E. y y : C -1-1-onto-> D ) )
4		vex 2824	. . . . . . . 8 |- x e. _V
5		vex 2824	. . . . . . . 8 |- y e. _V
6	4, 5	unex 4587	. . . . . . 7 |- ( x u. y ) e. _V
7		f1oun 5659	. . . . . . 7 |- ( ( ( x : A -1-1-onto-> B /\ y : C -1-1-onto-> D ) /\ ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) ) -> ( x u. y ) : ( A u. C ) -1-1-onto-> ( B u. D ) )
8		f1oen3g 7040	. . . . . . 7 |- ( ( ( x u. y ) e. _V /\ ( x u. y ) : ( A u. C ) -1-1-onto-> ( B u. D ) ) -> ( A u. C ) ~~ ( B u. D ) )
9	6, 7, 8	sylancr 418	. . . . . 6 |- ( ( ( x : A -1-1-onto-> B /\ y : C -1-1-onto-> D ) /\ ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) ) -> ( A u. C ) ~~ ( B u. D ) )
10	9	ex 115	. . . . 5 |- ( ( x : A -1-1-onto-> B /\ y : C -1-1-onto-> D ) -> ( ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) -> ( A u. C ) ~~ ( B u. D ) ) )
11	10	exlimivv 1952	. . . 4 |- ( E. x E. y ( x : A -1-1-onto-> B /\ y : C -1-1-onto-> D ) -> ( ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) -> ( A u. C ) ~~ ( B u. D ) ) )
12	3, 11	sylbir 135	. . 3 |- ( ( E. x x : A -1-1-onto-> B /\ E. y y : C -1-1-onto-> D ) -> ( ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) -> ( A u. C ) ~~ ( B u. D ) ) )
13	1, 2, 12	syl2anb 291	. 2 |- ( ( A ~~ B /\ C ~~ D ) -> ( ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) -> ( A u. C ) ~~ ( B u. D ) ) )
14	13	imp 124	1 |- ( ( ( A ~~ B /\ C ~~ D ) /\ ( ( A i^i C ) = (/) /\ ( B i^i D ) = (/) ) ) -> ( A u. C ) ~~ ( B u. D ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   E.wex 1545   e. wcel 2209   _Vcvv 2821   u. cun 3218   i^i cin 3219   (/)c0 3520   class class class wbr 4130   -1-1-onto->wf1o 5376   ~~ cen 7020

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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 4249  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof 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-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-en 7023

This theorem is used by:  enpr2d  7111  phplem2  7154  fiunsnnn  7185  unsnfi  7226  endjusym  7436  pm54.43  7536  endjudisj  7566  djuen  7567  frecfzennn  10863  unennn  13288