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

Theorem qusmulf 13636
Description: The multiplication in a quotient structure as a function. (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
qusmulf  |-  ( ph  -> 
.xb  : ( ( V /.  .~  )  X.  ( V /.  .~  ) ) --> ( V /.  .~  ) )
Distinct variable groups:    a, b, p, q,  .~    ph, a, b, p, q    V, a, b, p, q    R, p, q    .x. , p, q    .xb , a, b, p, q
Allowed substitution hints:    R( a, b)    .x. ( a, b)    U( q, p, a, b)    Z( q, p, a, b)

Proof of Theorem qusmulf
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 2238 . 2  |-  ( x  e.  V  |->  [ x ]  .~  )  =  ( x  e.  V  |->  [ x ]  .~  )
8 basfn 13389 . . . . . . 7  |-  Base  Fn  _V
94elexd 2835 . . . . . . 7  |-  ( ph  ->  R  e.  _V )
10 funfvex 5707 . . . . . . . 8  |-  ( ( Fun  Base  /\  R  e. 
dom  Base )  ->  ( Base `  R )  e. 
_V )
1110funfni 5478 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  R  e.  _V )  ->  ( Base `  R )  e. 
_V )
128, 9, 11sylancr 418 . . . . . 6  |-  ( ph  ->  ( Base `  R
)  e.  _V )
132, 12eqeltrd 2315 . . . . 5  |-  ( ph  ->  V  e.  _V )
14 erex 6821 . . . . 5  |-  (  .~  Er  V  ->  ( V  e.  _V  ->  .~  e.  _V ) )
153, 13, 14sylc 62 . . . 4  |-  ( ph  ->  .~  e.  _V )
161, 2, 7, 15, 4qusval 13621 . . 3  |-  ( ph  ->  U  =  ( ( x  e.  V  |->  [ x ]  .~  )  "s  R ) )
171, 2, 7, 15, 4quslem 13622 . . 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 13607 . 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 13463 . . . . 5  |-  ( .r  = Slot  ( .r `  ndx )  /\  ( .r `  ndx )  e.  NN )
2221slotex 13357 . . . 4  |-  ( R  e.  Z  ->  ( .r `  R )  e. 
_V )
234, 22syl 14 . . 3  |-  ( ph  ->  ( .r `  R
)  e.  _V )
2418, 23eqeltrid 2325 . 2  |-  ( ph  ->  .x.  e.  _V )
251, 2, 3, 4, 5, 6, 7, 20, 24qusaddflemg 13632 1  |-  ( ph  -> 
.xb  : ( ( V /.  .~  )  X.  ( V /.  .~  ) ) --> ( V /.  .~  ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    = wceq 1402    e. wcel 2209   _Vcvv 2821   class class class wbr 4125    |-> cmpt 4187    X. cxp 4767    Fn wfn 5367   -->wf 5368   ` cfv 5372  (class class class)co 6075    Er wer 6794   [cec 6795   /.cqs 6796   Basecbs 13330   .rcmulr 13409    /.s cqus 13600
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 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4241  ax-sep 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-setind 4679  ax-cnex 8260  ax-resscn 8261  ax-1cn 8262  ax-1re 8263  ax-icn 8264  ax-addcl 8265  ax-addrcl 8266  ax-mulcl 8267  ax-addcom 8269  ax-addass 8271  ax-i2m1 8274  ax-0lt1 8275  ax-0id 8277  ax-rnegex 8278  ax-pre-ltirr 8281  ax-pre-lttrn 8283  ax-pre-ltadd 8285
This theorem depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3687  df-sn 3711  df-pr 3712  df-tp 3713  df-op 3714  df-uni 3931  df-int 3966  df-iun 4009  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-ima 4782  df-iota 5332  df-fun 5374  df-fn 5375  df-f 5376  df-f1 5377  df-fo 5378  df-f1o 5379  df-fv 5380  df-ov 6078  df-oprab 6079  df-mpo 6080  df-er 6797  df-ec 6799  df-qs 6803  df-pnf 8352  df-mnf 8353  df-ltxr 8355  df-inn 9284  df-2 9342  df-3 9343  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-mulr 13422  df-iimas 13601  df-qus 13602
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator