We prove the intermediate
claim Li1:
OSNo i1.
We prove the intermediate
claim Li5:
OSNo i5.
We prove the intermediate
claim Li6:
OSNo i6.
We prove the intermediate
claim Li1i5:
OSNo (i1 ⨯ i5).
An
exact proof term for the current goal is
OSNo_mul_OSNo i1 i5 ?? ??.
rewrite the current goal using
OSNo_p0_i6 (from left to right).
rewrite the current goal using
mul_OSNo_proj0 i1 i5 ?? ?? (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).
rewrite the current goal using
OSNo_p0_i5 (from left to right).
rewrite the current goal using
OSNo_p1_i5 (from left to right).
We will
prove i * 0 + - ((- k) ' * 0) = 0.
rewrite the current goal using mul_HSNo_0R i HSNo_Complex_i (from left to right).
rewrite the current goal using
mul_HSNo_0R ((- k) ') (HSNo_conj_HSNo (- k) (HSNo_minus_HSNo k HSNo_Quaternion_k)) (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.
rewrite the current goal using
OSNo_p1_i6 (from left to right).
rewrite the current goal using
mul_OSNo_proj1 i1 i5 ?? ?? (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).
rewrite the current goal using
OSNo_p0_i5 (from left to right).
rewrite the current goal using
OSNo_p1_i5 (from left to right).
We will
prove (- k) * i + 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_0L 0 HSNo_0 (from left to right).
rewrite the current goal using minus_mul_HSNo_distrL k i HSNo_Quaternion_k HSNo_Complex_i (from left to right).
rewrite the current goal using Quaternion_k_i (from left to right).
An
exact proof term for the current goal is
add_HSNo_0R (- j) (HSNo_minus_HSNo j HSNo_Quaternion_j).
∎