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

Theorem aspval2 21837
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 3914 . . . . . . . . 9 (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ↔ (𝑥 ∈ (SubRing‘𝑊) ∧ 𝑥 ∈ (LSubSp‘𝑊)))
21anbi1i 624 . . . . . . . 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 2733 . . . . . . . . . . 11 (LSubSp‘𝑊) = (LSubSp‘𝑊)
75, 6issubassa2 21831 . . . . . . . . . 10 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → (𝑥 ∈ (LSubSp‘𝑊) ↔ ran 𝐶𝑥))
87anbi1d 631 . . . . . . . . 9 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → ((𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥) ↔ (ran 𝐶𝑥𝑆𝑥)))
9 unss 4139 . . . . . . . . 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 2799 . . . . 5 (𝑊 ∈ AssAlg → {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)})
1413adantr 480 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)})
15 df-rab 3397 . . . 4 {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)}
16 df-rab 3397 . . . 4 {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)}
1714, 15, 163eqtr4g 2793 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
1817inteqd 4902 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
19 aspval2.a . . 3 𝐴 = (AlgSpan‘𝑊)
20 aspval2.v . . 3 𝑉 = (Base‘𝑊)
2119, 20, 6aspval 21812 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥})
22 assaring 21800 . . . 4 (𝑊 ∈ AssAlg → 𝑊 ∈ Ring)
2320subrgmre 20514 . . . 4 (𝑊 ∈ Ring → (SubRing‘𝑊) ∈ (Moore‘𝑉))
2422, 23syl 17 . . 3 (𝑊 ∈ AssAlg → (SubRing‘𝑊) ∈ (Moore‘𝑉))
25 eqid 2733 . . . . . . 7 (Scalar‘𝑊) = (Scalar‘𝑊)
26 assalmod 21799 . . . . . . 7 (𝑊 ∈ AssAlg → 𝑊 ∈ LMod)
27 eqid 2733 . . . . . . 7 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
285, 25, 22, 26, 27, 20asclf 21821 . . . . . 6 (𝑊 ∈ AssAlg → 𝐶:(Base‘(Scalar‘𝑊))⟶𝑉)
2928frnd 6664 . . . . 5 (𝑊 ∈ AssAlg → ran 𝐶𝑉)
3029adantr 480 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → ran 𝐶𝑉)
31 simpr 484 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → 𝑆𝑉)
3230, 31unssd 4141 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (ran 𝐶𝑆) ⊆ 𝑉)
33 aspval2.r . . . 4 𝑅 = (mrCls‘(SubRing‘𝑊))
3433mrcval 17518 . . 3 (((SubRing‘𝑊) ∈ (Moore‘𝑉) ∧ (ran 𝐶𝑆) ⊆ 𝑉) → (𝑅‘(ran 𝐶𝑆)) = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
3524, 32, 34syl2an2r 685 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝑅‘(ran 𝐶𝑆)) = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
3618, 21, 353eqtr4d 2778 1 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = (𝑅‘(ran 𝐶𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  {cab 2711  {crab 3396  cun 3896  cin 3897  wss 3898   cint 4897  ran crn 5620  cfv 6486  Basecbs 17122  Scalarcsca 17166  Moorecmre 17486  mrClscmrc 17487  Ringcrg 20153  SubRingcsubrg 20486  LSubSpclss 20866  AssAlgcasa 21789  AlgSpancasp 21790  algSccascl 21791
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5219  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-cnex 11069  ax-resscn 11070  ax-1cn 11071  ax-icn 11072  ax-addcl 11073  ax-addrcl 11074  ax-mulcl 11075  ax-mulrcl 11076  ax-mulcom 11077  ax-addass 11078  ax-mulass 11079  ax-distr 11080  ax-i2m1 11081  ax-1ne0 11082  ax-1rid 11083  ax-rnegex 11084  ax-rrecex 11085  ax-cnre 11086  ax-pre-lttri 11087  ax-pre-lttrn 11088  ax-pre-ltadd 11089  ax-pre-mulgt0 11090
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-riota 7309  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-er 8628  df-en 8876  df-dom 8877  df-sdom 8878  df-pnf 11155  df-mnf 11156  df-xr 11157  df-ltxr 11158  df-le 11159  df-sub 11353  df-neg 11354  df-nn 12133  df-2 12195  df-3 12196  df-sets 17077  df-slot 17095  df-ndx 17107  df-base 17123  df-ress 17144  df-plusg 17176  df-mulr 17177  df-0g 17347  df-mre 17490  df-mrc 17491  df-mgm 18550  df-sgrp 18629  df-mnd 18645  df-grp 18851  df-minusg 18852  df-sbg 18853  df-subg 19038  df-cmn 19696  df-abl 19697  df-mgp 20061  df-rng 20073  df-ur 20102  df-ring 20155  df-subrng 20463  df-subrg 20487  df-lmod 20797  df-lss 20867  df-lsp 20907  df-assa 21792  df-asp 21793  df-ascl 21794
This theorem is referenced by:  evlseu  22019
  Copyright terms: Public domain W3C validator