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

Theorem qusaddvallemg 13603
Description: Value of an operation defined on a quotient structure. (Contributed by Mario Carneiro, 24-Feb-2015.)
Hypotheses
Ref Expression
qusaddf.u  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
qusaddf.v  |-  ( ph  ->  V  =  ( Base `  R ) )
qusaddf.r  |-  ( ph  ->  .~  Er  V )
qusaddf.z  |-  ( ph  ->  R  e.  Z )
qusaddf.e  |-  ( ph  ->  ( ( a  .~  p  /\  b  .~  q
)  ->  ( a  .x.  b )  .~  (
p  .x.  q )
) )
qusaddf.c  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
qusaddflem.f  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
qusaddflem.g  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
qusaddflemg.x  |-  ( ph  ->  .x.  e.  W )
Assertion
Ref Expression
qusaddvallemg  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( [ X ]  .~  .xb  [ Y ]  .~  )  =  [
( X  .x.  Y
) ]  .~  )
Distinct variable groups:    a, b, p, q, x,  .~    F, a, b, p, q    ph, a,
b, p, q, x    V, a, b, p, q, x    R, p, q, x    .x. , p, q, x    X, p, q, x    .xb , a, b, p, q    Y, p, q, x
Allowed substitution hints:    R( a, b)    .xb (
x)    .x. ( a, b)    U( x, q, p, a, b)    F( x)    W( x, q, p, a, b)    X( a, b)    Y( a, b)    Z( x, q, p, a, b)

Proof of Theorem qusaddvallemg
StepHypRef Expression
1 qusaddf.u . . . 4  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
2 qusaddf.v . . . 4  |-  ( ph  ->  V  =  ( Base `  R ) )
3 qusaddflem.f . . . 4  |-  F  =  ( x  e.  V  |->  [ x ]  .~  )
4 qusaddf.r . . . . 5  |-  ( ph  ->  .~  Er  V )
5 qusaddf.z . . . . . . 7  |-  ( ph  ->  R  e.  Z )
6 basfn 13361 . . . . . . . 8  |-  Base  Fn  _V
7 elex 2827 . . . . . . . 8  |-  ( R  e.  Z  ->  R  e.  _V )
8 funfvex 5694 . . . . . . . . 9  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
98funfni 5465 . . . . . . . 8  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
106, 7, 9sylancr 414 . . . . . . 7  |-  ( R  e.  Z  ->  ( Base `  R )  e. 
_V )
115, 10syl 14 . . . . . 6  |-  ( ph  ->  ( Base `  R
)  e.  _V )
122, 11eqeltrd 2311 . . . . 5  |-  ( ph  ->  V  e.  _V )
13 erex 6806 . . . . 5  |-  (  .~  Er  V  ->  ( V  e.  _V  ->  .~  e.  _V ) )
144, 12, 13sylc 62 . . . 4  |-  ( ph  ->  .~  e.  _V )
151, 2, 3, 14, 5quslem 13594 . . 3  |-  ( ph  ->  F : V -onto-> ( V /.  .~  ) )
16 qusaddf.c . . . 4  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
17 qusaddf.e . . . 4  |-  ( ph  ->  ( ( a  .~  p  /\  b  .~  q
)  ->  ( a  .x.  b )  .~  (
p  .x.  q )
) )
184, 12, 3, 16, 17ercpbl 13601 . . 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 ) ) ) )
19 qusaddflem.g . . 3  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. ( F `  p ) ,  ( F `  q ) >. ,  ( F `  ( p 
.x.  q ) )
>. } )
20 qusaddflemg.x . . 3  |-  ( ph  ->  .x.  e.  W )
2115, 18, 19, 12, 20imasaddvallemg 13585 . 2  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( ( F `  X )  .xb  ( F `  Y
) )  =  ( F `  ( X 
.x.  Y ) ) )
2243ad2ant1 1045 . . . 4  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  .~  Er  V
)
23123ad2ant1 1045 . . . 4  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  V  e.  _V )
24 simp2 1025 . . . 4  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  X  e.  V )
2522, 23, 3, 24divsfvalg 13599 . . 3  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( F `  X )  =  [ X ]  .~  )
26 simp3 1026 . . . 4  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  Y  e.  V )
2722, 23, 3, 26divsfvalg 13599 . . 3  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( F `  Y )  =  [ Y ]  .~  )
2825, 27oveq12d 6078 . 2  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( ( F `  X )  .xb  ( F `  Y
) )  =  ( [ X ]  .~  .xb 
[ Y ]  .~  ) )
29163ad2antl1 1186 . . . 4  |-  ( ( ( ph  /\  X  e.  V  /\  Y  e.  V )  /\  (
p  e.  V  /\  q  e.  V )
)  ->  ( p  .x.  q )  e.  V
)
3029, 24, 26caovcld 6218 . . 3  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( X  .x.  Y )  e.  V
)
3122, 23, 3, 30divsfvalg 13599 . 2  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( F `  ( X  .x.  Y
) )  =  [
( X  .x.  Y
) ]  .~  )
3221, 28, 313eqtr3d 2275 1  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( [ X ]  .~  .xb  [ Y ]  .~  )  =  [
( X  .x.  Y
) ]  .~  )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    /\ w3a 1005    = wceq 1398    e. wcel 2205   _Vcvv 2815   {csn 3695   <.cop 3698   U_ciun 3997   class class class wbr 4115    |-> cmpt 4177    Fn wfn 5354   ` cfv 5359  (class class class)co 6060    Er wer 6779   [cec 6780   /.cqs 6781   Basecbs 13302    /.s cqus 13572
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-14 2208  ax-ext 2216  ax-coll 4231  ax-sep 4234  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-cnex 8236  ax-resscn 8237  ax-1re 8239  ax-addrcl 8242
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-id 4420  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-f 5363  df-f1 5364  df-fo 5365  df-f1o 5366  df-fv 5367  df-ov 6063  df-er 6782  df-ec 6784  df-qs 6788  df-inn 9260  df-ndx 13305  df-slot 13306  df-base 13308
This theorem is referenced by:  qusaddval  13605  qusmulval  13607
  Copyright terms: Public domain W3C validator