Let w be given.
Apply Hexn to the current goal.
Let n be given.
Assume Hnpack.
Apply Hnpack to the current goal.
Assume HnIn HwEq.
rewrite the current goal using HwEq (from left to right).
We prove the intermediate
claim HnO:
n ∈ ω.
An
exact proof term for the current goal is
(setminusE1 ω {0} n HnIn).
We prove the intermediate
claim HinvR:
inv ∈ R.
An
exact proof term for the current goal is
(inv_nat_real n HnO).
We prove the intermediate
claim HinvS:
SNo inv.
An
exact proof term for the current goal is
(real_SNo inv HinvR).
We prove the intermediate
claim HinvPosR:
Rlt 0 inv.
An
exact proof term for the current goal is
(inv_nat_pos n HnIn).
We prove the intermediate
claim HinvPos:
0 < inv.
An
exact proof term for the current goal is
(RltE_lt 0 inv HinvPosR).
We prove the intermediate
claim H10eq:
add_SNo 1 0 = 1.
rewrite the current goal using H10eq (from right to left) at position 1.
An exact proof term for the current goal is Htmp.
rewrite the current goal using Hp10def (from left to right).
Apply orIL to the current goal.
An exact proof term for the current goal is HxltR.
∎