We prove the intermediate
claim Li0:
OSNo i0.
We prove the intermediate
claim Li1:
OSNo i1.
We prove the intermediate
claim Li3:
OSNo i3.
We prove the intermediate
claim Li1i0:
OSNo (i1 ⨯ i0).
An
exact proof term for the current goal is
OSNo_mul_OSNo i1 i0 ?? ??.
rewrite the current goal using
OSNo_p0_i3 (from left to right).
rewrite the current goal using
mul_OSNo_proj0 i1 i0 ?? ?? (from left to right).
rewrite the current goal using
OSNo_p0_i0 (from left to right).
rewrite the current goal using
OSNo_p1_i0 (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 * 0 + - (1 ' * 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 (1 ') (HSNo_conj_HSNo 1 HSNo_1) (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_i3 (from left to right).
rewrite the current goal using
mul_OSNo_proj1 i1 i0 ?? ?? (from left to right).
rewrite the current goal using
OSNo_p0_i0 (from left to right).
rewrite the current goal using
OSNo_p1_i0 (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 1 * i + 0 * 0 ' = - (- i).
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_HSNo_invol i HSNo_Complex_i (from left to right).
rewrite the current goal using mul_HSNo_1L i HSNo_Complex_i (from left to right).
An exact proof term for the current goal is add_HSNo_0R i HSNo_Complex_i.
∎