Theorem lspfval 14464

Description: The span function for a left vector space (or a left module). (Contributed by NM, 8-Dec-2013.) (Revised by Mario Carneiro, 19-Jun-2014.)

Hypotheses

Ref	Expression
lspval.v	|- V = ( Base ` W )
lspval.s	|- S = ( LSubSp ` W )
lspval.n	|- N = ( LSpan ` W )

Assertion

Ref	Expression
lspfval	|- ( W e. X -> N = ( s e. ~P V |-> |^| { t e. S | s C_ t } ) )

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

Allowed substitution hints:   N( t, s)   W( t)   X( t, s)

Proof of Theorem lspfval

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		lspval.n	. 2 |- N = ( LSpan ` W )
2		df-lsp 14463	. . 3 |- LSpan = ( w e. _V |-> ( s e. ~P ( Base ` w ) |-> |^| { t e. ( LSubSp ` w ) | s C_ t } ) )
3		fveq2 5648	. . . . . 6 |- ( w = W -> ( Base ` w ) = ( Base ` W ) )
4		lspval.v	. . . . . 6 |- V = ( Base ` W )
5	3, 4	eqtr4di 2282	. . . . 5 |- ( w = W -> ( Base ` w ) = V )
6	5	pweqd 3661	. . . 4 |- ( w = W -> ~P ( Base ` w ) = ~P V )
7		fveq2 5648	. . . . . . 7 |- ( w = W -> ( LSubSp ` w ) = ( LSubSp ` W ) )
8		lspval.s	. . . . . . 7 |- S = ( LSubSp ` W )
9	7, 8	eqtr4di 2282	. . . . . 6 |- ( w = W -> ( LSubSp ` w ) = S )
10	9	rabeqdv 2797	. . . . 5 |- ( w = W -> { t e. ( LSubSp ` w ) | s C_ t } = { t e. S | s C_ t } )
11	10	inteqd 3938	. . . 4 |- ( w = W -> |^| { t e. ( LSubSp ` w ) | s C_ t } = |^| { t e. S | s C_ t } )
12	6, 11	mpteq12dv 4176	. . 3 |- ( w = W -> ( s e. ~P ( Base ` w ) |-> |^| { t e. ( LSubSp ` w ) | s C_ t } ) = ( s e. ~P V |-> |^| { t e. S | s C_ t } ) )
13		elex 2815	. . 3 |- ( W e. X -> W e. _V )
14		basfn 13202	. . . . . . 7 |- Base Fn _V
15		funfvex 5665	. . . . . . . 8 |- ( ( Fun Base /\ W e. dom Base ) -> ( Base ` W ) e. _V )
16	15	funfni 5439	. . . . . . 7 |- ( ( Base Fn _V /\ W e. _V ) -> ( Base ` W ) e. _V )
17	14, 13, 16	sylancr 414	. . . . . 6 |- ( W e. X -> ( Base ` W ) e. _V )
18	4, 17	eqeltrid 2318	. . . . 5 |- ( W e. X -> V e. _V )
19	18	pwexd 4277	. . . 4 |- ( W e. X -> ~P V e. _V )
20	19	mptexd 5891	. . 3 |- ( W e. X -> ( s e. ~P V |-> |^| { t e. S | s C_ t } ) e. _V )
21	2, 12, 13, 20	fvmptd3 5749	. 2 |- ( W e. X -> ( LSpan ` W ) = ( s e. ~P V |-> |^| { t e. S | s C_ t } ) )
22	1, 21	eqtrid 2276	1 |- ( W e. X -> N = ( s e. ~P V |-> |^| { t e. S | s C_ t } ) )

Syntax hints:   -> wi 4   = wceq 1398   e. wcel 2202   {crab 2515   _Vcvv 2803   C_ wss 3201   ~Pcpw 3656   |^|cint 3933   |-> cmpt 4155   Fn wfn 5328   ` cfv 5333   Basecbs 13143   LSubSpclss 14428   LSpanclspn 14462

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-cnex 8166  ax-resscn 8167  ax-1re 8169  ax-addrcl 8172

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-inn 9187  df-ndx 13146  df-slot 13147  df-base 13149  df-lsp 14463

This theorem is referenced by:  lspf  14465  lspval  14466  lspex  14471  lsppropd  14508