<?xml version="1.0"?>
<div class="add">

<b>let </b><font color="Maroon">V</font> be   <a href="bhsp_1.html#NM1">RealUnitarySpace</a>;<br/><b>let </b><font color="Maroon">W</font> be    <a href="rusub_1.html#M1">Subspace</a> of <font color="Maroon">V</font>;<br/><b>let </b><font color="Maroon">A</font> be   <a href="struct_0.html#NM2">Subset</a> of <font color="Maroon">V</font>;<br/>





<b>assume </b><b>that </b><br/><a NAME="E1:30"/><i><font color="Green">E24</font></i>: 
<font color="Maroon">A</font> is <a href="rlvect_3.html#V1">linearly-independent</a>
 <b>and </b><br/><a NAME="E2:30"/><i><font color="Green">E28</font></i>: 
<font color="Maroon">A</font> <a href="tarski.html#R1">c=</a> the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">W</font>
 ;<br/>

<b>reconsider </b><font color="Maroon">A'</font> = <font color="Maroon">A</font> as   <a href="struct_0.html#NM2">Subset</a> of <font color="Maroon">W</font> <b>by </b><i><a class="ref" href="rusub_3.html#D1" target="_self">Def1</a></i>;<br/>
<div><a class="txt" onclick="hs2(this)" href="javascript:()" title="30_1"><b>now </b></a><div class="add"><b>assume </b><a NAME="E1:30_1"/>
not <font color="Maroon">A'</font> is <a href="rlvect_3.html#V1">linearly-independent</a>
 ;<br/><b>then consider </b><font color="Maroon">K</font> being    <a href="rlvect_2.html#M2">Linear_Combination</a> of <font color="Maroon">A'</font><b> such that </b><br/><a NAME="E3:30_1"/><i><font color="Green">E29</font></i>: 
(  <a href="rlvect_2.html#K6">Sum</a> <font color="Maroon">K</font> <a href="hidden.html#R1">=</a>  <a href="rlvect_1.html#K1">0.</a> <font color="Maroon">W</font> &amp;  <a href="rlvect_2.html#K3">Carrier</a> <font color="Maroon">K</font> <a href="hidden.html#NR2" target="_self">&lt;&gt;</a>  <a href="xboole_0.html#K1">{}</a>  )
 <b>by </b><i><a class="ref" href="rlvect_3.html#D1">RLVECT_3:def 1</a></i>;<br/><b>consider </b><font color="Maroon">L</font> being    <a href="rlvect_2.html#M1">Linear_Combination</a> of <font color="Maroon">V</font><b> such that </b><br/><a NAME="E5:30_1"/><i><font color="Green">E31</font></i>: 
(  <a href="rlvect_2.html#K3">Carrier</a> <font color="Maroon">L</font> <a href="hidden.html#R1">=</a>  <a href="rlvect_2.html#K3">Carrier</a> <font color="Maroon">K</font> &amp;  <a href="rlvect_2.html#K6">Sum</a> <font color="Maroon">L</font> <a href="hidden.html#R1">=</a>  <a href="rlvect_2.html#K6">Sum</a> <font color="Maroon">K</font> )
 <b>by </b><i/>;<br/><a NAME="E6:30_1"/>
 <a href="rlvect_2.html#K3">Carrier</a> <font color="Maroon">L</font> <a href="tarski.html#R1">c=</a> <font color="Maroon">A</font>
 <b>by </b><i><a class="txt" href="rusub_3.html#E1:30"><i><font color="Green">E24</font></i></a>, <a class="ref" href="rlvect_2.html#D8">RLVECT_2:def 8</a></i>;<br/><b>then reconsider </b><font color="Maroon">L</font> = <font color="Maroon">L</font> as    <a href="rlvect_2.html#M2">Linear_Combination</a> of <font color="Maroon">A</font> <b>by </b><i><a class="ref" href="rlvect_2.html#D8">RLVECT_2:def 8</a></i>;<br/><a NAME="E8:30_1"/>
(  <a href="rlvect_2.html#K6">Sum</a> <font color="Maroon">L</font> <a href="hidden.html#R1">=</a>  <a href="rlvect_1.html#K1">0.</a> <font color="Maroon">V</font> &amp;  <a href="rlvect_2.html#K3">Carrier</a> <font color="Maroon">L</font> <a href="hidden.html#NR2" target="_self">&lt;&gt;</a>  <a href="xboole_0.html#K1">{}</a>  )
 <b>by </b><i>, <a class="txt" href="rusub_3.html#E1:30"><i><font color="Green">E24</font></i></a>, <a class="ref" href="rusub_1.html#T4">RUSUB_1:4</a></i>;<br/><b>hence </b><a NAME="E9:30_1"/>
contradiction
 <b>by </b><i>, <a class="ref" href="rlvect_3.html#D1">RLVECT_3:def 1</a></i>;<br/></div><b>end;</b></div>
<b>hence </b><a NAME="E5:30"/>
<font color="Maroon">A</font> is  <a href="rlvect_3.html#V1">linearly-independent</a> <a href="struct_0.html#NM2">Subset</a> of <font color="Maroon">W</font>
 ;<br/>


</div>
