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

<table><tr><td><table class="algorithm" id="alg4"><tr><td colspan="2">- e (RW_TAC arith_ss [EXISTS_UNIQUE_CONV “?!y. (y = ls0) <i>∧</i> (x LP ls0 = x)”]);</td></tr><tr><td colspan="2">&lt;&lt;HOL message: inventing new type variable names: ′a, ′b&gt;&gt;</td></tr><tr><td colspan="2">OK..</td></tr><tr><td colspan="2">1 subgoal:</td></tr><tr><td colspan="2">&gt; val it =</td></tr><tr><td colspan="2">  x LP ls0 = x</td></tr><tr><td colspan="2"> </td></tr><tr><td colspan="2">  <i> </i>linear_space s ls</td></tr><tr><td colspan="2">    : proof</td></tr></table></td></tr></table>

Journal of Applied Mathematics

alg4

Algorithm 4

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