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

Theorem qusmulval 13483
Description: The multiplication 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 )
qusmulf.p  |-  .x.  =  ( .r `  R )
qusmulf.a  |-  .xb  =  ( .r `  U )
Assertion
Ref Expression
qusmulval  |-  ( (
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 qusmulval
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 2231 . 2  |-  ( x  e.  V  |->  [ x ]  .~  )  =  ( x  e.  V  |->  [ x ]  .~  )
8 basfn 13204 . . . . . . 7  |-  Base  Fn  _V
94elexd 2817 . . . . . . 7  |-  ( ph  ->  R  e.  _V )
10 funfvex 5665 . . . . . . . 8  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1110funfni 5439 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
128, 9, 11sylancr 414 . . . . . 6  |-  ( ph  ->  ( Base `  R
)  e.  _V )
132, 12eqeltrd 2308 . . . . 5  |-  ( ph  ->  V  e.  _V )
14 erex 6769 . . . . 5  |-  (  .~  Er  V  ->  ( V  e.  _V  ->  .~  e.  _V ) )
153, 13, 14sylc 62 . . . 4  |-  ( ph  ->  .~  e.  _V )
161, 2, 7, 15, 4qusval 13469 . . 3  |-  ( ph  ->  U  =  ( ( x  e.  V  |->  [ x ]  .~  )  "s  R ) )
171, 2, 7, 15, 4quslem 13470 . . 3  |-  ( ph  ->  ( x  e.  V  |->  [ x ]  .~  ) : V -onto-> ( V /.  .~  ) )
18 qusmulf.p . . 3  |-  .x.  =  ( .r `  R )
19 qusmulf.a . . 3  |-  .xb  =  ( .r `  U )
2016, 2, 17, 4, 18, 19imasmulr 13455 . 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 mulrslid 13278 . . . . 5  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2221slotex 13172 . . . 4  |-  ( R  e.  Z  ->  ( .r `  R )  e. 
_V )
234, 22syl 14 . . 3  |-  ( ph  ->  ( .r `  R
)  e.  _V )
2418, 23eqeltrid 2318 . 2  |-  ( ph  ->  .x.  e.  _V )
251, 2, 3, 4, 5, 6, 7, 20, 24qusaddvallemg 13479 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 2202   _Vcvv 2803   class class class wbr 4093    |-> cmpt 4155    Fn wfn 5328   ` cfv 5333  (class class class)co 6028    Er wer 6742   [cec 6743   /.cqs 6744   Basecbs 13145   .rcmulr 13224    /.s cqus 13446
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 619  ax-in2 620  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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8166  ax-resscn 8167  ax-1cn 8168  ax-1re 8169  ax-icn 8170  ax-addcl 8171  ax-addrcl 8172  ax-mulcl 8173  ax-addcom 8175  ax-addass 8177  ax-i2m1 8180  ax-0lt1 8181  ax-0id 8183  ax-rnegex 8184  ax-pre-ltirr 8187  ax-pre-lttrn 8189  ax-pre-ltadd 8191
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-nul 3497  df-pw 3658  df-sn 3679  df-pr 3680  df-tp 3681  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-ov 6031  df-oprab 6032  df-mpo 6033  df-er 6745  df-ec 6747  df-qs 6751  df-pnf 8258  df-mnf 8259  df-ltxr 8261  df-inn 9186  df-2 9244  df-3 9245  df-ndx 13148  df-slot 13149  df-base 13151  df-plusg 13236  df-mulr 13237  df-iimas 13448  df-qus 13449
This theorem is referenced by:  qusrhm  14607  qusmul2  14608  qusmulrng  14611
  Copyright terms: Public domain W3C validator