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

Theorem sralmod 13982
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 2196 . . . 4 (Base‘𝑊) = (Base‘𝑊)
43subrgss 13754 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ⊆ (Base‘𝑊))
5 subrgrcl 13758 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑊 ∈ Ring)
62, 4, 5srabaseg 13971 . 2 (𝑆 ∈ (SubRing‘𝑊) → (Base‘𝑊) = (Base‘𝐴))
72, 4, 5sraaddgg 13972 . 2 (𝑆 ∈ (SubRing‘𝑊) → (+g𝑊) = (+g𝐴))
82, 4, 5srascag 13974 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑊s 𝑆) = (Scalar‘𝐴))
92, 4, 5sravscag 13975 . 2 (𝑆 ∈ (SubRing‘𝑊) → (.r𝑊) = ( ·𝑠𝐴))
10 eqidd 2197 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (𝑊s 𝑆) = (𝑊s 𝑆))
11 eqidd 2197 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (Base‘𝑊) = (Base‘𝑊))
12 id 19 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ∈ (SubRing‘𝑊))
1310, 11, 5, 12ressbasd 12721 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑆 ∩ (Base‘𝑊)) = (Base‘(𝑊s 𝑆)))
14 eqidd 2197 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (+g𝑊) = (+g𝑊))
1510, 14, 12, 5ressplusgd 12782 . 2 (𝑆 ∈ (SubRing‘𝑊) → (+g𝑊) = (+g‘(𝑊s 𝑆)))
16 eqid 2196 . . . 4 (𝑊s 𝑆) = (𝑊s 𝑆)
17 eqid 2196 . . . 4 (.r𝑊) = (.r𝑊)
1816, 17ressmulrg 12798 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑊 ∈ Ring) → (.r𝑊) = (.r‘(𝑊s 𝑆)))
195, 18mpdan 421 . 2 (𝑆 ∈ (SubRing‘𝑊) → (.r𝑊) = (.r‘(𝑊s 𝑆)))
20 eqid 2196 . . 3 (1r𝑊) = (1r𝑊)
2116, 20subrg1 13763 . 2 (𝑆 ∈ (SubRing‘𝑊) → (1r𝑊) = (1r‘(𝑊s 𝑆)))
2216subrgring 13756 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑊s 𝑆) ∈ Ring)
235ringgrpd 13537 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑊 ∈ Grp)
247oveqdr 5950 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊))) → (𝑥(+g𝑊)𝑦) = (𝑥(+g𝐴)𝑦))
2511, 6, 24grppropd 13125 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (𝑊 ∈ Grp ↔ 𝐴 ∈ Grp))
2623, 25mpbid 147 . 2 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ Grp)
2753ad2ant1 1020 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑊 ∈ Ring)
28 elinel2 3350 . . . 4 (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) → 𝑥 ∈ (Base‘𝑊))
29283ad2ant2 1021 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑥 ∈ (Base‘𝑊))
30 simp3 1001 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑦 ∈ (Base‘𝑊))
313, 17ringcl 13545 . . 3 ((𝑊 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊)) → (𝑥(.r𝑊)𝑦) ∈ (Base‘𝑊))
3227, 29, 30, 31syl3anc 1249 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → (𝑥(.r𝑊)𝑦) ∈ (Base‘𝑊))
335adantr 276 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑊 ∈ Ring)
34 simpr1 1005 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)))
3534elin2d 3353 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (Base‘𝑊))
36 simpr2 1006 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (Base‘𝑊))
37 simpr3 1007 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑧 ∈ (Base‘𝑊))
38 eqid 2196 . . . 4 (+g𝑊) = (+g𝑊)
393, 38, 17ringdi 13550 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → (𝑥(.r𝑊)(𝑦(+g𝑊)𝑧)) = ((𝑥(.r𝑊)𝑦)(+g𝑊)(𝑥(.r𝑊)𝑧)))
4033, 35, 36, 37, 39syl13anc 1251 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → (𝑥(.r𝑊)(𝑦(+g𝑊)𝑧)) = ((𝑥(.r𝑊)𝑦)(+g𝑊)(𝑥(.r𝑊)𝑧)))
415adantr 276 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑊 ∈ Ring)
42 simpr1 1005 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)))
4342elin2d 3353 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (Base‘𝑊))
44 simpr2 1006 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)))
4544elin2d 3353 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (Base‘𝑊))
46 simpr3 1007 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑧 ∈ (Base‘𝑊))
473, 38, 17ringdir 13551 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(+g𝑊)𝑦)(.r𝑊)𝑧) = ((𝑥(.r𝑊)𝑧)(+g𝑊)(𝑦(.r𝑊)𝑧)))
4841, 43, 45, 46, 47syl13anc 1251 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(+g𝑊)𝑦)(.r𝑊)𝑧) = ((𝑥(.r𝑊)𝑧)(+g𝑊)(𝑦(.r𝑊)𝑧)))
493, 17ringass 13548 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(.r𝑊)𝑦)(.r𝑊)𝑧) = (𝑥(.r𝑊)(𝑦(.r𝑊)𝑧)))
5041, 43, 45, 46, 49syl13anc 1251 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(.r𝑊)𝑦)(.r𝑊)𝑧) = (𝑥(.r𝑊)(𝑦(.r𝑊)𝑧)))
513, 17, 20ringlidm 13555 . . 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 13825 1 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ LMod)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  w3a 980   = wceq 1364  wcel 2167  cin 3156  cfv 5258  (class class class)co 5922  Basecbs 12654  s cress 12655  +gcplusg 12731  .rcmulr 12732  Grpcgrp 13108  1rcur 13491  Ringcrg 13528  SubRingcsubrg 13749  LModclmod 13819  subringAlg csra 13965
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4148  ax-sep 4151  ax-pow 4207  ax-pr 4242  ax-un 4468  ax-setind 4573  ax-cnex 7968  ax-resscn 7969  ax-1cn 7970  ax-1re 7971  ax-icn 7972  ax-addcl 7973  ax-addrcl 7974  ax-mulcl 7975  ax-addcom 7977  ax-addass 7979  ax-i2m1 7982  ax-0lt1 7983  ax-0id 7985  ax-rnegex 7986  ax-pre-ltirr 7989  ax-pre-lttrn 7991  ax-pre-ltadd 7993
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3451  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-int 3875  df-iun 3918  df-br 4034  df-opab 4095  df-mpt 4096  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-f 5262  df-f1 5263  df-fo 5264  df-f1o 5265  df-fv 5266  df-riota 5877  df-ov 5925  df-oprab 5926  df-mpo 5927  df-pnf 8061  df-mnf 8062  df-ltxr 8064  df-inn 8988  df-2 9046  df-3 9047  df-4 9048  df-5 9049  df-6 9050  df-7 9051  df-8 9052  df-ndx 12657  df-slot 12658  df-base 12660  df-sets 12661  df-iress 12662  df-plusg 12744  df-mulr 12745  df-sca 12747  df-vsca 12748  df-ip 12749  df-0g 12905  df-mgm 12975  df-sgrp 13021  df-mnd 13034  df-grp 13111  df-subg 13276  df-mgp 13453  df-ur 13492  df-ring 13530  df-subrg 13751  df-lmod 13821  df-sra 13967
This theorem is referenced by:  rlmlmod  13996
  Copyright terms: Public domain W3C validator