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

Theorem xpen 6906
Description: Equinumerosity law for Cartesian product. Proposition 4.22(b) of [Mendelson] p. 254. (Contributed by NM, 24-Jul-2004.)
Assertion
Ref Expression
xpen  |-  ( ( A  ~~  B  /\  C  ~~  D )  -> 
( A  X.  C
)  ~~  ( B  X.  D ) )

Proof of Theorem xpen
Dummy variables  f  g  x  y are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bren 6806 . . . 4  |-  ( A 
~~  B  <->  E. f 
f : A -1-1-onto-> B )
21biimpi 120 . . 3  |-  ( A 
~~  B  ->  E. f 
f : A -1-1-onto-> B )
32adantr 276 . 2  |-  ( ( A  ~~  B  /\  C  ~~  D )  ->  E. f  f : A
-1-1-onto-> B )
4 bren 6806 . . . . 5  |-  ( C 
~~  D  <->  E. g 
g : C -1-1-onto-> D )
54biimpi 120 . . . 4  |-  ( C 
~~  D  ->  E. g 
g : C -1-1-onto-> D )
65ad2antlr 489 . . 3  |-  ( ( ( A  ~~  B  /\  C  ~~  D )  /\  f : A -1-1-onto-> B
)  ->  E. g 
g : C -1-1-onto-> D )
7 relen 6803 . . . . . . 7  |-  Rel  ~~
87brrelex1i 4706 . . . . . 6  |-  ( A 
~~  B  ->  A  e.  _V )
97brrelex1i 4706 . . . . . 6  |-  ( C 
~~  D  ->  C  e.  _V )
10 xpexg 4777 . . . . . 6  |-  ( ( A  e.  _V  /\  C  e.  _V )  ->  ( A  X.  C
)  e.  _V )
118, 9, 10syl2an 289 . . . . 5  |-  ( ( A  ~~  B  /\  C  ~~  D )  -> 
( A  X.  C
)  e.  _V )
1211ad2antrr 488 . . . 4  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  ( A  X.  C )  e. 
_V )
13 simplr 528 . . . . . 6  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  f : A -1-1-onto-> B )
14 f1ofn 5505 . . . . . . . 8  |-  ( f : A -1-1-onto-> B  ->  f  Fn  A )
15 dffn5im 5606 . . . . . . . 8  |-  ( f  Fn  A  ->  f  =  ( x  e.  A  |->  ( f `  x ) ) )
1614, 15syl 14 . . . . . . 7  |-  ( f : A -1-1-onto-> B  ->  f  =  ( x  e.  A  |->  ( f `  x
) ) )
17 f1oeq1 5492 . . . . . . 7  |-  ( f  =  ( x  e.  A  |->  ( f `  x ) )  -> 
( f : A -1-1-onto-> B  <->  ( x  e.  A  |->  ( f `  x ) ) : A -1-1-onto-> B ) )
1813, 16, 173syl 17 . . . . . 6  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  (
f : A -1-1-onto-> B  <->  ( x  e.  A  |->  ( f `
 x ) ) : A -1-1-onto-> B ) )
1913, 18mpbid 147 . . . . 5  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  (
x  e.  A  |->  ( f `  x ) ) : A -1-1-onto-> B )
20 simpr 110 . . . . . 6  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  g : C -1-1-onto-> D )
21 f1ofn 5505 . . . . . . . 8  |-  ( g : C -1-1-onto-> D  ->  g  Fn  C )
22 dffn5im 5606 . . . . . . . 8  |-  ( g  Fn  C  ->  g  =  ( y  e.  C  |->  ( g `  y ) ) )
2321, 22syl 14 . . . . . . 7  |-  ( g : C -1-1-onto-> D  ->  g  =  ( y  e.  C  |->  ( g `  y
) ) )
24 f1oeq1 5492 . . . . . . 7  |-  ( g  =  ( y  e.  C  |->  ( g `  y ) )  -> 
( g : C -1-1-onto-> D  <->  ( y  e.  C  |->  ( g `  y ) ) : C -1-1-onto-> D ) )
2520, 23, 243syl 17 . . . . . 6  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  (
g : C -1-1-onto-> D  <->  ( y  e.  C  |->  ( g `
 y ) ) : C -1-1-onto-> D ) )
2620, 25mpbid 147 . . . . 5  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  (
y  e.  C  |->  ( g `  y ) ) : C -1-1-onto-> D )
2719, 26xpf1o 6905 . . . 4  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  (
x  e.  A , 
y  e.  C  |->  <.
( f `  x
) ,  ( g `
 y ) >.
) : ( A  X.  C ) -1-1-onto-> ( B  X.  D ) )
28 f1oeng 6816 . . . 4  |-  ( ( ( A  X.  C
)  e.  _V  /\  ( x  e.  A ,  y  e.  C  |-> 
<. ( f `  x
) ,  ( g `
 y ) >.
) : ( A  X.  C ) -1-1-onto-> ( B  X.  D ) )  ->  ( A  X.  C )  ~~  ( B  X.  D ) )
2912, 27, 28syl2anc 411 . . 3  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  ( A  X.  C )  ~~  ( B  X.  D
) )
306, 29exlimddv 1913 . 2  |-  ( ( ( A  ~~  B  /\  C  ~~  D )  /\  f : A -1-1-onto-> B
)  ->  ( A  X.  C )  ~~  ( B  X.  D ) )
313, 30exlimddv 1913 1  |-  ( ( A  ~~  B  /\  C  ~~  D )  -> 
( A  X.  C
)  ~~  ( B  X.  D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1364   E.wex 1506    e. wcel 2167   _Vcvv 2763   <.cop 3625   class class class wbr 4033    |-> cmpt 4094    X. cxp 4661    Fn wfn 5253   -1-1-onto->wf1o 5257   ` cfv 5258    e. cmpo 5924    ~~ cen 6797
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-reu 2482  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-oprab 5926  df-mpo 5927  df-1st 6198  df-2nd 6199  df-en 6800
This theorem is referenced by:  xpdjuen  7285  xpnnen  12611  xpomen  12612  qnnen  12648
  Copyright terms: Public domain W3C validator