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

Algorithm 1

Initial goal g.

-g “linear_space ^∧s^∧ls ==> !x:′a.?!y:′a. (y = ls0) ∧ (x LP ls0 = x)”;

> val it =

   Proof manager status: 1 proof.

   1. Incomplete goalstack:

      Initial goal:

      linear_space s ls ==> !x. ?!y. (y = ls0) ∧ (x LP ls0 = x)

     : proofs