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

Theorem qusmulrng 14611
Description: Value of the multiplication operation in a quotient ring of a non-unital ring. Formerly part of proof for quscrng 14612. Similar to qusmul2 14608. (Contributed by Mario Carneiro, 15-Jun-2015.) (Revised by AV, 28-Feb-2025.)
Hypotheses
Ref Expression
qusmulrng.e  |-  .~  =  ( R ~QG  S )
qusmulrng.h  |-  H  =  ( R  /.s  .~  )
qusmulrng.b  |-  B  =  ( Base `  R
)
qusmulrng.p  |-  .x.  =  ( .r `  R )
qusmulrng.a  |-  .xb  =  ( .r `  H )
Assertion
Ref Expression
qusmulrng  |-  ( ( ( R  e. Rng  /\  S  e.  (2Ideal `  R
)  /\  S  e.  (SubGrp `  R ) )  /\  ( X  e.  B  /\  Y  e.  B ) )  -> 
( [ X ]  .~  .xb  [ Y ]  .~  )  =  [
( X  .x.  Y
) ]  .~  )

Proof of Theorem qusmulrng
Dummy variables  a  b  c  d are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 qusmulrng.h . . . 4  |-  H  =  ( R  /.s  .~  )
21a1i 9 . . 3  |-  ( ( R  e. Rng  /\  S  e.  (2Ideal `  R )  /\  S  e.  (SubGrp `  R ) )  ->  H  =  ( R  /.s  .~  ) )
3 qusmulrng.b . . . 4  |-  B  =  ( Base `  R
)
43a1i 9 . . 3  |-  ( ( R  e. Rng  /\  S  e.  (2Ideal `  R )  /\  S  e.  (SubGrp `  R ) )  ->  B  =  ( Base `  R ) )
5 qusmulrng.e . . . . 5  |-  .~  =  ( R ~QG  S )
63, 5eqger 13874 . . . 4  |-  ( S  e.  (SubGrp `  R
)  ->  .~  Er  B
)
763ad2ant3 1047 . . 3  |-  ( ( R  e. Rng  /\  S  e.  (2Ideal `  R )  /\  S  e.  (SubGrp `  R ) )  ->  .~  Er  B )
8 simp1 1024 . . 3  |-  ( ( R  e. Rng  /\  S  e.  (2Ideal `  R )  /\  S  e.  (SubGrp `  R ) )  ->  R  e. Rng )
9 eqid 2231 . . . 4  |-  (2Ideal `  R )  =  (2Ideal `  R )
10 qusmulrng.p . . . 4  |-  .x.  =  ( .r `  R )
113, 5, 9, 102idlcpblrng 14602 . . 3  |-  ( ( R  e. Rng  /\  S  e.  (2Ideal `  R )  /\  S  e.  (SubGrp `  R ) )  -> 
( ( a  .~  b  /\  c  .~  d
)  ->  ( a  .x.  c )  .~  (
b  .x.  d )
) )
128anim1i 340 . . . . 5  |-  ( ( ( R  e. Rng  /\  S  e.  (2Ideal `  R
)  /\  S  e.  (SubGrp `  R ) )  /\  ( b  e.  B  /\  d  e.  B ) )  -> 
( R  e. Rng  /\  ( b  e.  B  /\  d  e.  B
) ) )
13 3anass 1009 . . . . 5  |-  ( ( R  e. Rng  /\  b  e.  B  /\  d  e.  B )  <->  ( R  e. Rng  /\  ( b  e.  B  /\  d  e.  B ) ) )
1412, 13sylibr 134 . . . 4  |-  ( ( ( R  e. Rng  /\  S  e.  (2Ideal `  R
)  /\  S  e.  (SubGrp `  R ) )  /\  ( b  e.  B  /\  d  e.  B ) )  -> 
( R  e. Rng  /\  b  e.  B  /\  d  e.  B )
)
153, 10rngcl 14021 . . . 4  |-  ( ( R  e. Rng  /\  b  e.  B  /\  d  e.  B )  ->  (
b  .x.  d )  e.  B )
1614, 15syl 14 . . 3  |-  ( ( ( R  e. Rng  /\  S  e.  (2Ideal `  R
)  /\  S  e.  (SubGrp `  R ) )  /\  ( b  e.  B  /\  d  e.  B ) )  -> 
( b  .x.  d
)  e.  B )
17 qusmulrng.a . . 3  |-  .xb  =  ( .r `  H )
182, 4, 7, 8, 11, 16, 10, 17qusmulval 13483 . 2  |-  ( ( ( R  e. Rng  /\  S  e.  (2Ideal `  R
)  /\  S  e.  (SubGrp `  R ) )  /\  X  e.  B  /\  Y  e.  B
)  ->  ( [ X ]  .~  .xb  [ Y ]  .~  )  =  [
( X  .x.  Y
) ]  .~  )
19183expb 1231 1  |-  ( ( ( R  e. Rng  /\  S  e.  (2Ideal `  R
)  /\  S  e.  (SubGrp `  R ) )  /\  ( X  e.  B  /\  Y  e.  B ) )  -> 
( [ 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   ` cfv 5333  (class class class)co 6028    Er wer 6742   [cec 6743   Basecbs 13145   .rcmulr 13224    /.s cqus 13446  SubGrpcsubg 13817   ~QG cqg 13819  Rngcrng 14009  2Idealc2idl 14578
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-nul 4220  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-rmo 2519  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-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-1st 6312  df-2nd 6313  df-tpos 6454  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-4 9246  df-5 9247  df-6 9248  df-7 9249  df-8 9250  df-ndx 13148  df-slot 13149  df-base 13151  df-sets 13152  df-iress 13153  df-plusg 13236  df-mulr 13237  df-sca 13239  df-vsca 13240  df-ip 13241  df-0g 13404  df-iimas 13448  df-qus 13449  df-mgm 13502  df-sgrp 13548  df-mnd 13563  df-grp 13649  df-minusg 13650  df-sbg 13651  df-subg 13820  df-eqg 13822  df-cmn 13936  df-abl 13937  df-mgp 13998  df-rng 14010  df-oppr 14145  df-lssm 14432  df-sra 14514  df-rgmod 14515  df-lidl 14548  df-2idl 14579
This theorem is referenced by:  quscrng  14612
  Copyright terms: Public domain W3C validator