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

Algorithm 5

The proof result.

- e (RW_TAC arith_ss [zero_def]);

OK..

Goal proved.

 [linear_space s ls] |- x LP ls0 = x

Goal proved.

 [linear_space s ls] |- ?!y. (y = ls0) ∧ (x LP ls0 = x)

Goal proved.

 [linear_space s ls] |- !x. ?!y. (y = ls0) ∧ (x LP ls0 = x)

> val it =

  Initial goal proved.

    []|- linear_space s ls ==> !x. ?!y. (y = ls0) ∧ (x LP ls0 = x): proof