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

Theorem aspval2 21807
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 3930 . . . . . . . . 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 2729 . . . . . . . . . . 11 (LSubSp‘𝑊) = (LSubSp‘𝑊)
75, 6issubassa2 21801 . . . . . . . . . 10 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → (𝑥 ∈ (LSubSp‘𝑊) ↔ ran 𝐶𝑥))
87anbi1d 631 . . . . . . . . 9 ((𝑊 ∈ AssAlg ∧ 𝑥 ∈ (SubRing‘𝑊)) → ((𝑥 ∈ (LSubSp‘𝑊) ∧ 𝑆𝑥) ↔ (ran 𝐶𝑥𝑆𝑥)))
9 unss 4153 . . . . . . . . 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 2795 . . . . 5 (𝑊 ∈ AssAlg → {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)})
1413adantr 480 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)})
15 df-rab 3406 . . . 4 {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∣ (𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∧ 𝑆𝑥)}
16 df-rab 3406 . . . 4 {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥} = {𝑥 ∣ (𝑥 ∈ (SubRing‘𝑊) ∧ (ran 𝐶𝑆) ⊆ 𝑥)}
1714, 15, 163eqtr4g 2789 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
1817inteqd 4915 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥} = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
19 aspval2.a . . 3 𝐴 = (AlgSpan‘𝑊)
20 aspval2.v . . 3 𝑉 = (Base‘𝑊)
2119, 20, 6aspval 21782 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = {𝑥 ∈ ((SubRing‘𝑊) ∩ (LSubSp‘𝑊)) ∣ 𝑆𝑥})
22 assaring 21770 . . . 4 (𝑊 ∈ AssAlg → 𝑊 ∈ Ring)
2320subrgmre 20506 . . . 4 (𝑊 ∈ Ring → (SubRing‘𝑊) ∈ (Moore‘𝑉))
2422, 23syl 17 . . 3 (𝑊 ∈ AssAlg → (SubRing‘𝑊) ∈ (Moore‘𝑉))
25 eqid 2729 . . . . . . 7 (Scalar‘𝑊) = (Scalar‘𝑊)
26 assalmod 21769 . . . . . . 7 (𝑊 ∈ AssAlg → 𝑊 ∈ LMod)
27 eqid 2729 . . . . . . 7 (Base‘(Scalar‘𝑊)) = (Base‘(Scalar‘𝑊))
285, 25, 22, 26, 27, 20asclf 21791 . . . . . 6 (𝑊 ∈ AssAlg → 𝐶:(Base‘(Scalar‘𝑊))⟶𝑉)
2928frnd 6696 . . . . 5 (𝑊 ∈ AssAlg → ran 𝐶𝑉)
3029adantr 480 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → ran 𝐶𝑉)
31 simpr 484 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → 𝑆𝑉)
3230, 31unssd 4155 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (ran 𝐶𝑆) ⊆ 𝑉)
33 aspval2.r . . . 4 𝑅 = (mrCls‘(SubRing‘𝑊))
3433mrcval 17571 . . 3 (((SubRing‘𝑊) ∈ (Moore‘𝑉) ∧ (ran 𝐶𝑆) ⊆ 𝑉) → (𝑅‘(ran 𝐶𝑆)) = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
3524, 32, 34syl2an2r 685 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝑅‘(ran 𝐶𝑆)) = {𝑥 ∈ (SubRing‘𝑊) ∣ (ran 𝐶𝑆) ⊆ 𝑥})
3618, 21, 353eqtr4d 2774 1 ((𝑊 ∈ AssAlg ∧ 𝑆𝑉) → (𝐴𝑆) = (𝑅‘(ran 𝐶𝑆)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2109  {cab 2707  {crab 3405  cun 3912  cin 3913  wss 3914   cint 4910  ran crn 5639  cfv 6511  Basecbs 17179  Scalarcsca 17223  Moorecmre 17543  mrClscmrc 17544  Ringcrg 20142  SubRingcsubrg 20478  LSubSpclss 20837  AssAlgcasa 21759  AlgSpancasp 21760  algSccascl 21761
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711  ax-cnex 11124  ax-resscn 11125  ax-1cn 11126  ax-icn 11127  ax-addcl 11128  ax-addrcl 11129  ax-mulcl 11130  ax-mulrcl 11131  ax-mulcom 11132  ax-addass 11133  ax-mulass 11134  ax-distr 11135  ax-i2m1 11136  ax-1ne0 11137  ax-1rid 11138  ax-rnegex 11139  ax-rrecex 11140  ax-cnre 11141  ax-pre-lttri 11142  ax-pre-lttrn 11143  ax-pre-ltadd 11144  ax-pre-mulgt0 11145
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-er 8671  df-en 8919  df-dom 8920  df-sdom 8921  df-pnf 11210  df-mnf 11211  df-xr 11212  df-ltxr 11213  df-le 11214  df-sub 11407  df-neg 11408  df-nn 12187  df-2 12249  df-3 12250  df-sets 17134  df-slot 17152  df-ndx 17164  df-base 17180  df-ress 17201  df-plusg 17233  df-mulr 17234  df-0g 17404  df-mre 17547  df-mrc 17548  df-mgm 18567  df-sgrp 18646  df-mnd 18662  df-grp 18868  df-minusg 18869  df-sbg 18870  df-subg 19055  df-cmn 19712  df-abl 19713  df-mgp 20050  df-rng 20062  df-ur 20091  df-ring 20144  df-subrng 20455  df-subrg 20479  df-lmod 20768  df-lss 20838  df-lsp 20878  df-assa 21762  df-asp 21763  df-ascl 21764
This theorem is referenced by:  evlseu  21990
  Copyright terms: Public domain W3C validator