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

Theorem aspval 15124
Description: Value of the algebraic closure operation inside an associative algebra. (Contributed by Mario Carneiro, 7-Jan-2015.)
Hypotheses
Ref Expression
aspval.a 𝐴 = (AlgSpan‘𝑊)
aspval.v 𝑉 = (Base‘𝑊)
aspval.l 𝐿 = (LSubSp‘𝑊)
Assertion
Ref Expression
aspval ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → (𝐴‘𝑆) = ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡})
Distinct variable groups:   𝑡,𝐿   𝑡,𝑆   𝑡,𝑉   𝑡,𝑊
Allowed substitution hint:   𝐴(𝑡)

Proof of Theorem aspval
Dummy variables 𝑠 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 aspval.a . . . . 5 𝐴 = (AlgSpan‘𝑊)
2 df-asp 15109 . . . . . 6 AlgSpan = (𝑤 ∈ AssAlg ↦ (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ ((SubRing‘𝑤) ∩ (LSubSp‘𝑤)) ∣ 𝑠 ⊆ 𝑡}))
3 fveq2 5698 . . . . . . . . 9 (𝑤 = 𝑊 → (Base‘𝑤) = (Base‘𝑊))
4 aspval.v . . . . . . . . 9 𝑉 = (Base‘𝑊)
53, 4eqtr4di 2289 . . . . . . . 8 (𝑤 = 𝑊 → (Base‘𝑤) = 𝑉)
65pweqd 3693 . . . . . . 7 (𝑤 = 𝑊 → 𝒫 (Base‘𝑤) = 𝒫 𝑉)
7 fveq2 5698 . . . . . . . . . 10 (𝑤 = 𝑊 → (SubRing‘𝑤) = (SubRing‘𝑊))
8 fveq2 5698 . . . . . . . . . . 11 (𝑤 = 𝑊 → (LSubSp‘𝑤) = (LSubSp‘𝑊))
9 aspval.l . . . . . . . . . . 11 𝐿 = (LSubSp‘𝑊)
108, 9eqtr4di 2289 . . . . . . . . . 10 (𝑤 = 𝑊 → (LSubSp‘𝑤) = 𝐿)
117, 10ineq12d 3433 . . . . . . . . 9 (𝑤 = 𝑊 → ((SubRing‘𝑤) ∩ (LSubSp‘𝑤)) = ((SubRing‘𝑊) ∩ 𝐿))
1211rabeqdv 2815 . . . . . . . 8 (𝑤 = 𝑊 → {𝑡 ∈ ((SubRing‘𝑤) ∩ (LSubSp‘𝑤)) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡})
1312inteqd 3975 . . . . . . 7 (𝑤 = 𝑊 → ∩ {𝑡 ∈ ((SubRing‘𝑤) ∩ (LSubSp‘𝑤)) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡})
146, 13mpteq12dv 4214 . . . . . 6 (𝑤 = 𝑊 → (𝑠 ∈ 𝒫 (Base‘𝑤) ↦ ∩ {𝑡 ∈ ((SubRing‘𝑤) ∩ (LSubSp‘𝑤)) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡}))
15 id 19 . . . . . 6 (𝑊 ∈ AssAlg → 𝑊 ∈ AssAlg)
16 basfn 13469 . . . . . . . . . 10 Base Fn V
17 elex 2833 . . . . . . . . . 10 (𝑊 ∈ AssAlg → 𝑊 ∈ V)
18 funfvex 5715 . . . . . . . . . . 11 ((Fun Base ∧ 𝑊 ∈ dom Base) → (Base‘𝑊) ∈ V)
1918funfni 5486 . . . . . . . . . 10 ((Base Fn V ∧ 𝑊 ∈ V) → (Base‘𝑊) ∈ V)
2016, 17, 19sylancr 418 . . . . . . . . 9 (𝑊 ∈ AssAlg → (Base‘𝑊) ∈ V)
214, 20eqeltrid 2325 . . . . . . . 8 (𝑊 ∈ AssAlg → 𝑉 ∈ V)
2221pwexd 4320 . . . . . . 7 (𝑊 ∈ AssAlg → 𝒫 𝑉 ∈ V)
2322mptexd 5947 . . . . . 6 (𝑊 ∈ AssAlg → (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡}) ∈ V)
242, 14, 15, 23fvmptd3 5802 . . . . 5 (𝑊 ∈ AssAlg → (AlgSpan‘𝑊) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡}))
251, 24eqtrid 2283 . . . 4 (𝑊 ∈ AssAlg → 𝐴 = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡}))
2625fveq1d 5700 . . 3 (𝑊 ∈ AssAlg → (𝐴‘𝑆) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡})‘𝑆))
2726adantr 276 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → (𝐴‘𝑆) = ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡})‘𝑆))
28 eqid 2238 . . 3 (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡}) = (𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡})
29 sseq1 3271 . . . . 5 (𝑠 = 𝑆 → (𝑠 ⊆ 𝑡 ↔ 𝑆 ⊆ 𝑡))
3029rabbidv 2810 . . . 4 (𝑠 = 𝑆 → {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡} = {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡})
3130inteqd 3975 . . 3 (𝑠 = 𝑆 → ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡} = ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡})
32 elpw2g 4294 . . . . 5 (𝑉 ∈ V → (𝑆 ∈ 𝒫 𝑉 ↔ 𝑆 ⊆ 𝑉))
3321, 32syl 14 . . . 4 (𝑊 ∈ AssAlg → (𝑆 ∈ 𝒫 𝑉 ↔ 𝑆 ⊆ 𝑉))
3433biimpar 297 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → 𝑆 ∈ 𝒫 𝑉)
35 assaring 15116 . . . . . . 7 (𝑊 ∈ AssAlg → 𝑊 ∈ Ring)
364subrgid 14640 . . . . . . 7 (𝑊 ∈ Ring → 𝑉 ∈ (SubRing‘𝑊))
3735, 36syl 14 . . . . . 6 (𝑊 ∈ AssAlg → 𝑉 ∈ (SubRing‘𝑊))
38 assalmod 15115 . . . . . . 7 (𝑊 ∈ AssAlg → 𝑊 ∈ LMod)
394, 9lss1 14808 . . . . . . 7 (𝑊 ∈ LMod → 𝑉 ∈ 𝐿)
4038, 39syl 14 . . . . . 6 (𝑊 ∈ AssAlg → 𝑉 ∈ 𝐿)
4137, 40elind 3414 . . . . 5 (𝑊 ∈ AssAlg → 𝑉 ∈ ((SubRing‘𝑊) ∩ 𝐿))
42 sseq2 3272 . . . . . 6 (𝑡 = 𝑉 → (𝑆 ⊆ 𝑡 ↔ 𝑆 ⊆ 𝑉))
4342rspcev 2929 . . . . 5 ((𝑉 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∧ 𝑆 ⊆ 𝑉) → ∃𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿)𝑆 ⊆ 𝑡)
4441, 43sylan 283 . . . 4 ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → ∃𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿)𝑆 ⊆ 𝑡)
45 intexrabim 4291 . . . 4 (∃𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿)𝑆 ⊆ 𝑡 → ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡} ∈ V)
4644, 45syl 14 . . 3 ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡} ∈ V)
4728, 31, 34, 46fvmptd3 5802 . 2 ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → ((𝑠 ∈ 𝒫 𝑉 ↦ ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑠 ⊆ 𝑡})‘𝑆) = ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡})
4827, 47eqtrd 2271 1 ((𝑊 ∈ AssAlg ∧ 𝑆 ⊆ 𝑉) → (𝐴‘𝑆) = ∩ {𝑡 ∈ ((SubRing‘𝑊) ∩ 𝐿) ∣ 𝑆 ⊆ 𝑡})
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  {crab 2532  Vcvv 2821   ∩ cin 3219   ⊆ wss 3220  𝒫 cpw 3688  ∩ cint 3970   ↦ cmpt 4193   Fn wfn 5375  ‘cfv 5380  Basecbs 13410  Ringcrg 14407  SubRingcsubrg 14634  LModclmod 14732  LSubSpclss 14798  AssAlgcasa 15105  AlgSpancasp 15106
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 8276  ax-resscn 8277  ax-1cn 8278  ax-1re 8279  ax-icn 8280  ax-addcl 8281  ax-addrcl 8282  ax-mulcl 8283  ax-addcom 8285  ax-addass 8287  ax-i2m1 8290  ax-0lt1 8291  ax-0id 8293  ax-rnegex 8294  ax-pre-ltirr 8297  ax-pre-lttrn 8299  ax-pre-ltadd 8301
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 8368  df-mnf 8369  df-ltxr 8371  df-inn 9314  df-2 9372  df-3 9373  df-4 9374  df-5 9375  df-6 9376  df-ndx 13413  df-slot 13414  df-base 13416  df-sets 13417  df-iress 13418  df-plusg 13503  df-mulr 13504  df-sca 13506  df-vsca 13507  df-0g 13671  df-mgm 13735  df-sgrp 13776  df-mnd 13789  df-grp 13867  df-minusg 13868  df-mgp 14325  df-ur 14370  df-ring 14409  df-subrg 14636  df-lmod 14734  df-lssm 14799  df-assa 15108  df-asp 15109
This theorem is used by:  asplss  15125  aspid  15126  aspsubrg  15127  aspss  15128  aspssid  15129
  Copyright terms: Public domain W3C validator