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

Theorem lspval 14369
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 14367 . . . 4  |-  ( W  e.  LMod  ->  N  =  ( s  e.  ~P V  |->  |^| { t  e.  S  |  s  C_  t } ) )
54fveq1d 5631 . . 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 2229 . . 3  |-  ( s  e.  ~P V  |->  |^|
{ t  e.  S  |  s  C_  t } )  =  ( s  e.  ~P V  |->  |^|
{ t  e.  S  |  s  C_  t } )
8 sseq1 3247 . . . . 5  |-  ( s  =  U  ->  (
s  C_  t  <->  U  C_  t
) )
98rabbidv 2788 . . . 4  |-  ( s  =  U  ->  { t  e.  S  |  s 
C_  t }  =  { t  e.  S  |  U  C_  t } )
109inteqd 3928 . . 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 13106 . . . . . . 7  |-  Base  Fn  _V
13 elex 2811 . . . . . . . 8  |-  ( W  e.  LMod  ->  W  e. 
_V )
1413adantr 276 . . . . . . 7  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  W  e.  _V )
15 funfvex 5646 . . . . . . . 8  |-  ( ( Fun  Base  /\  W  e. 
dom  Base )  ->  ( Base `  W )  e. 
_V )
1615funfni 5423 . . . . . . 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 2316 . . . . 5  |-  ( ( W  e.  LMod  /\  U  C_  V )  ->  V  e.  _V )
19 elpw2g 4240 . . . . 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 14341 . . . . 5  |-  ( W  e.  LMod  ->  V  e.  S )
23 sseq2 3248 . . . . . 6  |-  ( t  =  V  ->  ( U  C_  t  <->  U  C_  V
) )
2423rspcev 2907 . . . . 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 4237 . . . 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 5730 . 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 2262 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 1395    e. wcel 2200   E.wrex 2509   {crab 2512   _Vcvv 2799    C_ wss 3197   ~Pcpw 3649   |^|cint 3923    |-> cmpt 4145    Fn wfn 5313   ` cfv 5318   Basecbs 13047   LModclmod 14266   LSubSpclss 14331   LSpanclspn 14365
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 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-cnex 8101  ax-resscn 8102  ax-1re 8104  ax-addrcl 8107
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-un 3201  df-in 3203  df-ss 3210  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4384  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-riota 5960  df-ov 6010  df-inn 9122  df-2 9180  df-3 9181  df-4 9182  df-5 9183  df-6 9184  df-ndx 13050  df-slot 13051  df-base 13053  df-plusg 13138  df-mulr 13139  df-sca 13141  df-vsca 13142  df-0g 13306  df-mgm 13404  df-sgrp 13450  df-mnd 13465  df-grp 13551  df-lmod 14268  df-lssm 14332  df-lsp 14366
This theorem is referenced by:  lspid  14376  lspss  14378  lspssid  14379
  Copyright terms: Public domain W3C validator