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

Theorem sralmod 14897
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 2238 . . . 4 (Base‘𝑊) = (Base‘𝑊)
43subrgss 14640 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ⊆ (Base‘𝑊))
5 subrgrcl 14644 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑊 ∈ Ring)
62, 4, 5srabaseg 14886 . 2 (𝑆 ∈ (SubRing‘𝑊) → (Base‘𝑊) = (Base‘𝐴))
72, 4, 5sraaddgg 14887 . 2 (𝑆 ∈ (SubRing‘𝑊) → (+g‘𝑊) = (+g‘𝐴))
82, 4, 5srascag 14889 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑊 ↾s 𝑆) = (Scalar‘𝐴))
92, 4, 5sravscag 14890 . 2 (𝑆 ∈ (SubRing‘𝑊) → (.r‘𝑊) = ( ·𝑠 ‘𝐴))
10 eqidd 2239 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (𝑊 ↾s 𝑆) = (𝑊 ↾s 𝑆))
11 eqidd 2239 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (Base‘𝑊) = (Base‘𝑊))
12 id 19 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑆 ∈ (SubRing‘𝑊))
1310, 11, 5, 12ressbasd 13481 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑆 ∩ (Base‘𝑊)) = (Base‘(𝑊 ↾s 𝑆)))
14 eqidd 2239 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (+g‘𝑊) = (+g‘𝑊))
1510, 14, 12, 5ressplusgd 13543 . 2 (𝑆 ∈ (SubRing‘𝑊) → (+g‘𝑊) = (+g‘(𝑊 ↾s 𝑆)))
16 eqid 2238 . . . 4 (𝑊 ↾s 𝑆) = (𝑊 ↾s 𝑆)
17 eqid 2238 . . . 4 (.r‘𝑊) = (.r‘𝑊)
1816, 17ressmulrg 13559 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑊 ∈ Ring) → (.r‘𝑊) = (.r‘(𝑊 ↾s 𝑆)))
195, 18mpdan 425 . 2 (𝑆 ∈ (SubRing‘𝑊) → (.r‘𝑊) = (.r‘(𝑊 ↾s 𝑆)))
20 eqid 2238 . . 3 (1r‘𝑊) = (1r‘𝑊)
2116, 20subrg1 14649 . 2 (𝑆 ∈ (SubRing‘𝑊) → (1r‘𝑊) = (1r‘(𝑊 ↾s 𝑆)))
2216subrgring 14642 . 2 (𝑆 ∈ (SubRing‘𝑊) → (𝑊 ↾s 𝑆) ∈ Ring)
235ringgrpd 14417 . . 3 (𝑆 ∈ (SubRing‘𝑊) → 𝑊 ∈ Grp)
247oveqdr 6116 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊))) → (𝑥(+g‘𝑊)𝑦) = (𝑥(+g‘𝐴)𝑦))
2511, 6, 24grppropd 13882 . . 3 (𝑆 ∈ (SubRing‘𝑊) → (𝑊 ∈ Grp ↔ 𝐴 ∈ Grp))
2623, 25mpbid 147 . 2 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ Grp)
2753ad2ant1 1049 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑊 ∈ Ring)
28 elinel2 3416 . . . 4 (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) → 𝑥 ∈ (Base‘𝑊))
29283ad2ant2 1050 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑥 ∈ (Base‘𝑊))
30 simp3 1030 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → 𝑦 ∈ (Base‘𝑊))
313, 17ringcl 14425 . . 3 ((𝑊 ∈ Ring ∧ 𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊)) → (𝑥(.r‘𝑊)𝑦) ∈ (Base‘𝑊))
3227, 29, 30, 31syl3anc 1278 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊)) → (𝑥(.r‘𝑊)𝑦) ∈ (Base‘𝑊))
335adantr 276 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑊 ∈ Ring)
34 simpr1 1034 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)))
3534elin2d 3419 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (Base‘𝑊))
36 simpr2 1035 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (Base‘𝑊))
37 simpr3 1036 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑧 ∈ (Base‘𝑊))
38 eqid 2238 . . . 4 (+g‘𝑊) = (+g‘𝑊)
393, 38, 17ringdi 14431 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → (𝑥(.r‘𝑊)(𝑦(+g‘𝑊)𝑧)) = ((𝑥(.r‘𝑊)𝑦)(+g‘𝑊)(𝑥(.r‘𝑊)𝑧)))
4033, 35, 36, 37, 39syl13anc 1280 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → (𝑥(.r‘𝑊)(𝑦(+g‘𝑊)𝑧)) = ((𝑥(.r‘𝑊)𝑦)(+g‘𝑊)(𝑥(.r‘𝑊)𝑧)))
415adantr 276 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑊 ∈ Ring)
42 simpr1 1034 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (𝑆 ∩ (Base‘𝑊)))
4342elin2d 3419 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑥 ∈ (Base‘𝑊))
44 simpr2 1035 . . . 4 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)))
4544elin2d 3419 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑦 ∈ (Base‘𝑊))
46 simpr3 1036 . . 3 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → 𝑧 ∈ (Base‘𝑊))
473, 38, 17ringdir 14432 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(+g‘𝑊)𝑦)(.r‘𝑊)𝑧) = ((𝑥(.r‘𝑊)𝑧)(+g‘𝑊)(𝑦(.r‘𝑊)𝑧)))
4841, 43, 45, 46, 47syl13anc 1280 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(+g‘𝑊)𝑦)(.r‘𝑊)𝑧) = ((𝑥(.r‘𝑊)𝑧)(+g‘𝑊)(𝑦(.r‘𝑊)𝑧)))
493, 17ringass 14428 . . 3 ((𝑊 ∈ Ring ∧ (𝑥 ∈ (Base‘𝑊) ∧ 𝑦 ∈ (Base‘𝑊) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(.r‘𝑊)𝑦)(.r‘𝑊)𝑧) = (𝑥(.r‘𝑊)(𝑦(.r‘𝑊)𝑧)))
5041, 43, 45, 46, 49syl13anc 1280 . 2 ((𝑆 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑦 ∈ (𝑆 ∩ (Base‘𝑊)) ∧ 𝑧 ∈ (Base‘𝑊))) → ((𝑥(.r‘𝑊)𝑦)(.r‘𝑊)𝑧) = (𝑥(.r‘𝑊)(𝑦(.r‘𝑊)𝑧)))
513, 17, 20ringlidm 14436 . . 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 14739 1 (𝑆 ∈ (SubRing‘𝑊) → 𝐴 ∈ LMod)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209   ∩ cin 3219  ‘cfv 5380  (class class class)co 6088  Basecbs 13411   ↾s cress 13412  +gcplusg 13491  .rcmulr 13492  Grpcgrp 13865  1rcur 14370  Ringcrg 14408  SubRingcsubrg 14635  LModclmod 14733  subringAlg csra 14880
This proof depends on 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 4248  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-addass 8288  ax-i2m1 8291  ax-0lt1 8292  ax-0id 8294  ax-rnegex 8295  ax-pre-ltirr 8298  ax-pre-lttrn 8300  ax-pre-ltadd 8302
This proof depends on definitions:  df-bi 117  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-rmo 2536  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 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8369  df-mnf 8370  df-ltxr 8372  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-5 9376  df-6 9377  df-7 9378  df-8 9379  df-ndx 13414  df-slot 13415  df-base 13417  df-sets 13418  df-iress 13419  df-plusg 13504  df-mulr 13505  df-sca 13507  df-vsca 13508  df-ip 13509  df-0g 13672  df-mgm 13736  df-sgrp 13777  df-mnd 13790  df-grp 13868  df-subg 14033  df-mgp 14326  df-ur 14371  df-ring 14410  df-subrg 14637  df-lmod 14735  df-sra 14882
This theorem is used by:  rlmlmod  14911
  Copyright terms: Public domain W3C validator