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

Theorem xpen 6739
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 6641 . . . 4  |-  ( A 
~~  B  <->  E. f 
f : A -1-1-onto-> B )
21biimpi 119 . . 3  |-  ( A 
~~  B  ->  E. f 
f : A -1-1-onto-> B )
32adantr 274 . 2  |-  ( ( A  ~~  B  /\  C  ~~  D )  ->  E. f  f : A
-1-1-onto-> B )
4 bren 6641 . . . . 5  |-  ( C 
~~  D  <->  E. g 
g : C -1-1-onto-> D )
54biimpi 119 . . . 4  |-  ( C 
~~  D  ->  E. g 
g : C -1-1-onto-> D )
65ad2antlr 480 . . 3  |-  ( ( ( A  ~~  B  /\  C  ~~  D )  /\  f : A -1-1-onto-> B
)  ->  E. g 
g : C -1-1-onto-> D )
7 relen 6638 . . . . . . 7  |-  Rel  ~~
87brrelex1i 4582 . . . . . 6  |-  ( A 
~~  B  ->  A  e.  _V )
97brrelex1i 4582 . . . . . 6  |-  ( C 
~~  D  ->  C  e.  _V )
10 xpexg 4653 . . . . . 6  |-  ( ( A  e.  _V  /\  C  e.  _V )  ->  ( A  X.  C
)  e.  _V )
118, 9, 10syl2an 287 . . . . 5  |-  ( ( A  ~~  B  /\  C  ~~  D )  -> 
( A  X.  C
)  e.  _V )
1211ad2antrr 479 . . . 4  |-  ( ( ( ( A  ~~  B  /\  C  ~~  D
)  /\  f : A
-1-1-onto-> B )  /\  g : C -1-1-onto-> D )  ->  ( A  X.  C )  e. 
_V )
13 simplr 519 . . . . . 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 5368 . . . . . . . 8  |-  ( f : A -1-1-onto-> B  ->  f  Fn  A )
15 dffn5im 5467 . . . . . . . 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 5356 . . . . . . 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 146 . . . . 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 109 . . . . . 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 5368 . . . . . . . 8  |-  ( g : C -1-1-onto-> D  ->  g  Fn  C )
22 dffn5im 5467 . . . . . . . 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 5356 . . . . . . 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 146 . . . . 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 6738 . . . 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 6651 . . . 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 408 . . 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 1870 . 2  |-  ( ( ( A  ~~  B  /\  C  ~~  D )  /\  f : A -1-1-onto-> B
)  ->  ( A  X.  C )  ~~  ( B  X.  D ) )
313, 30exlimddv 1870 1  |-  ( ( A  ~~  B  /\  C  ~~  D )  -> 
( A  X.  C
)  ~~  ( B  X.  D ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 103    <-> wb 104    = wceq 1331   E.wex 1468    e. wcel 1480   _Vcvv 2686   <.cop 3530   class class class wbr 3929    |-> cmpt 3989    X. cxp 4537    Fn wfn 5118   -1-1-onto->wf1o 5122   ` cfv 5123    e. cmpo 5776    ~~ cen 6632
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-coll 4043  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-reu 2423  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-iun 3815  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-f1 5128  df-fo 5129  df-f1o 5130  df-fv 5131  df-oprab 5778  df-mpo 5779  df-1st 6038  df-2nd 6039  df-en 6635
This theorem is referenced by:  xpdjuen  7074  xpnnen  11907  xpomen  11908  qnnen  11944
  Copyright terms: Public domain W3C validator