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

Theorem lspval 14664
Description: The span of a set of vectors (in 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
lspval  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  ( N `  U )  =  |^| { t  e.  S  |  U  C_  t } )
Distinct variable groups:    t, S    t, U    t, V
Allowed substitution hints:    N( t)    W( t)

Proof of Theorem lspval
Dummy variable  s is distinct from all other variables.
StepHypRef Expression
1 lspval.v . . . . 5  |-  V  =  ( Base `  W
)
2 lspval.s . . . . 5  |-  S  =  ( LSubSp `  W )
3 lspval.n . . . . 5  |-  N  =  ( LSpan `  W )
41, 2, 3lspfval 14662 . . . 4  |-  ( W  e.  LMod  ->  N  =  ( s  e.  ~P V  |->  |^| { t  e.  S  |  s  C_  t } ) )
54fveq1d 5677 . . 3  |-  ( W  e.  LMod  ->  ( N `
 U )  =  ( ( s  e. 
~P V  |->  |^| { t  e.  S  |  s 
C_  t } ) `
 U ) )
65adantr 276 . 2  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  ( N `  U )  =  ( ( s  e.  ~P V  |->  |^|
{ t  e.  S  |  s  C_  t } ) `  U ) )
7 eqid 2234 . . 3  |-  ( s  e.  ~P V  |->  |^|
{ t  e.  S  |  s  C_  t } )  =  ( s  e.  ~P V  |->  |^|
{ t  e.  S  |  s  C_  t } )
8 sseq1 3265 . . . . 5  |-  ( s  =  U  ->  (
s  C_  t  <->  U  C_  t
) )
98rabbidv 2804 . . . 4  |-  ( s  =  U  ->  { t  e.  S  |  s 
C_  t }  =  { t  e.  S  |  U  C_  t } )
109inteqd 3959 . . 3  |-  ( s  =  U  ->  |^| { t  e.  S  |  s 
C_  t }  =  |^| { t  e.  S  |  U  C_  t } )
11 simpr 110 . . . 4  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  U  C_  V )
12 basfn 13355 . . . . . . 7  |-  Base  Fn  _V
13 elex 2827 . . . . . . . 8  |-  ( W  e.  LMod  ->  W  e. 
_V )
1413adantr 276 . . . . . . 7  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  W  e.  _V )
15 funfvex 5692 . . . . . . . 8  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
1615funfni 5463 . . . . . . 7  |-  ( (
Base  Fn  _V  /\  W  e.  _V )  ->  ( Base `  W )  e. 
_V )
1712, 14, 16sylancr 414 . . . . . 6  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  ( Base `  W )  e. 
_V )
181, 17eqeltrid 2321 . . . . 5  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  V  e.  _V )
19 elpw2g 4273 . . . . 5  |-  ( V  e.  _V  ->  ( U  e.  ~P V  <->  U 
C_  V ) )
2018, 19syl 14 . . . 4  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  ( U  e.  ~P V  <->  U 
C_  V ) )
2111, 20mpbird 167 . . 3  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  U  e.  ~P V )
221, 2lss1 14636 . . . . 5  |-  ( W  e.  LMod  ->  V  e.  S )
23 sseq2 3266 . . . . . 6  |-  ( t  =  V  ->  ( U  C_  t  <->  U  C_  V
) )
2423rspcev 2923 . . . . 5  |-  ( ( V  e.  S  /\  U  C_  V )  ->  E. t  e.  S  U  C_  t )
2522, 24sylan 283 . . . 4  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  E. t  e.  S  U  C_  t
)
26 intexrabim 4270 . . . 4  |-  ( E. t  e.  S  U  C_  t  ->  |^| { t  e.  S  |  U  C_  t }  e.  _V )
2725, 26syl 14 . . 3  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  |^| { t  e.  S  |  U  C_  t }  e.  _V )
287, 10, 21, 27fvmptd3 5776 . 2  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  (
( s  e.  ~P V  |->  |^| { t  e.  S  |  s  C_  t } ) `  U
)  =  |^| { t  e.  S  |  U  C_  t } )
296, 28eqtrd 2267 1  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  ( N `  U )  =  |^| { t  e.  S  |  U  C_  t } )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2205   E.wrex 2523   {crab 2526   _Vcvv 2815    C_ wss 3214   ~Pcpw 3674   |^|cint 3954    |-> cmpt 4176    Fn wfn 5352   ` cfv 5357   Basecbs 13296   LModclmod 14561   LSubSpclss 14626   LSpanclspn 14660
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-inn 9255  df-2 9313  df-3 9314  df-4 9315  df-5 9316  df-6 9317  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-mulr 13388  df-sca 13390  df-vsca 13391  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-grp 13758  df-lmod 14563  df-lssm 14627  df-lsp 14661
This theorem is referenced by:  lspid  14671  lspss  14673  lspssid  14674
  Copyright terms: Public domain W3C validator