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

<b>let </b><font color="Maroon">IIG</font> be  non <a href="struct_0.html#V3">empty</a> non <a href="msualg_1.html#V2">void</a> <a href="msafree2.html#V2">Circuit-like</a> <a href="msafree2.html#V5">monotonic</a>  <a href="msualg_1.html#L1">ManySortedSign</a> ;<br/><b>let </b><font color="Maroon">A</font> be  <a href="msualg_1.html#V5">non-empty</a> <a href="msafree2.html#V4">locally-finite</a>  <a href="msualg_1.html#L3">MSAlgebra</a> of <font color="Maroon">IIG</font>;<br/><b>let </b><font color="Maroon">v</font> be   <a href="msafree2.html#NM1">Vertex</a> of <font color="Maroon">IIG</font>;<br/><b>let </b><font color="Maroon">e</font> be    <a href="subset_1.html#M1">Element</a> of the <a href="msualg_1.html#U4">Sorts</a> of <span class="p1">(<span class="default"><a href="msafree2.html#K6">FreeEnv</a> <font color="Maroon">A</font></span>)</span> <a href="funct_1.html#K1">.</a> <font color="Maroon">v</font>;<br/>







<b>assume </b><b>that </b><br/><a NAME="E1:22"/><i><font color="Green">E30</font></i>: 
<font color="Maroon">v</font> <a href="hidden.html#R2">in</a> <span class="p1">(<span class="default"><a href="msafree2.html#K4">InnerVertices</a> <font color="Maroon">IIG</font></span>)</span> <a href="subset_1.html#K7">\</a> <span class="p1">(<span class="default"><a href="msafree2.html#K1">SortsWithConstants</a> <font color="Maroon">IIG</font></span>)</span>
 <b>and </b><br/><a NAME="E2:22"/><i><font color="Green">E32</font></i>: 
 <a href="card_1.html#K4">card</a> <font color="Maroon">e</font> <a href="hidden.html#R1">=</a>  <a href="circuit1.html#K4" target="_self">size</a> <font color="Maroon">v</font>,<font color="Maroon">A</font>
 ;<br/>

<a NAME="E3:22"/>
 <a href="msafree2.html#K6">FreeEnv</a> <font color="Maroon">A</font> <a href="hidden.html#R1">=</a>  <a href="msualg_1.html#G3">MSAlgebra</a>(# <span class="p1">(<span class="default"><a href="msafree.html#K8">FreeSort</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span>,<span class="p1">(<span class="default"><a href="msafree.html#K10">FreeOper</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span> #)
 
<b>by </b><i><a class="ref" href="msafree.html#D16">MSAFREE:def 16</a></i>;<br/>
<a NAME="E4:22"/><b>then </b>
the <a href="msualg_1.html#U4">Sorts</a> of <span class="p1">(<span class="default"><a href="msafree2.html#K6">FreeEnv</a> <font color="Maroon">A</font></span>)</span> <a href="funct_1.html#K1">.</a> <font color="Maroon">v</font> <a href="hidden.html#R1">=</a>  <a href="msafree.html#K7">FreeSort</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font>,<font color="Maroon">v</font>
 
<b>by </b><i><a class="ref" href="msafree.html#D13">MSAFREE:def 13</a></i>;<br/>
<a NAME="E5:22"/><b>then </b>
<font color="Maroon">e</font> <a href="hidden.html#R2">in</a>  <a href="msafree.html#K7">FreeSort</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font>,<font color="Maroon">v</font>
 
;<br/>
<a NAME="E6:22"/><b>then </b>
<font color="Maroon">e</font> <a href="hidden.html#R2">in</a> <span class="p1">{<span class="default"> <font color="Olive">a</font> where <font color="Olive">a</font> is    <a href="dtconstr.html#M1">Element</a> of  <a href="dtconstr.html#K4">TS</a> <span class="p1">(<span class="default"><a href="msafree.html#K5">DTConMSA</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span> : (  ex <font color="Olive">x</font> being   <a href="hidden.html#M1">set</a>  st <br/>( <font color="Olive">x</font> <a href="hidden.html#R2">in</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font> <a href="funct_1.html#K1">.</a> <font color="Maroon">v</font> &amp; <font color="Olive">a</font> <a href="hidden.html#R1">=</a>  <a href="trees_4.html#K1">root-tree</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Olive">x</font>,<font color="Maroon">v</font></span><a href="tarski.html#K4">]</a></span> ) or  ex <font color="Olive">o</font> being  <a href="msualg_1.html#NM2">OperSymbol</a> of <font color="Maroon">IIG</font> st <br/>( <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Olive">o</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> <a href="hidden.html#R1">=</a> <font color="Olive">a</font> <a href="funct_1.html#K1">.</a> <a href="xboole_0.html#K1">{}</a>  &amp;  <a href="msualg_1.html#K2">the_result_sort_of</a> <font color="Olive">o</font> <a href="hidden.html#R1">=</a> <font color="Maroon">v</font> ) ) </span>}</span> 
 
<b>by </b><i><a class="ref" href="msafree.html#D12">MSAFREE:def 12</a></i>;<br/>
<b>then consider </b><font color="Maroon">a</font> being    <a href="dtconstr.html#M1">Element</a> of  <a href="dtconstr.html#K4">TS</a> <span class="p1">(<span class="default"><a href="msafree.html#K5">DTConMSA</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span><b> such that </b><br/><a NAME="E8:22"/><i><font color="Green">E33</font></i>: 
<font color="Maroon">a</font> <a href="hidden.html#R1">=</a> <font color="Maroon">e</font>
 <b>and </b><br/><a NAME="E9:22"/><i><font color="Green">E35</font></i>: 
(  ex <font color="Olive">x</font> being   <a href="hidden.html#M1">set</a>  st <br/>( <font color="Olive">x</font> <a href="hidden.html#R2">in</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font> <a href="funct_1.html#K1">.</a> <font color="Maroon">v</font> &amp; <font color="Maroon">a</font> <a href="hidden.html#R1">=</a>  <a href="trees_4.html#K1">root-tree</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Olive">x</font>,<font color="Maroon">v</font></span><a href="tarski.html#K4">]</a></span> ) or  ex <font color="Olive">o</font> being  <a href="msualg_1.html#NM2">OperSymbol</a> of <font color="Maroon">IIG</font> st <br/>( <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Olive">o</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> <a href="hidden.html#R1">=</a> <font color="Maroon">a</font> <a href="funct_1.html#K1">.</a> <a href="xboole_0.html#K1">{}</a>  &amp;  <a href="msualg_1.html#K2">the_result_sort_of</a> <font color="Olive">o</font> <a href="hidden.html#R1">=</a> <font color="Maroon">v</font> ) )
 ;<br/>
<a NAME="E10:22"/><i><font color="Green">E37</font></i>: 
( <font color="Maroon">v</font> <a href="hidden.html#R2">in</a>  <a href="msafree2.html#K4">InnerVertices</a> <font color="Maroon">IIG</font> &amp; not <font color="Maroon">v</font> <a href="hidden.html#R2">in</a>  <a href="msafree2.html#K1">SortsWithConstants</a> <font color="Maroon">IIG</font> )
 
<b>by </b><i>, <a class="ref" href="xboole_0.html#D4">XBOOLE_0:def 4</a></i>;<br/>
<a NAME="E11:22"/>
 <a href="msafree2.html#K2">InputVertices</a> <font color="Maroon">IIG</font> <a href="xboole_0.html#R1">misses</a>  <a href="msafree2.html#K4">InnerVertices</a> <font color="Maroon">IIG</font>
 
<b>by </b><i><a class="ref" href="xboole_1.html#T79">XBOOLE_1:79</a></i>;<br/>
<a NAME="E12:22"/><b>then </b>
<span class="p1">(<span class="default"><a href="msafree2.html#K2">InputVertices</a> <font color="Maroon">IIG</font></span>)</span> <a href="subset_1.html#K9">/\</a> <span class="p1">(<span class="default"><a href="msafree2.html#K4">InnerVertices</a> <font color="Maroon">IIG</font></span>)</span> <a href="hidden.html#R1">=</a>  <a href="xboole_0.html#K1">{}</a> 
 
<b>by </b><i><a class="ref" href="xboole_0.html#D7">XBOOLE_0:def 7</a></i>;<br/>
<a NAME="E13:22"/><b>then </b>
not <font color="Maroon">v</font> <a href="hidden.html#R2">in</a>  <a href="msafree2.html#K2">InputVertices</a> <font color="Maroon">IIG</font>
 
<b>by </b><i>, <a class="ref" href="xboole_0.html#D3">XBOOLE_0:def 3</a></i>;<br/>
<a NAME="E14:22"/><b>then </b>
not <font color="Maroon">v</font> <a href="hidden.html#R2">in</a> <span class="p1">(<span class="default"><a href="msafree2.html#K2">InputVertices</a> <font color="Maroon">IIG</font></span>)</span> <a href="subset_1.html#K4">\/</a> <span class="p1">(<span class="default"><a href="msafree2.html#K1">SortsWithConstants</a> <font color="Maroon">IIG</font></span>)</span>
 
<b>by </b><i>, <a class="ref" href="xboole_0.html#D2">XBOOLE_0:def 2</a></i>;<br/>
<a NAME="E15:22"/><b>then </b><i><font color="Green">E40</font></i>: 
 <a href="card_1.html#K4">card</a> <font color="Maroon">e</font> <a href="hidden.html#NR2" target="_self">&lt;&gt;</a> 1
 
<b>by </b><i>, </i>;<br/>
<b>reconsider </b><font color="Maroon">e'</font> = <font color="Maroon">e</font> as  non <a href="xboole_0.html#V1">empty</a> <a href="finset_1.html#V1">finite</a>  <a href="hidden.html#M1">set</a>  ;<br/>
<a NAME="E17:22"/>
 <a href="card_1.html#K4">card</a> <font color="Maroon">e'</font> <a href="hidden.html#NR2" target="_self">&lt;&gt;</a> 0
 
<b>by </b><i><a class="ref" href="card_2.html#T59">CARD_2:59</a></i>;<br/>
<a NAME="E18:22"/><b>then </b>
1 <a href="xxreal_0.html#R1">&lt;=</a>  <a href="card_1.html#K4">card</a> <font color="Maroon">e'</font>
 
<b>by </b><i><a class="ref" href="nat_1.html#T39">NAT_1:39</a></i>;<br/>
<a NAME="E19:22"/><b>then </b>
1 <a href="xxreal_0.html#NR3" target="_self">&lt;</a>  <a href="card_1.html#K4">card</a> <font color="Maroon">e'</font>
 
<b>by </b><i>, <a class="ref" href="real_1.html#D5">REAL_1:def 5</a></i>;<br/>
<b>then consider </b><font color="Maroon">o</font> being   <a href="msualg_1.html#NM2">OperSymbol</a> of <font color="Maroon">IIG</font><b> such that </b><br/><a NAME="E21:22"/><i><font color="Green">E41</font></i>: 
<font color="Maroon">e</font> <a href="funct_1.html#K1">.</a> <a href="xboole_0.html#K1">{}</a>  <a href="hidden.html#R1">=</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">o</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span>
 <b>by </b><i/>;<br/>
<a NAME="E22:22"/><i><font color="Green">E42</font></i>: 
 <a href="dtconstr.html#K7">NonTerminals</a> <span class="p1">(<span class="default"><a href="msafree.html#K5">DTConMSA</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span> <a href="hidden.html#R1">=</a> <span class="p1"><a href="zfmisc_1.html#K2">[:</a><span class="default">the <a href="msualg_1.html#U1">OperSymbols</a> of <font color="Maroon">IIG</font>,<span class="p2"><a href="tarski.html#K1">{</a><span class="default">the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K1">}</a></span></span><a href="zfmisc_1.html#K2">:]</a></span>
 
<b>by </b><i><a class="ref" href="msafree.html#T6">MSAFREE:6</a></i>;<br/>
<a NAME="E23:22"/>
the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font> <a href="hidden.html#R2">in</a> <span class="p1"><a href="tarski.html#K1">{</a><span class="default">the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K1">}</a></span>
 
<b>by </b><i><a class="ref" href="tarski.html#D1">TARSKI:def 1</a></i>;<br/>
<b>then reconsider </b><font color="Maroon">nt</font> = <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">o</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> as   <a href="dtconstr.html#NM3">NonTerminal</a> of <span class="p1">(<span class="default"><a href="msafree.html#K5">DTConMSA</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span> <b>by </b><i>, <a class="ref" href="zfmisc_1.html#T106">ZFMISC_1:106</a></i>;<br/>
<b>consider </b><font color="Maroon">ts</font> being    <a href="trees_4.html#M1">FinSequence</a> of  <a href="dtconstr.html#K4">TS</a> <span class="p1">(<span class="default"><a href="msafree.html#K5">DTConMSA</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font></span>)</span><b> such that </b><br/><a NAME="E26:22"/><i><font color="Green">E44</font></i>: 
<font color="Maroon">a</font> <a href="hidden.html#R1">=</a> <font color="Maroon">nt</font> <a href="trees_4.html#K12">-tree</a> <font color="Maroon">ts</font>
 <b>and </b><br/><a NAME="E27:22"/>
<font color="Maroon">nt</font> <a href="lang1.html#R1">==&gt;</a>  <a href="dtconstr.html#K1">roots</a> <font color="Maroon">ts</font>
 <b>by </b><i>, , <a class="ref" href="dtconstr.html#T10">DTCONSTR:10</a></i>;<br/>
<b>reconsider </b><font color="Maroon">q</font> = <font color="Maroon">ts</font> as  <a href="trees_3.html#V6">DTree-yielding</a> <a href="finseq_1.html#NM1">FinSequence</a> ;<br/>
<b>take </b>
<font color="Maroon">q</font>
;<br/>

<b>consider </b><font color="Maroon">x</font> being    <a href="hidden.html#M1">set</a> <b> such that </b><br/><a NAME="E30:22"/><i><font color="Green">E46</font></i>: 
( ( <font color="Maroon">x</font> <a href="hidden.html#R2">in</a> the <a href="msualg_1.html#U4">Sorts</a> of <font color="Maroon">A</font> <a href="funct_1.html#K1">.</a> <font color="Maroon">v</font> &amp; <font color="Maroon">a</font> <a href="hidden.html#R1">=</a>  <a href="trees_4.html#K1">root-tree</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">x</font>,<font color="Maroon">v</font></span><a href="tarski.html#K4">]</a></span> ) or  ex <font color="Olive">o'</font> being  <a href="msualg_1.html#NM2">OperSymbol</a> of <font color="Maroon">IIG</font> st <br/>( <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Olive">o'</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> <a href="hidden.html#R1">=</a> <font color="Maroon">a</font> <a href="funct_1.html#K1">.</a> <a href="xboole_0.html#K1">{}</a>  &amp;  <a href="msualg_1.html#K2">the_result_sort_of</a> <font color="Olive">o'</font> <a href="hidden.html#R1">=</a> <font color="Maroon">v</font> ) )
 <b>by </b><i/>;<br/>
<div><a class="txt" onclick="hs2(this)" href="javascript:()" title="22_1"><b>now </b></a><div class="add"><b>assume </b><a NAME="E1:22_1"/>
<font color="Maroon">a</font> <a href="hidden.html#R1">=</a>  <a href="trees_4.html#K1">root-tree</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">x</font>,<font color="Maroon">v</font></span><a href="tarski.html#K4">]</a></span>
 ;<br/><a NAME="E2:22_1"/><b>then </b>
<span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">o</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> <a href="hidden.html#R1">=</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">x</font>,<font color="Maroon">v</font></span><a href="tarski.html#K4">]</a></span>
 <b>by </b><i>, , <a class="ref" href="trees_4.html#T3">TREES_4:3</a></i>;<br/><a NAME="E3:22_1"/><b>then </b><i><font color="Green">E49</font></i>: 
the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font> <a href="hidden.html#R1">=</a> <font color="Maroon">v</font>
 <b>by </b><i><a class="ref" href="zfmisc_1.html#T33">ZFMISC_1:33</a></i>;<br/><a NAME="E4:22_1"/>
for <font color="Olive">X</font> being   <a href="hidden.html#M1">set</a>   holds not <font color="Olive">X</font> <a href="hidden.html#R2">in</a> <font color="Olive">X</font>
 ;<br/><b>hence </b><a NAME="E5:22_1"/>
contradiction
 <b>by </b><i/>;<br/></div><b>end;</b></div>
<b>then consider </b><font color="Maroon">o'</font> being   <a href="msualg_1.html#NM2">OperSymbol</a> of <font color="Maroon">IIG</font><b> such that </b><br/><a NAME="E33:22"/><i><font color="Green">E50</font></i>: 
<span class="p1"><a href="tarski.html#K4">[</a><span class="default"><font color="Maroon">o'</font>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> <a href="hidden.html#R1">=</a> <font color="Maroon">a</font> <a href="funct_1.html#K1">.</a> <a href="xboole_0.html#K1">{}</a> 
 <b>and </b><br/><a NAME="E34:22"/><i><font color="Green">E51</font></i>: 
 <a href="msualg_1.html#K2">the_result_sort_of</a> <font color="Maroon">o'</font> <a href="hidden.html#R1">=</a> <font color="Maroon">v</font>
 <b>by </b><i/>;<br/>
<a NAME="E35:22"/><i><font color="Green">E52</font></i>: 
( <font color="Maroon">v</font> <a href="hidden.html#R2">in</a>  <a href="msafree2.html#K4">InnerVertices</a> <font color="Maroon">IIG</font> &amp; not <font color="Maroon">v</font> <a href="hidden.html#R2">in</a>  <a href="msafree2.html#K1">SortsWithConstants</a> <font color="Maroon">IIG</font> )
 
<b>by </b><i>, <a class="ref" href="xboole_0.html#D4">XBOOLE_0:def 4</a></i>;<br/>
<font color="Maroon">o</font> = 
<font color="Maroon">o'</font>
<b>by </b><i>, , , <a class="ref" href="zfmisc_1.html#T33">ZFMISC_1:33</a></i>
<br/>.= 
 <a href="msafree2.html#K5">action_at</a> <font color="Maroon">v</font>
<b>by </b><i>, , <a class="ref" href="msafree2.html#D7">MSAFREE2:def 7</a></i>
;<br/>
<b>hence </b><a NAME="E37:22"/>
<font color="Maroon">e</font> <a href="hidden.html#R1">=</a> <span class="p1"><a href="tarski.html#K4">[</a><span class="default"><span class="p2">(<span class="default"><a href="msafree2.html#K5">action_at</a> <font color="Maroon">v</font></span>)</span>,the <a href="struct_0.html#U1">carrier</a> of <font color="Maroon">IIG</font></span><a href="tarski.html#K4">]</a></span> <a href="trees_4.html#K4">-tree</a> <font color="Maroon">q</font>
 <b>by </b><i>, </i>;<br/>


</div>
