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

Theorem sralmod 14212
Description: The subring algebra is a left module. (Contributed by Stefan O'Rear, 27-Nov-2014.)
Hypothesis
Ref Expression
sralmod.a 𝐴 = ((subringAlg ‘𝑊)‘𝑆)
Assertion
Ref Expression
sralmod (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ LMod)

Proof of Theorem sralmod
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sralmod.a . . . 4 𝐴 = ((subringAlg ‘𝑊)‘𝑆)
21a1i 9 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 = ((subringAlg ‘𝑊)‘𝑆))
3 eqid 2205 . . . 4 (Base‘𝑊) = (Base‘𝑊)
43subrgss 13984 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ⊆ (Base‘𝑊))
5 subrgrcl 13988 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑊 ∈ Ring)
62, 4, 5srabaseg 14201 . 2 (𝑆 ∈ (SubRing‘𝑊) → (Base‘𝑊) = (Base‘𝐴))
72, 4, 5sraaddgg 14202 . 2 (𝑆 ∈ (SubRing‘𝑊) → (+g𝑊) = (+g𝐴))
82, 4, 5srascag 14204 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑊s 𝑆) = (Scalar‘𝐴))
92, 4, 5sravscag 14205 . 2 (𝑆 ∈ (SubRing‘𝑊) → (.r𝑊) = ( ·𝑠𝐴))
10 eqidd 2206 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (𝑊s 𝑆) = (𝑊s 𝑆))
11 eqidd 2206 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (Base‘𝑊) = (Base‘𝑊))
12 id 19 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ∈ (SubRing‘𝑊))
1310, 11, 5, 12ressbasd 12899 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑆 ∩ (Base‘𝑊)) = (Base‘(𝑊s 𝑆)))
14 eqidd 2206 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (+g𝑊) = (+g𝑊))
1510, 14, 12, 5ressplusgd 12961 . 2 (𝑆 ∈ (SubRing‘𝑊) → (+g𝑊) = (+g‘(𝑊s 𝑆)))
16 eqid 2205 . . . 4 (𝑊s 𝑆) = (𝑊s 𝑆)
17 eqid 2205 . . . 4 (.r𝑊) = (.r𝑊)
1816, 17ressmulrg 12977 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑊 ∈ Ring) → (.r𝑊) = (.r‘(𝑊s 𝑆)))
195, 18mpdan 421 . 2 (𝑆 ∈ (SubRing‘𝑊) → (.r𝑊) = (.r‘(𝑊s 𝑆)))
20 eqid 2205 . . 3 (1r𝑊) = (1r𝑊)
2116, 20subrg1 13993 . 2 (𝑆 ∈ (SubRing‘𝑊) → (1r𝑊) = (1r‘(𝑊s 𝑆)))
2216subrgring 13986 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑊s 𝑆) ∈ Ring)
235ringgrpd 13767 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑊 ∈ Grp)
247oveqdr 5972 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊))) → (𝑥(+g𝑊)𝑦) = (𝑥(+g𝐴)𝑦))
2511, 6, 24grppropd 13349 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (𝑊 ∈ Grp ↔ 𝐴 ∈ Grp))
2623, 25mpbid 147 . 2 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ Grp)
2753ad2ant1 1021 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑊 ∈ Ring)
28 elinel2 3360 . . . 4 (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) → 𝑥 ∈ (Base‘𝑊))
29283ad2ant2 1022 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑥 ∈ (Base‘𝑊))
30 simp3 1002 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑦 ∈ (Base‘𝑊))
313, 17ringcl 13775 . . 3 ((𝑊 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊)) → (𝑥(.r𝑊)𝑦) ∈ (Base‘𝑊))
3227, 29, 30, 31syl3anc 1250 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → (𝑥(.r𝑊)𝑦) ∈ (Base‘𝑊))
335adantr 276 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑊 ∈ Ring)
34 simpr1 1006 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)))
3534elin2d 3363 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (Base‘𝑊))
36 simpr2 1007 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (Base‘𝑊))
37 simpr3 1008 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑧 ∈ (Base‘𝑊))
38 eqid 2205 . . . 4 (+g𝑊) = (+g𝑊)
393, 38, 17ringdi 13780 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → (𝑥(.r𝑊)(𝑦(+g𝑊)𝑧)) = ((𝑥(.r𝑊)𝑦)(+g𝑊)(𝑥(.r𝑊)𝑧)))
4033, 35, 36, 37, 39syl13anc 1252 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → (𝑥(.r𝑊)(𝑦(+g𝑊)𝑧)) = ((𝑥(.r𝑊)𝑦)(+g𝑊)(𝑥(.r𝑊)𝑧)))
415adantr 276 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑊 ∈ Ring)
42 simpr1 1006 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)))
4342elin2d 3363 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (Base‘𝑊))
44 simpr2 1007 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)))
4544elin2d 3363 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (Base‘𝑊))
46 simpr3 1008 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑧 ∈ (Base‘𝑊))
473, 38, 17ringdir 13781 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(+g𝑊)𝑦)(.r𝑊)𝑧) = ((𝑥(.r𝑊)𝑧)(+g𝑊)(𝑦(.r𝑊)𝑧)))
4841, 43, 45, 46, 47syl13anc 1252 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(+g𝑊)𝑦)(.r𝑊)𝑧) = ((𝑥(.r𝑊)𝑧)(+g𝑊)(𝑦(.r𝑊)𝑧)))
493, 17ringass 13778 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(.r𝑊)𝑦)(.r𝑊)𝑧) = (𝑥(.r𝑊)(𝑦(.r𝑊)𝑧)))
5041, 43, 45, 46, 49syl13anc 1252 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(.r𝑊)𝑦)(.r𝑊)𝑧) = (𝑥(.r𝑊)(𝑦(.r𝑊)𝑧)))
513, 17, 20ringlidm 13785 . . 3 ((𝑊 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑊)) → ((1r𝑊)(.r𝑊)𝑥) = 𝑥)
525, 51sylan 283 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (Base‘𝑊)) → ((1r𝑊)(.r𝑊)𝑥) = 𝑥)
536, 7, 8, 9, 13, 15, 19, 21, 22, 26, 32, 40, 48, 50, 52islmodd 14055 1 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ LMod)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 981   = wceq 1373  wcel 2176  cin 3165  cfv 5271  (class class class)co 5944  Basecbs 12832  s cress 12833  +gcplusg 12909  .rcmulr 12910  Grpcgrp 13332  1rcur 13721  Ringcrg 13758  SubRingcsubrg 13979  LModclmod 14049  subringAlg csra 14195
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-cnex 8016  ax-resscn 8017  ax-1cn 8018  ax-1re 8019  ax-icn 8020  ax-addcl 8021  ax-addrcl 8022  ax-mulcl 8023  ax-addcom 8025  ax-addass 8027  ax-i2m1 8030  ax-0lt1 8031  ax-0id 8033  ax-rnegex 8034  ax-pre-ltirr 8037  ax-pre-lttrn 8039  ax-pre-ltadd 8041
This theorem depends on definitions:  df-bi 117  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-nel 2472  df-ral 2489  df-rex 2490  df-reu 2491  df-rmo 2492  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-id 4340  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-riota 5899  df-ov 5947  df-oprab 5948  df-mpo 5949  df-pnf 8109  df-mnf 8110  df-ltxr 8112  df-inn 9037  df-2 9095  df-3 9096  df-4 9097  df-5 9098  df-6 9099  df-7 9100  df-8 9101  df-ndx 12835  df-slot 12836  df-base 12838  df-sets 12839  df-iress 12840  df-plusg 12922  df-mulr 12923  df-sca 12925  df-vsca 12926  df-ip 12927  df-0g 13090  df-mgm 13188  df-sgrp 13234  df-mnd 13249  df-grp 13335  df-subg 13506  df-mgp 13683  df-ur 13722  df-ring 13760  df-subrg 13981  df-lmod 14051  df-sra 14197
This theorem is referenced by:  rlmlmod  14226
  Copyright terms: Public domain W3C validator