Let n and m be given.
We prove the intermediate
claim Hn_ord:
ordinal n.
We prove the intermediate
claim Hm_ord:
ordinal m.
We prove the intermediate
claim Hposn:
0 < ordsucc n.
We prove the intermediate
claim Hposm:
0 < ordsucc m.
We prove the intermediate
claim Hn1:
ordsucc n ∈ ω.
An
exact proof term for the current goal is
(omega_ordsucc n Hn).
We prove the intermediate
claim Hm1:
ordsucc m ∈ ω.
An
exact proof term for the current goal is
(omega_ordsucc m Hm).
We prove the intermediate
claim HSn:
SNo (ordsucc n).
We prove the intermediate
claim HSm:
SNo (ordsucc m).
rewrite the current goal using Hposcase_n (from right to left).
rewrite the current goal using Hposcase_m (from right to left).
An exact proof term for the current goal is Heq.
rewrite the current goal using Hpos_eq (from left to right).
Use reflexivity.
An exact proof term for the current goal is Hinv_eq.
An
exact proof term for the current goal is
(ordsucc_inj n m Hord).
∎