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

Theorem imasaddflemg 13529
Description: The image set operations are closed if the original operation is. (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 ) )
>. } )
imasaddfnlemg.v  |-  ( ph  ->  V  e.  W )
imasaddfnlemg.x  |-  ( ph  ->  .x.  e.  C )
imasaddflem.c  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
Assertion
Ref Expression
imasaddflemg  |-  ( ph  -> 
.xb  : ( B  X.  B ) --> B )
Distinct variable groups:    q, p, B   
a, b, p, q, V    .x. , p, q    F, a, b, p, q    ph, a,
b, p, q    .xb , a,
b, p, q
Allowed substitution hints:    B( a, b)    C( q, p, a, b)    .x. ( a, b)    W( q, p, a, b)

Proof of Theorem imasaddflemg
StepHypRef Expression
1 imasaddf.f . . 3  |-  ( ph  ->  F : V -onto-> B
)
2 imasaddf.e . . 3  |-  ( (
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 ) ) ) )
3 imasaddflem.a . . 3  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
4 imasaddfnlemg.v . . 3  |-  ( ph  ->  V  e.  W )
5 imasaddfnlemg.x . . 3  |-  ( ph  ->  .x.  e.  C )
61, 2, 3, 4, 5imasaddfnlemg 13527 . 2  |-  ( ph  -> 
.xb  Fn  ( B  X.  B ) )
7 fof 5590 . . . . . . . . . 10  |-  ( F : V -onto-> B  ->  F : V --> B )
81, 7syl 14 . . . . . . . . 9  |-  ( ph  ->  F : V --> B )
9 ffvelcdm 5810 . . . . . . . . . . 11  |-  ( ( F : V --> B  /\  p  e.  V )  ->  ( F `  p
)  e.  B )
10 ffvelcdm 5810 . . . . . . . . . . 11  |-  ( ( F : V --> B  /\  q  e.  V )  ->  ( F `  q
)  e.  B )
119, 10anim12dan 604 . . . . . . . . . 10  |-  ( ( F : V --> B  /\  ( p  e.  V  /\  q  e.  V
) )  ->  (
( F `  p
)  e.  B  /\  ( F `  q )  e.  B ) )
12 opelxpi 4781 . . . . . . . . . 10  |-  ( ( ( F `  p
)  e.  B  /\  ( F `  q )  e.  B )  ->  <. ( F `  p
) ,  ( F `
 q ) >.  e.  ( B  X.  B
) )
1311, 12syl 14 . . . . . . . . 9  |-  ( ( F : V --> B  /\  ( p  e.  V  /\  q  e.  V
) )  ->  <. ( F `  p ) ,  ( F `  q ) >.  e.  ( B  X.  B ) )
148, 13sylan 283 . . . . . . . 8  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  ->  <. ( F `  p
) ,  ( F `
 q ) >.  e.  ( B  X.  B
) )
15 imasaddflem.c . . . . . . . . 9  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
16 ffvelcdm 5810 . . . . . . . . 9  |-  ( ( F : V --> B  /\  ( p  .x.  q )  e.  V )  -> 
( F `  (
p  .x.  q )
)  e.  B )
178, 15, 16syl2an2r 599 . . . . . . . 8  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( F `  (
p  .x.  q )
)  e.  B )
1814, 17opelxpd 4782 . . . . . . 7  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  ->  <. <. ( F `  p ) ,  ( F `  q )
>. ,  ( F `  ( p  .x.  q
) ) >.  e.  ( ( B  X.  B
)  X.  B ) )
1918snssd 3839 . . . . . 6  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  ->  { <. <. ( F `  p ) ,  ( F `  q )
>. ,  ( F `  ( p  .x.  q
) ) >. }  C_  ( ( B  X.  B )  X.  B
) )
2019anassrs 400 . . . . 5  |-  ( ( ( ph  /\  p  e.  V )  /\  q  e.  V )  ->  { <. <.
( F `  p
) ,  ( F `
 q ) >. ,  ( F `  ( p  .x.  q ) ) >. }  C_  (
( B  X.  B
)  X.  B ) )
2120iunssd 4037 . . . 4  |-  ( (
ph  /\  p  e.  V )  ->  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. }  C_  ( ( B  X.  B )  X.  B ) )
2221iunssd 4037 . . 3  |-  ( ph  ->  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q )
>. ,  ( F `  ( p  .x.  q
) ) >. }  C_  ( ( B  X.  B )  X.  B
) )
233, 22eqsstrd 3274 . 2  |-  ( ph  -> 
.xb  C_  ( ( B  X.  B )  X.  B ) )
24 dff2 5821 . 2  |-  (  .xb  : ( B  X.  B
) --> B  <->  (  .xb  Fn  ( B  X.  B
)  /\  .xb  C_  (
( B  X.  B
)  X.  B ) ) )
256, 23, 24sylanbrc 417 1  |-  ( ph  -> 
.xb  : ( B  X.  B ) --> B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2203    C_ wss 3211   {csn 3689   <.cop 3692   U_ciun 3991    X. cxp 4747    Fn wfn 5347   -->wf 5348   -onto->wfo 5350   ` cfv 5352  (class class class)co 6050
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-un 3215  df-in 3217  df-ss 3224  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053
This theorem is referenced by:  imasaddf  13532  imasmulf  13535  qusaddflemg  13547
  Copyright terms: Public domain W3C validator