We will
prove p0 (i ⨯ k) = p0 (:-: j).
rewrite the current goal using
HSNo_p0_j (from left to right).
We will
prove p0 i * p0 k + - (p1 k ' * p1 i) = - 0.
rewrite the current goal using
HSNo_p0_i (from left to right).
rewrite the current goal using
HSNo_p1_i (from left to right).
rewrite the current goal using
HSNo_p0_k (from left to right).
rewrite the current goal using
HSNo_p1_k (from left to right).
We will
prove i * 0 + - (i ' * 0) = - 0.
rewrite the current goal using mul_CSNo_0R i CSNo_Complex_i (from left to right).
rewrite the current goal using
mul_CSNo_0R (i ') (CSNo_conj_CSNo i CSNo_Complex_i) (from left to right).
We will
prove 0 + - 0 = - 0.
An
exact proof term for the current goal is
add_CSNo_0L (- 0) (CSNo_minus_CSNo 0 CSNo_0).