Formalization of Linear Space Theory in the Higher-Order Logic Proving System

<table><tr><td><table class="algorithm" id="alg6"><tr><td colspan="2">&gt; val zero_unique =</td></tr><tr><td colspan="2">  <svg height="14.85" id="M58" style="vertical-align:-2.22495pt" version="1.1" viewbox="0 0 21.987499 14.85" width="21.987499" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,12.012)"><path d="M290 -163h-170v866h170v-28q-79 -7 -94 -19.5t-15 -72.5v-627q0 -59 14.5 -71.5t94.5 -19.5v-28z" id="x5B"></path></g><g transform="matrix(.017,-0,0,-.017,5.927,12.012)"><path d="M226 -163h-170v27q79 7 94 20t15 73v627q0 59 -15 72t-94 20v27h170v-866z" id="x5D"></path></g><g transform="matrix(.017,-0,0,-.017,17.452,12.012)"><path d="M162 -163h-61v866h61v-866z" id="x7C"></path></g>
</svg>- linear_space s ls ==&gt; !x. ?!y. (y = ls0) <i>∧</i> (x LP ls0 = x): thm</td></tr></table></td></tr></table>

Journal of Applied Mathematics

alg6

Algorithm 6

Algorithm 6: Formalization of Linear Space Theory in the Higher-Order Logic Proving System 