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

Theorem qusaddval 13368
Description: The addition in 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 )
qusaddf.p  |-  .x.  =  ( +g  `  R )
qusaddf.a  |-  .xb  =  ( +g  `  U )
Assertion
Ref Expression
qusaddval  |-  ( (
ph  /\  X  e.  V  /\  Y  e.  V
)  ->  ( [ X ]  .~  .xb  [ Y ]  .~  )  =  [
( X  .x.  Y
) ]  .~  )
Distinct variable groups:    a, b, p, q,  .~    ph, a, b, p, q    V, a, b, p, q    R, p, q    .x. , p, q    X, p, q    .xb , a,
b, p, q    Y, p, q
Allowed substitution hints:    R( a, b)    .x. ( a, b)    U( q, p, a, b)    X( a, b)    Y( a, b)    Z( q, p, a, b)

Proof of Theorem qusaddval
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 qusaddf.u . 2  |-  ( ph  ->  U  =  ( R 
/.s  .~  ) )
2 qusaddf.v . 2  |-  ( ph  ->  V  =  ( Base `  R ) )
3 qusaddf.r . 2  |-  ( ph  ->  .~  Er  V )
4 qusaddf.z . 2  |-  ( ph  ->  R  e.  Z )
5 qusaddf.e . 2  |-  ( ph  ->  ( ( a  .~  p  /\  b  .~  q
)  ->  ( a  .x.  b )  .~  (
p  .x.  q )
) )
6 qusaddf.c . 2  |-  ( (
ph  /\  ( p  e.  V  /\  q  e.  V ) )  -> 
( p  .x.  q
)  e.  V )
7 eqid 2229 . 2  |-  ( x  e.  V  |->  [ x ]  .~  )  =  ( x  e.  V  |->  [ x ]  .~  )
8 basfn 13091 . . . . . . 7  |-  Base  Fn  _V
94elexd 2813 . . . . . . 7  |-  ( ph  ->  R  e.  _V )
10 funfvex 5644 . . . . . . . 8  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1110funfni 5423 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
128, 9, 11sylancr 414 . . . . . 6  |-  ( ph  ->  ( Base `  R
)  e.  _V )
132, 12eqeltrd 2306 . . . . 5  |-  ( ph  ->  V  e.  _V )
14 erex 6704 . . . . 5  |-  (  .~  Er  V  ->  ( V  e.  _V  ->  .~  e.  _V ) )
153, 13, 14sylc 62 . . . 4  |-  ( ph  ->  .~  e.  _V )
161, 2, 7, 15, 4qusval 13356 . . 3  |-  ( ph  ->  U  =  ( ( x  e.  V  |->  [ x ]  .~  )  "s  R ) )
171, 2, 7, 15, 4quslem 13357 . . 3  |-  ( ph  ->  ( x  e.  V  |->  [ x ]  .~  ) : V -onto-> ( V /.  .~  ) )
18 qusaddf.p . . 3  |-  .x.  =  ( +g  `  R )
19 qusaddf.a . . 3  |-  .xb  =  ( +g  `  U )
2016, 2, 17, 4, 18, 19imasplusg 13341 . 2  |-  ( ph  -> 
.xb  =  U_ p  e.  V  U_ q  e.  V  { <. <. (
( x  e.  V  |->  [ x ]  .~  ) `  p ) ,  ( ( x  e.  V  |->  [ x ]  .~  ) `  q
) >. ,  ( ( x  e.  V  |->  [ x ]  .~  ) `  ( p  .x.  q
) ) >. } )
21 plusgslid 13145 . . . . 5  |-  ( +g  = Slot  ( +g  `  ndx )  /\  ( +g  `  ndx )  e.  NN )
2221slotex 13059 . . . 4  |-  ( R  e.  Z  ->  ( +g  `  R )  e. 
_V )
234, 22syl 14 . . 3  |-  ( ph  ->  ( +g  `  R
)  e.  _V )
2418, 23eqeltrid 2316 . 2  |-  ( ph  ->  .x.  e.  _V )
251, 2, 3, 4, 5, 6, 7, 20, 24qusaddvallemg 13366 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 1002    = wceq 1395    e. wcel 2200   _Vcvv 2799   class class class wbr 4083    |-> cmpt 4145    Fn wfn 5313   ` cfv 5318  (class class class)co 6001    Er wer 6677   [cec 6678   /.cqs 6679   Basecbs 13032   +g cplusg 13110    /.s cqus 13333
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-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-cnex 8090  ax-resscn 8091  ax-1cn 8092  ax-1re 8093  ax-icn 8094  ax-addcl 8095  ax-addrcl 8096  ax-mulcl 8097  ax-addcom 8099  ax-addass 8101  ax-i2m1 8104  ax-0lt1 8105  ax-0id 8107  ax-rnegex 8108  ax-pre-ltirr 8111  ax-pre-ltadd 8115
This theorem depends on definitions:  df-bi 117  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-tp 3674  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-er 6680  df-ec 6682  df-qs 6686  df-pnf 8183  df-mnf 8184  df-ltxr 8186  df-inn 9111  df-2 9169  df-3 9170  df-ndx 13035  df-slot 13036  df-base 13038  df-plusg 13123  df-mulr 13124  df-iimas 13335  df-qus 13336
This theorem is referenced by:  qusadd  13771
  Copyright terms: Public domain W3C validator