We prove the intermediate
claim Li4:
OSNo i4.
We prove the intermediate
claim Li1:
OSNo i1.
We prove the intermediate
claim Li2:
OSNo i2.
We prove the intermediate
claim Li1i4:
OSNo (i1 ⨯ i4).
An
exact proof term for the current goal is
OSNo_mul_OSNo i1 i4 ?? ??.
rewrite the current goal using
OSNo_p0_j (from left to right).
rewrite the current goal using
mul_OSNo_proj0 i1 i4 ?? ?? (from left to right).
rewrite the current goal using
OSNo_p0_k (from left to right).
rewrite the current goal using
OSNo_p1_k (from left to right).
rewrite the current goal using
OSNo_p0_i (from left to right).
rewrite the current goal using
OSNo_p1_i (from left to right).
We will
prove i * k + - (0 ' * 0) = - j.
rewrite the current goal using conj_HSNo_id_SNo 0 SNo_0 (from left to right).
rewrite the current goal using mul_HSNo_0R 0 HSNo_0 (from left to right).
rewrite the current goal using minus_HSNo_0 (from left to right).
rewrite the current goal using
add_HSNo_0R (i * k) (HSNo_mul_HSNo i k HSNo_Complex_i HSNo_Quaternion_k) (from left to right).
An exact proof term for the current goal is Quaternion_i_k.
rewrite the current goal using
OSNo_p1_j (from left to right).
rewrite the current goal using
mul_OSNo_proj1 i1 i4 ?? ?? (from left to right).
rewrite the current goal using
OSNo_p0_k (from left to right).
rewrite the current goal using
OSNo_p1_k (from left to right).
rewrite the current goal using
OSNo_p0_i (from left to right).
rewrite the current goal using
OSNo_p1_i (from left to right).
We will
prove 0 * i + 0 * k ' = - 0.
rewrite the current goal using
mul_HSNo_0L (k ') (HSNo_conj_HSNo k HSNo_Quaternion_k) (from left to right).
rewrite the current goal using mul_HSNo_0L i HSNo_Complex_i (from left to right).
rewrite the current goal using minus_HSNo_0 (from left to right).
An exact proof term for the current goal is add_HSNo_0L 0 HSNo_0.
∎