ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  unen Unicode version

Theorem unen 6872
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.
StepHypRef Expression
1 bren 6803 . . 3  |-  ( A 
~~  B  <->  E. x  x : A -1-1-onto-> B )
2 bren 6803 . . 3  |-  ( C 
~~  D  <->  E. y 
y : C -1-1-onto-> D )
3 eeanv 1948 . . . 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 2763 . . . . . . . 8  |-  x  e. 
_V
5 vex 2763 . . . . . . . 8  |-  y  e. 
_V
64, 5unex 4473 . . . . . . 7  |-  ( x  u.  y )  e. 
_V
7 f1oun 5521 . . . . . . 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 6810 . . . . . . 7  |-  ( ( ( x  u.  y
)  e.  _V  /\  ( x  u.  y
) : ( A  u.  C ) -1-1-onto-> ( B  u.  D ) )  ->  ( A  u.  C )  ~~  ( B  u.  D )
)
96, 7, 8sylancr 414 . . . . . 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 )
)
109ex 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
) ) )
1110exlimivv 1908 . . . 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
) ) )
123, 11sylbir 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
) ) )
131, 2, 12syl2anb 291 . 2  |-  ( ( A  ~~  B  /\  C  ~~  D )  -> 
( ( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) )  -> 
( A  u.  C
)  ~~  ( B  u.  D ) ) )
1413imp 124 1  |-  ( ( ( A  ~~  B  /\  C  ~~  D )  /\  ( ( A  i^i  C )  =  (/)  /\  ( B  i^i  D )  =  (/) ) )  ->  ( A  u.  C )  ~~  ( B  u.  D )
)
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1364   E.wex 1503    e. wcel 2164   _Vcvv 2760    u. cun 3152    i^i cin 3153   (/)c0 3447   class class class wbr 4030   -1-1-onto->wf1o 5254    ~~ cen 6794
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-en 6797
This theorem is referenced by:  enpr2d  6873  phplem2  6911  fiunsnnn  6939  unsnfi  6977  endjusym  7157  pm54.43  7252  endjudisj  7272  djuen  7273  frecfzennn  10500  unennn  12557
  Copyright terms: Public domain W3C validator