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

<b>let </b><font color="Maroon">FT</font> be  non <a href="struct_0.html#V3">empty</a>  <a href="orders_2.html#L1">RelStr</a> ;<br/>

<b>assume </b><a NAME="E1:43"/><i><font color="Green">E27</font></i>: 
 <a href="pre_topc.html#K2">[#]</a> <font color="Maroon">FT</font> is <a href="fin_topo.html#V5">connected</a>
 ; <i><font color="Red">:: according to </font></i><a class="ref" href="fintopo6.html#D1" target="_self">FINTOPO6:def 1</a><br/>

<b>given </b><font color="Maroon">A</font> being   <a href="struct_0.html#NM2">Subset</a> of <font color="Maroon">FT</font>, <font color="Maroon">B</font> being   <a href="struct_0.html#NM2">Subset</a> of <font color="Maroon">FT</font><b> such that </b><a NAME="E2:43"/><i><font color="Green">E31</font></i>: 
 <a href="pre_topc.html#K2">[#]</a> <font color="Maroon">FT</font> <a href="hidden.html#R1">=</a> <font color="Maroon">A</font> <a href="subset_1.html#K4">\/</a> <font color="Maroon">B</font>
 <b>and </b><br/><a NAME="E3:43"/><i><font color="Green">E33</font></i>: 
( <font color="Maroon">A</font> <a href="hidden.html#NR2" target="_self">&lt;&gt;</a>  <a href="pre_topc.html#K1">{}</a> <font color="Maroon">FT</font> &amp; <font color="Maroon">B</font> <a href="hidden.html#NR2" target="_self">&lt;&gt;</a>  <a href="pre_topc.html#K1">{}</a> <font color="Maroon">FT</font> )
 <b>and </b><br/><a NAME="E4:43"/><i><font color="Green">E41</font></i>: 
( <font color="Maroon">A</font> is <a href="fin_topo.html#V4">closed</a> &amp; <font color="Maroon">B</font> is <a href="fin_topo.html#V4">closed</a> &amp; <font color="Maroon">A</font> <a href="xboole_0.html#R1">misses</a> <font color="Maroon">B</font> )
 ;<br/>

<a NAME="E5:43"/>
<font color="Maroon">A</font>,<font color="Maroon">B</font> <a href="fintopo4.html#R1">are_separated</a> 
 
<b>by </b><i>, </i>;<br/>
<b>hence </b><a NAME="E6:43"/>
contradiction
 <b>by </b><i>, , , , </i>;<br/>


</div>
