MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mapfien2 Structured version   Unicode version

Theorem mapfien2 7860
Description: Equinumerousity relation for sets of finitely supported functions. (Contributed by Stefan O'Rear, 9-Jul-2015.) (Revised by AV, 7-Jul-2019.)
Hypotheses
Ref Expression
mapfien2.s  |-  S  =  { x  e.  ( B  ^m  A )  |  x finSupp  .0.  }
mapfien2.t  |-  T  =  { x  e.  ( D  ^m  C )  |  x finSupp  W }
mapfien2.ac  |-  ( ph  ->  A  ~~  C )
mapfien2.bd  |-  ( ph  ->  B  ~~  D )
mapfien2.z  |-  ( ph  ->  .0.  e.  B )
mapfien2.w  |-  ( ph  ->  W  e.  D )
Assertion
Ref Expression
mapfien2  |-  ( ph  ->  S  ~~  T )
Distinct variable groups:    x, A    x, B    x, C    x, D    x,  .0.    x, W
Allowed substitution hints:    ph( x)    S( x)    T( x)

Proof of Theorem mapfien2
Dummy variables  w  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mapfien2.z . . 3  |-  ( ph  ->  .0.  e.  B )
2 mapfien2.w . . 3  |-  ( ph  ->  W  e.  D )
3 mapfien2.bd . . 3  |-  ( ph  ->  B  ~~  D )
4 enfixsn 7619 . . 3  |-  ( (  .0.  e.  B  /\  W  e.  D  /\  B  ~~  D )  ->  E. y ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W ) )
51, 2, 3, 4syl3anc 1226 . 2  |-  ( ph  ->  E. y ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W ) )
6 mapfien2.ac . . . . 5  |-  ( ph  ->  A  ~~  C )
7 bren 7518 . . . . 5  |-  ( A 
~~  C  <->  E. z 
z : A -1-1-onto-> C )
86, 7sylib 196 . . . 4  |-  ( ph  ->  E. z  z : A -1-1-onto-> C )
9 mapfien2.s . . . . . . . . . 10  |-  S  =  { x  e.  ( B  ^m  A )  |  x finSupp  .0.  }
10 eqid 2454 . . . . . . . . . 10  |-  { x  e.  ( D  ^m  C
)  |  x finSupp  (
y `  .0.  ) }  =  { x  e.  ( D  ^m  C
)  |  x finSupp  (
y `  .0.  ) }
11 eqid 2454 . . . . . . . . . 10  |-  ( y `
 .0.  )  =  ( y `  .0.  )
12 f1ocnv 5810 . . . . . . . . . . 11  |-  ( z : A -1-1-onto-> C  ->  `' z : C -1-1-onto-> A )
13123ad2ant2 1016 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  `' z : C -1-1-onto-> A )
14 simp3 996 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  y : B
-1-1-onto-> D )
1563ad2ant1 1015 . . . . . . . . . . 11  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  A  ~~  C )
16 relen 7514 . . . . . . . . . . . 12  |-  Rel  ~~
1716brrelexi 5029 . . . . . . . . . . 11  |-  ( A 
~~  C  ->  A  e.  _V )
1815, 17syl 16 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  A  e.  _V )
1933ad2ant1 1015 . . . . . . . . . . 11  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  B  ~~  D )
2016brrelexi 5029 . . . . . . . . . . 11  |-  ( B 
~~  D  ->  B  e.  _V )
2119, 20syl 16 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  B  e.  _V )
2216brrelex2i 5030 . . . . . . . . . . 11  |-  ( A 
~~  C  ->  C  e.  _V )
2315, 22syl 16 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  C  e.  _V )
2416brrelex2i 5030 . . . . . . . . . . 11  |-  ( B 
~~  D  ->  D  e.  _V )
2519, 24syl 16 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  D  e.  _V )
2613ad2ant1 1015 . . . . . . . . . 10  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  .0.  e.  B )
279, 10, 11, 13, 14, 18, 21, 23, 25, 26mapfien 7859 . . . . . . . . 9  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  ( w  e.  S  |->  ( y  o.  ( w  o.  `' z ) ) ) : S -1-1-onto-> { x  e.  ( D  ^m  C
)  |  x finSupp  (
y `  .0.  ) } )
28 ovex 6298 . . . . . . . . . . 11  |-  ( B  ^m  A )  e. 
_V
299, 28rabex2 4590 . . . . . . . . . 10  |-  S  e. 
_V
3029f1oen 7529 . . . . . . . . 9  |-  ( ( w  e.  S  |->  ( y  o.  ( w  o.  `' z ) ) ) : S -1-1-onto-> {
x  e.  ( D  ^m  C )  |  x finSupp  ( y `  .0.  ) }  ->  S  ~~  { x  e.  ( D  ^m  C )  |  x finSupp  ( y `  .0.  ) } )
3127, 30syl 16 . . . . . . . 8  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  y : B -1-1-onto-> D
)  ->  S  ~~  { x  e.  ( D  ^m  C )  |  x finSupp  ( y `  .0.  ) } )
32313adant3r 1223 . . . . . . 7  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W ) )  ->  S  ~~  { x  e.  ( D  ^m  C
)  |  x finSupp  (
y `  .0.  ) } )
33 breq2 4443 . . . . . . . . . . 11  |-  ( ( y `  .0.  )  =  W  ->  ( x finSupp 
( y `  .0.  ) 
<->  x finSupp  W ) )
3433rabbidv 3098 . . . . . . . . . 10  |-  ( ( y `  .0.  )  =  W  ->  { x  e.  ( D  ^m  C
)  |  x finSupp  (
y `  .0.  ) }  =  { x  e.  ( D  ^m  C
)  |  x finSupp  W } )
35 mapfien2.t . . . . . . . . . 10  |-  T  =  { x  e.  ( D  ^m  C )  |  x finSupp  W }
3634, 35syl6eqr 2513 . . . . . . . . 9  |-  ( ( y `  .0.  )  =  W  ->  { x  e.  ( D  ^m  C
)  |  x finSupp  (
y `  .0.  ) }  =  T )
3736adantl 464 . . . . . . . 8  |-  ( ( y : B -1-1-onto-> D  /\  ( y `  .0.  )  =  W )  ->  { x  e.  ( D  ^m  C )  |  x finSupp  ( y `  .0.  ) }  =  T )
38373ad2ant3 1017 . . . . . . 7  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W ) )  ->  { x  e.  ( D  ^m  C )  |  x finSupp  ( y `  .0.  ) }  =  T )
3932, 38breqtrd 4463 . . . . . 6  |-  ( (
ph  /\  z : A
-1-1-onto-> C  /\  ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W ) )  ->  S  ~~  T )
40393exp 1193 . . . . 5  |-  ( ph  ->  ( z : A -1-1-onto-> C  ->  ( ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W )  ->  S  ~~  T ) ) )
4140exlimdv 1729 . . . 4  |-  ( ph  ->  ( E. z  z : A -1-1-onto-> C  ->  ( (
y : B -1-1-onto-> D  /\  ( y `  .0.  )  =  W )  ->  S  ~~  T ) ) )
428, 41mpd 15 . . 3  |-  ( ph  ->  ( ( y : B -1-1-onto-> D  /\  ( y `
 .0.  )  =  W )  ->  S  ~~  T ) )
4342exlimdv 1729 . 2  |-  ( ph  ->  ( E. y ( y : B -1-1-onto-> D  /\  ( y `  .0.  )  =  W )  ->  S  ~~  T ) )
445, 43mpd 15 1  |-  ( ph  ->  S  ~~  T )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 367    /\ w3a 971    = wceq 1398   E.wex 1617    e. wcel 1823   {crab 2808   _Vcvv 3106   class class class wbr 4439    |-> cmpt 4497   `'ccnv 4987    o. ccom 4992   -1-1-onto->wf1o 5569   ` cfv 5570  (class class class)co 6270    ^m cmap 7412    ~~ cen 7506   finSupp cfsupp 7821
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-tp 4021  df-op 4023  df-uni 4236  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-tr 4533  df-eprel 4780  df-id 4784  df-po 4789  df-so 4790  df-fr 4827  df-we 4829  df-ord 4870  df-on 4871  df-lim 4872  df-suc 4873  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-om 6674  df-1st 6773  df-2nd 6774  df-supp 6892  df-1o 7122  df-er 7303  df-map 7414  df-en 7510  df-dom 7511  df-fin 7513  df-fsupp 7822
This theorem is referenced by:  frlmpwfi  31287
  Copyright terms: Public domain W3C validator