Let x, x', x'i, y and y' be given.
Assume Hx Hxpos Hx' Hx'i Hx'x'i Hy Hxy1 Hy' Hy'y.
Apply SNoR_E x Hx x' Hx' to the current goal.
We prove the intermediate
claim Lxy:
SNo (x * y).
An
exact proof term for the current goal is
SNo_mul_SNo x y Hx Hy.
We prove the intermediate
claim Lxy':
SNo (x * y').
An
exact proof term for the current goal is
SNo_mul_SNo x y' Hx Hy'.
We prove the intermediate
claim Lx'pos:
0 < x'.
An
exact proof term for the current goal is
SNoLt_tra 0 x x' SNo_0 Hx Hx'1 Hxpos Hx'3.
We prove the intermediate
claim L1:
0 < 1 + - x * y.
We will
prove 0 + x * y < 1.
rewrite the current goal using
add_SNo_0L (x * y) Lxy (from left to right).
An exact proof term for the current goal is Hxy1.
We prove the intermediate
claim L2:
0 < (x' + - x) * x'i.
We will
prove 0 < x' + - x.
We will
prove 0 + x < x'.
rewrite the current goal using
add_SNo_0L x Hx (from left to right).
An exact proof term for the current goal is Hx'3.
An
exact proof term for the current goal is
SNo_recip_pos_pos x' x'i Hx'1 Hx'i Lx'pos Hx'x'i.
We prove the intermediate
claim L3:
0 < 1 + - x * y'.
rewrite the current goal using Hy'y (from left to right).
We will
prove 0 < (1 + - x * y) * (x' + - x) * x'i.
An exact proof term for the current goal is L1.
An exact proof term for the current goal is L2.
We will
prove x * y' < 1.
rewrite the current goal using
add_SNo_0L (x * y') Lxy' (from right to left).
We will
prove 0 + x * y' < 1.
∎