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	|- A = (AlgSpan ` W )
aspval.v	|- V = ( Base ` W )
aspval.l	|- L = ( LSubSp ` W )

Assertion

Ref	Expression
aspval	|- ( ( W e. AssAlg /\ S C_ V ) -> ( A ` S ) = |^| { t e. ( (SubRing ` W ) i^i L ) | S C_ t } )

Distinct variable groups:   t, L   t, S   t, V   t, W

Allowed substitution hint:   A( t)

Proof of Theorem aspval

Dummy variables s w are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		aspval.a	. . . . 5 |- A = (AlgSpan ` W )
2		df-asp 15109	. . . . . 6 |- AlgSpan = ( w e. AssAlg |-> ( s e. ~P ( Base ` w ) |-> |^| { t e. ( (SubRing ` w ) i^i ( LSubSp ` w ) ) | s C_ t } ) )
3		fveq2 5698	. . . . . . . . 9 |- ( w = W -> ( Base ` w ) = ( Base ` W ) )
4		aspval.v	. . . . . . . . 9 |- V = ( Base ` W )
5	3, 4	eqtr4di 2289	. . . . . . . 8 |- ( w = W -> ( Base ` w ) = V )
6	5	pweqd 3693	. . . . . . 7 |- ( w = W -> ~P ( Base ` w ) = ~P V )
7		fveq2 5698	. . . . . . . . . 10 |- ( w = W -> (SubRing ` w ) = (SubRing ` W ) )
8		fveq2 5698	. . . . . . . . . . 11 |- ( w = W -> ( LSubSp ` w ) = ( LSubSp ` W ) )
9		aspval.l	. . . . . . . . . . 11 |- L = ( LSubSp ` W )
10	8, 9	eqtr4di 2289	. . . . . . . . . 10 |- ( w = W -> ( LSubSp ` w ) = L )
11	7, 10	ineq12d 3433	. . . . . . . . 9 |- ( w = W -> ( (SubRing ` w ) i^i ( LSubSp ` w ) ) = ( (SubRing ` W ) i^i L ) )
12	11	rabeqdv 2815	. . . . . . . 8 |- ( w = W -> { t e. ( (SubRing ` w ) i^i ( LSubSp ` w ) ) | s C_ t } = { t e. ( (SubRing ` W ) i^i L ) | s C_ t } )
13	12	inteqd 3975	. . . . . . 7 |- ( w = W -> |^| { t e. ( (SubRing ` w ) i^i ( LSubSp ` w ) ) | s C_ t } = |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } )
14	6, 13	mpteq12dv 4214	. . . . . 6 |- ( w = W -> ( s e. ~P ( Base ` w ) |-> |^| { t e. ( (SubRing ` w ) i^i ( LSubSp ` w ) ) | s C_ t } ) = ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) )
15		id 19	. . . . . 6 |- ( W e. AssAlg -> W e. AssAlg )
16		basfn 13469	. . . . . . . . . 10 |- Base Fn _V
17		elex 2833	. . . . . . . . . 10 |- ( W e. AssAlg -> W e. _V )
18		funfvex 5715	. . . . . . . . . . 11 |- ( ( Fun Base /\ W e. dom Base ) -> ( Base ` W ) e. _V )
19	18	funfni 5486	. . . . . . . . . 10 |- ( ( Base Fn _V /\ W e. _V ) -> ( Base ` W ) e. _V )
20	16, 17, 19	sylancr 418	. . . . . . . . 9 |- ( W e. AssAlg -> ( Base ` W ) e. _V )
21	4, 20	eqeltrid 2325	. . . . . . . 8 |- ( W e. AssAlg -> V e. _V )
22	21	pwexd 4320	. . . . . . 7 |- ( W e. AssAlg -> ~P V e. _V )
23	22	mptexd 5947	. . . . . 6 |- ( W e. AssAlg -> ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) e. _V )
24	2, 14, 15, 23	fvmptd3 5802	. . . . 5 |- ( W e. AssAlg -> (AlgSpan ` W ) = ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) )
25	1, 24	eqtrid 2283	. . . 4 |- ( W e. AssAlg -> A = ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) )
26	25	fveq1d 5700	. . 3 |- ( W e. AssAlg -> ( A ` S ) = ( ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) ` S ) )
27	26	adantr 276	. 2 |- ( ( W e. AssAlg /\ S C_ V ) -> ( A ` S ) = ( ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) ` S ) )
28		eqid 2238	. . 3 |- ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) = ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } )
29		sseq1 3271	. . . . 5 |- ( s = S -> ( s C_ t <-> S C_ t ) )
30	29	rabbidv 2810	. . . 4 |- ( s = S -> { t e. ( (SubRing ` W ) i^i L ) | s C_ t } = { t e. ( (SubRing ` W ) i^i L ) | S C_ t } )
31	30	inteqd 3975	. . 3 |- ( s = S -> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } = |^| { t e. ( (SubRing ` W ) i^i L ) | S C_ t } )
32		elpw2g 4294	. . . . 5 |- ( V e. _V -> ( S e. ~P V <-> S C_ V ) )
33	21, 32	syl 14	. . . 4 |- ( W e. AssAlg -> ( S e. ~P V <-> S C_ V ) )
34	33	biimpar 297	. . 3 |- ( ( W e. AssAlg /\ S C_ V ) -> S e. ~P V )
35		assaring 15116	. . . . . . 7 |- ( W e. AssAlg -> W e. Ring )
36	4	subrgid 14640	. . . . . . 7 |- ( W e. Ring -> V e. (SubRing ` W ) )
37	35, 36	syl 14	. . . . . 6 |- ( W e. AssAlg -> V e. (SubRing ` W ) )
38		assalmod 15115	. . . . . . 7 |- ( W e. AssAlg -> W e. LMod )
39	4, 9	lss1 14808	. . . . . . 7 |- ( W e. LMod -> V e. L )
40	38, 39	syl 14	. . . . . 6 |- ( W e. AssAlg -> V e. L )
41	37, 40	elind 3414	. . . . 5 |- ( W e. AssAlg -> V e. ( (SubRing ` W ) i^i L ) )
42		sseq2 3272	. . . . . 6 |- ( t = V -> ( S C_ t <-> S C_ V ) )
43	42	rspcev 2929	. . . . 5 |- ( ( V e. ( (SubRing ` W ) i^i L ) /\ S C_ V ) -> E. t e. ( (SubRing ` W ) i^i L ) S C_ t )
44	41, 43	sylan 283	. . . 4 |- ( ( W e. AssAlg /\ S C_ V ) -> E. t e. ( (SubRing ` W ) i^i L ) S C_ t )
45		intexrabim 4291	. . . 4 |- ( E. t e. ( (SubRing ` W ) i^i L ) S C_ t -> |^| { t e. ( (SubRing ` W ) i^i L ) | S C_ t } e. _V )
46	44, 45	syl 14	. . 3 |- ( ( W e. AssAlg /\ S C_ V ) -> |^| { t e. ( (SubRing ` W ) i^i L ) | S C_ t } e. _V )
47	28, 31, 34, 46	fvmptd3 5802	. 2 |- ( ( W e. AssAlg /\ S C_ V ) -> ( ( s e. ~P V |-> |^| { t e. ( (SubRing ` W ) i^i L ) | s C_ t } ) ` S ) = |^| { t e. ( (SubRing ` W ) i^i L ) | S C_ t } )
48	27, 47	eqtrd 2271	1 |- ( ( W e. AssAlg /\ S C_ V ) -> ( A ` S ) = |^| { t e. ( (SubRing ` W ) i^i L ) | S C_ t } )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   E.wrex 2529   {crab 2532   _Vcvv 2821   i^i cin 3219   C_ wss 3220   ~Pcpw 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