MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  aspval2 Structured version   Visualization version   GIF version

Theorem aspval2 21858
Description: The algebraic closure is the ring closure when the generating set is expanded to include all scalars. EDITORIAL : In light of this, is AlgSpan independently needed? (Contributed by Stefan O'Rear, 9-Mar-2015.)
Hypotheses
Ref Expression
aspval2.a 𝐴 = (AlgSpan‘𝑊)
aspval2.c 𝐶 = (algSc‘𝑊)
aspval2.r 𝑅 = (mrCls‘(SubRing‘𝑊))
aspval2.v 𝑉 = (Base‘𝑊)
Assertion
Ref Expression
aspval2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = (𝑅‘(ran 𝐶𝑆)))

Proof of Theorem aspval2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elin 3918 . . . . . . . . 9 (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ↔ (𝑥 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (LSubSp‘𝑊)))
21anbi1i 625 . . . . . . . 8 ((𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥) ↔ ((𝑥 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (LSubSp‘𝑊)) ∧ 𝑆𝑥))
3 anass 468 . . . . . . . 8 (((𝑥 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (LSubSp‘𝑊)) ∧ 𝑆𝑥) ↔ (𝑥 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥)))
42, 3bitri 275 . . . . . . 7 ((𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥) ↔ (𝑥 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥)))
5 aspval2.c . . . . . . . . . . 11 𝐶 = (algSc‘𝑊)
6 eqid 2737 . . . . . . . . . . 11 (LSubSp‘𝑊) = (LSubSp‘𝑊)
75, 6issubassa2 21852 . . . . . . . . . 10 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → (𝑥 ∈ (LSubSp‘𝑊) ↔ ran 𝐶𝑥))
87anbi1d 632 . . . . . . . . 9 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → ((𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥) ↔ (ran 𝐶𝑥𝑆𝑥)))
9 unss 4143 . . . . . . . . 9 ((ran 𝐶𝑥𝑆𝑥) ↔ (ran 𝐶𝑆) ⊆ 𝑥)
108, 9bitrdi 287 . . . . . . . 8 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → ((𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥) ↔ (ran 𝐶𝑆) ⊆ 𝑥))
1110pm5.32da 579 . . . . . . 7 (𝑊 ∈ AssAlg → ((𝑥 ∈ (SubRing‘𝑊) ∧ (𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥)) ↔ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)))
124, 11bitrid 283 . . . . . 6 (𝑊 ∈ AssAlg → ((𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥) ↔ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)))
1312abbidv 2803 . . . . 5 (𝑊 ∈ AssAlg → {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)})
1413adantr 480 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)})
15 df-rab 3401 . . . 4 {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)}
16 df-rab 3401 . . . 4 {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)}
1714, 15, 163eqtr4g 2797 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
1817inteqd 4908 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
19 aspval2.a . . 3 𝐴 = (AlgSpan‘𝑊)
20 aspval2.v . . 3 𝑉 = (Base‘𝑊)
2119, 20, 6aspval 21832 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥})
22 assaring 21820 . . . 4 (𝑊 ∈ AssAlg → 𝑊 ∈ Ring)
2320subrgmre 20534 . . . 4 (𝑊 ∈ Ring → (SubRing‘𝑊) ∈ (Moore‘𝑉))
2422, 23syl 17 . . 3 (𝑊 ∈ AssAlg → (SubRing‘𝑊) ∈ (Moore‘𝑉))
25 eqid 2737 . . . . . . 7 (Scalar‘𝑊) = (Scalar‘𝑊)
26 assalmod 21819 . . . . . . 7 (𝑊 ∈ AssAlg → 𝑊 ∈ LMod)
27 eqid 2737 . . . . . . 7 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
285, 25, 22, 26, 27, 20asclf 21841 . . . . . 6 (𝑊 ∈ AssAlg → 𝐶:(Base‘(Scalar‘𝑊))⟶𝑉)
2928frnd 6671 . . . . 5 (𝑊 ∈ AssAlg → ran 𝐶𝑉)
3029adantr 480 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → ran 𝐶𝑉)
31 simpr 484 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → 𝑆𝑉)
3230, 31unssd 4145 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (ran 𝐶𝑆) ⊆ 𝑉)
33 aspval2.r . . . 4 𝑅 = (mrCls‘(SubRing‘𝑊))
3433mrcval 17537 . . 3 (((SubRing‘𝑊) ∈ (Moore‘𝑉) ∧ (ran 𝐶𝑆) ⊆ 𝑉) → (𝑅‘(ran 𝐶𝑆)) = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
3524, 32, 34syl2an2r 686 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝑅‘(ran 𝐶𝑆)) = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
3618, 21, 353eqtr4d 2782 1 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = (𝑅‘(ran 𝐶𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  {cab 2715  {crab 3400  cun 3900  cin 3901  wss 3902   cint 4903  ran crn 5626  cfv 6493  Basecbs 17140  Scalarcsca 17184  Moorecmre 17505  mrClscmrc 17506  Ringcrg 20172  SubRingcsubrg 20506  LSubSpclss 20886  AssAlgcasa 21809  AlgSpancasp 21810  algSccascl 21811
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5225  ax-sep 5242  ax-nul 5252  ax-pow 5311  ax-pr 5378  ax-un 7682  ax-cnex 11086  ax-resscn 11087  ax-1cn 11088  ax-icn 11089  ax-addcl 11090  ax-addrcl 11091  ax-mulcl 11092  ax-mulrcl 11093  ax-mulcom 11094  ax-addass 11095  ax-mulass 11096  ax-distr 11097  ax-i2m1 11098  ax-1ne0 11099  ax-1rid 11100  ax-rnegex 11101  ax-rrecex 11102  ax-cnre 11103  ax-pre-lttri 11104  ax-pre-lttrn 11105  ax-pre-ltadd 11106  ax-pre-mulgt0 11107
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3062  df-rmo 3351  df-reu 3352  df-rab 3401  df-v 3443  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4287  df-if 4481  df-pw 4557  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-int 4904  df-iun 4949  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-er 8637  df-en 8888  df-dom 8889  df-sdom 8890  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-nn 12150  df-2 12212  df-3 12213  df-sets 17095  df-slot 17113  df-ndx 17125  df-base 17141  df-ress 17162  df-plusg 17194  df-mulr 17195  df-0g 17365  df-mre 17509  df-mrc 17510  df-mgm 18569  df-sgrp 18648  df-mnd 18664  df-grp 18870  df-minusg 18871  df-sbg 18872  df-subg 19057  df-cmn 19715  df-abl 19716  df-mgp 20080  df-rng 20092  df-ur 20121  df-ring 20174  df-subrng 20483  df-subrg 20507  df-lmod 20817  df-lss 20887  df-lsp 20927  df-assa 21812  df-asp 21813  df-ascl 21814
This theorem is referenced by:  evlseu  22042
  Copyright terms: Public domain W3C validator