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

Theorem imasaddvallem 13431
Description: The operation of an image structure is defined to distribute over the mapping function. (Contributed by Mario Carneiro, 23-Feb-2015.)
Hypotheses
Ref Expression
imasaddf.f  |-  ( ph  ->  F : V -onto-> B
)
imasaddf.e  |-  ( (
ph  /\  ( a  e.  V  /\  b  e.  V )  /\  (
p  e.  V  /\  q  e.  V )
)  ->  ( (
( F `  a
)  =  ( F `
 p )  /\  ( F `  b )  =  ( F `  q ) )  -> 
( F `  (
a  .x.  b )
)  =  ( F `
 ( p  .x.  q ) ) ) )
imasaddflem.a  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
Assertion
Ref Expression
imasaddvallem  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( ( F `  X )  .xb  ( F `  Y
) )  =  ( F `  ( X 
.x.  Y ) ) )
Distinct variable groups:    q, p, B    a, b, p, q, V    .x. , p, q    X, p    F, a, b, p, q    ph, a, b, p, q    .xb , a, b, p, q    Y, p, q
Allowed substitution hints:    B( a, b)    .x. ( a, b)    X( q, a, b)    Y( a, b)

Proof of Theorem imasaddvallem
StepHypRef Expression
1 df-ov 5861 . 2  |-  ( ( F `  X ) 
.xb  ( F `  Y ) )  =  (  .xb  `  <. ( F `  X ) ,  ( F `  Y ) >. )
2 imasaddf.f . . . . . 6  |-  ( ph  ->  F : V -onto-> B
)
3 imasaddf.e . . . . . 6  |-  ( (
ph  /\  ( a  e.  V  /\  b  e.  V )  /\  (
p  e.  V  /\  q  e.  V )
)  ->  ( (
( F `  a
)  =  ( F `
 p )  /\  ( F `  b )  =  ( F `  q ) )  -> 
( F `  (
a  .x.  b )
)  =  ( F `
 ( p  .x.  q ) ) ) )
4 imasaddflem.a . . . . . 6  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
52, 3, 4imasaddfnlem 13430 . . . . 5  |-  ( ph  -> 
.xb  Fn  ( B  X.  B ) )
6 fnfun 5341 . . . . 5  |-  (  .xb  Fn  ( B  X.  B
)  ->  Fun  .xb  )
75, 6syl 15 . . . 4  |-  ( ph  ->  Fun  .xb  )
873ad2ant1 976 . . 3  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  Fun  .xb  )
9 fveq2 5525 . . . . . . . . . . 11  |-  ( p  =  X  ->  ( F `  p )  =  ( F `  X ) )
109opeq1d 3802 . . . . . . . . . 10  |-  ( p  =  X  ->  <. ( F `  p ) ,  ( F `  Y ) >.  =  <. ( F `  X ) ,  ( F `  Y ) >. )
11 oveq1 5865 . . . . . . . . . . 11  |-  ( p  =  X  ->  (
p  .x.  Y )  =  ( X  .x.  Y ) )
1211fveq2d 5529 . . . . . . . . . 10  |-  ( p  =  X  ->  ( F `  ( p  .x.  Y ) )  =  ( F `  ( X  .x.  Y ) ) )
1310, 12opeq12d 3804 . . . . . . . . 9  |-  ( p  =  X  ->  <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>.  =  <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>. )
1413sneqd 3653 . . . . . . . 8  |-  ( p  =  X  ->  { <. <.
( F `  p
) ,  ( F `
 Y ) >. ,  ( F `  ( p  .x.  Y ) ) >. }  =  { <. <. ( F `  X ) ,  ( F `  Y )
>. ,  ( F `  ( X  .x.  Y
) ) >. } )
1514ssiun2s 3946 . . . . . . 7  |-  ( X  e.  V  ->  { <. <.
( F `  X
) ,  ( F `
 Y ) >. ,  ( F `  ( X  .x.  Y ) ) >. }  C_  U_ p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>. } )
16153ad2ant2 977 . . . . . 6  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  { <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>. }  C_  U_ p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>. } )
17 fveq2 5525 . . . . . . . . . . . . 13  |-  ( q  =  Y  ->  ( F `  q )  =  ( F `  Y ) )
1817opeq2d 3803 . . . . . . . . . . . 12  |-  ( q  =  Y  ->  <. ( F `  p ) ,  ( F `  q ) >.  =  <. ( F `  p ) ,  ( F `  Y ) >. )
19 oveq2 5866 . . . . . . . . . . . . 13  |-  ( q  =  Y  ->  (
p  .x.  q )  =  ( p  .x.  Y ) )
2019fveq2d 5529 . . . . . . . . . . . 12  |-  ( q  =  Y  ->  ( F `  ( p  .x.  q ) )  =  ( F `  (
p  .x.  Y )
) )
2118, 20opeq12d 3804 . . . . . . . . . . 11  |-  ( q  =  Y  ->  <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>.  =  <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>. )
2221sneqd 3653 . . . . . . . . . 10  |-  ( q  =  Y  ->  { <. <.
( F `  p
) ,  ( F `
 q ) >. ,  ( F `  ( p  .x.  q ) ) >. }  =  { <. <. ( F `  p ) ,  ( F `  Y )
>. ,  ( F `  ( p  .x.  Y
) ) >. } )
2322ssiun2s 3946 . . . . . . . . 9  |-  ( Y  e.  V  ->  { <. <.
( F `  p
) ,  ( F `
 Y ) >. ,  ( F `  ( p  .x.  Y ) ) >. }  C_  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
2423ralrimivw 2627 . . . . . . . 8  |-  ( Y  e.  V  ->  A. p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>. }  C_  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
25 ss2iun 3920 . . . . . . . 8  |-  ( A. p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y )
>. ,  ( F `  ( p  .x.  Y
) ) >. }  C_  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q )
>. ,  ( F `  ( p  .x.  q
) ) >. }  ->  U_ p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y )
>. ,  ( F `  ( p  .x.  Y
) ) >. }  C_  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q )
>. ,  ( F `  ( p  .x.  q
) ) >. } )
2624, 25syl 15 . . . . . . 7  |-  ( Y  e.  V  ->  U_ p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>. }  C_  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
27263ad2ant3 978 . . . . . 6  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  U_ p  e.  V  { <. <. ( F `  p ) ,  ( F `  Y ) >. ,  ( F `  ( p 
.x.  Y ) )
>. }  C_  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
2816, 27sstrd 3189 . . . . 5  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  { <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>. }  C_  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
2943ad2ant1 976 . . . . 5  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  .xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
3028, 29sseqtr4d 3215 . . . 4  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  { <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>. }  C_  .xb  )
31 opex 4237 . . . . 5  |-  <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>.  e.  _V
3231snss 3748 . . . 4  |-  ( <. <. ( F `  X
) ,  ( F `
 Y ) >. ,  ( F `  ( X  .x.  Y ) ) >.  e.  .xb  <->  { <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>. }  C_  .xb  )
3330, 32sylibr 203 . . 3  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>.  e.  .xb  )
34 funopfv 5562 . . 3  |-  ( Fun  .xb  ->  ( <. <. ( F `  X ) ,  ( F `  Y ) >. ,  ( F `  ( X 
.x.  Y ) )
>.  e.  .xb  ->  (  .xb  ` 
<. ( F `  X
) ,  ( F `
 Y ) >.
)  =  ( F `
 ( X  .x.  Y ) ) ) )
358, 33, 34sylc 56 . 2  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  (  .xb  ` 
<. ( F `  X
) ,  ( F `
 Y ) >.
)  =  ( F `
 ( X  .x.  Y ) ) )
361, 35syl5eq 2327 1  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( ( F `  X )  .xb  ( F `  Y
) )  =  ( F `  ( X 
.x.  Y ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 358    /\ w3a 934    = wceq 1623    e. wcel 1684   A.wral 2543    C_ wss 3152   {csn 3640   <.cop 3643   U_ciun 3905    X. cxp 4687   Fun wfun 5249    Fn wfn 5250   -onto->wfo 5253   ` cfv 5255  (class class class)co 5858
This theorem is referenced by:  imasaddval  13434  imasmulval  13437  divsaddvallem  13453
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-14 1688  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264  ax-sep 4141  ax-nul 4149  ax-pr 4214
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-eu 2147  df-mo 2148  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ne 2448  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-sbc 2992  df-csb 3082  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-iun 3907  df-br 4024  df-opab 4078  df-mpt 4079  df-id 4309  df-xp 4695  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-rn 4700  df-iota 5219  df-fun 5257  df-fn 5258  df-f 5259  df-fo 5261  df-fv 5263  df-ov 5861
  Copyright terms: Public domain W3C validator