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

Theorem ellspsn6 14728
Description: Relationship between a vector and the 1-dim (or 0-dim) subspace it generates. (Contributed by NM, 8-Aug-2014.) (Revised by Mario Carneiro, 8-Jan-2015.)
Hypotheses
Ref Expression
ellspsn5b.v  |-  V  =  ( Base `  W
)
ellspsn5b.s  |-  S  =  ( LSubSp `  W )
ellspsn5b.n  |-  N  =  ( LSpan `  W )
ellspsn5b.w  |-  ( ph  ->  W  e.  LMod )
ellspsn5b.a  |-  ( ph  ->  U  e.  S )
Assertion
Ref Expression
ellspsn6  |-  ( ph  ->  ( X  e.  U  <->  ( X  e.  V  /\  ( N `  { X } )  C_  U
) ) )

Proof of Theorem ellspsn6
StepHypRef Expression
1 ellspsn5b.w . . . . 5  |-  ( ph  ->  W  e.  LMod )
21adantr 276 . . . 4  |-  ( (
ph  /\  X  e.  U )  ->  W  e.  LMod )
3 ellspsn5b.a . . . . 5  |-  ( ph  ->  U  e.  S )
43adantr 276 . . . 4  |-  ( (
ph  /\  X  e.  U )  ->  U  e.  S )
5 simpr 110 . . . 4  |-  ( (
ph  /\  X  e.  U )  ->  X  e.  U )
6 ellspsn5b.v . . . . 5  |-  V  =  ( Base `  W
)
7 ellspsn5b.s . . . . 5  |-  S  =  ( LSubSp `  W )
86, 7lsselg 14681 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  S  /\  X  e.  U )  ->  X  e.  V )
92, 4, 5, 8syl3anc 1278 . . 3  |-  ( (
ph  /\  X  e.  U )  ->  X  e.  V )
10 ellspsn5b.n . . . . 5  |-  N  =  ( LSpan `  W )
117, 10lspsnss 14724 . . . 4  |-  ( ( W  e.  LMod  /\  U  e.  S  /\  X  e.  U )  ->  ( N `  { X } )  C_  U
)
122, 4, 5, 11syl3anc 1278 . . 3  |-  ( (
ph  /\  X  e.  U )  ->  ( N `  { X } )  C_  U
)
139, 12jca 306 . 2  |-  ( (
ph  /\  X  e.  U )  ->  ( X  e.  V  /\  ( N `  { X } )  C_  U
) )
146, 10lspsnid 14727 . . . . 5  |-  ( ( W  e.  LMod  /\  X  e.  V )  ->  X  e.  ( N `  { X } ) )
151, 14sylan 283 . . . 4  |-  ( (
ph  /\  X  e.  V )  ->  X  e.  ( N `  { X } ) )
16 ssel 3242 . . . 4  |-  ( ( N `  { X } )  C_  U  ->  ( X  e.  ( N `  { X } )  ->  X  e.  U ) )
1715, 16syl5com 29 . . 3  |-  ( (
ph  /\  X  e.  V )  ->  (
( N `  { X } )  C_  U  ->  X  e.  U ) )
1817impr 379 . 2  |-  ( (
ph  /\  ( X  e.  V  /\  ( N `  { X } )  C_  U
) )  ->  X  e.  U )
1913, 18impbida 604 1  |-  ( ph  ->  ( X  e.  U  <->  ( X  e.  V  /\  ( N `  { X } )  C_  U
) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209    C_ wss 3220   {csn 3708   ` cfv 5375   Basecbs 13335   LModclmod 14606   LSubSpclss 14672   LSpanclspn 14706
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 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 4244  ax-sep 4247  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-cnex 8264  ax-resscn 8265  ax-1re 8267  ax-addrcl 8270
This theorem depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  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-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-id 4436  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-riota 6032  df-ov 6082  df-inn 9288  df-2 9346  df-3 9347  df-4 9348  df-5 9349  df-6 9350  df-ndx 13338  df-slot 13339  df-base 13341  df-plusg 13427  df-mulr 13428  df-sca 13430  df-vsca 13431  df-0g 13595  df-mgm 13659  df-sgrp 13700  df-mnd 13713  df-grp 13791  df-lmod 14608  df-lssm 14673  df-lsp 14707
This theorem is referenced by:  ellspsn5b  14729
  Copyright terms: Public domain W3C validator