Search for blocks/addresses/...

Proofgold Proof

pf
Let x0 of type ι be given.
Assume H0: diadic_rational_p x0.
Apply H0 with diadic_rational_p (minus_SNo x0).
Let x1 of type ι be given.
Assume H1: (λ x2 . and (x2omega) (∃ x3 . and (x3int) (x0 = mul_SNo (eps_ x2) x3))) x1.
Apply H1 with diadic_rational_p (minus_SNo x0).
Assume H2: x1omega.
Assume H3: ∃ x2 . and (x2int) (x0 = mul_SNo (eps_ x1) x2).
Apply H3 with diadic_rational_p (minus_SNo x0).
Let x2 of type ι be given.
Assume H4: (λ x3 . and (x3int) (x0 = mul_SNo (eps_ x1) x3)) x2.
Apply H4 with diadic_rational_p (minus_SNo x0).
Assume H5: x2int.
Assume H6: x0 = mul_SNo (eps_ x1) x2.
Let x3 of type ο be given.
Assume H7: ∀ x4 . and (x4omega) (∃ x5 . and (x5int) (minus_SNo x0 = mul_SNo (eps_ x4) x5))x3.
Apply H7 with x1.
Apply andI with x1omega, ∃ x4 . and (x4int) (minus_SNo x0 = mul_SNo (eps_ x1) x4) leaving 2 subgoals.
The subproof is completed by applying H2.
Let x4 of type ο be given.
Assume H8: ∀ x5 . and (x5int) (minus_SNo x0 = mul_SNo (eps_ x1) x5)x4.
Apply H8 with minus_SNo x2.
Apply andI with minus_SNo x2int, minus_SNo x0 = mul_SNo (eps_ x1) (minus_SNo x2) leaving 2 subgoals.
Apply int_minus_SNo with x2.
The subproof is completed by applying H5.
Apply mul_SNo_minus_distrR with eps_ x1, x2, λ x5 x6 . minus_SNo x0 = x6 leaving 3 subgoals.
Apply SNo_eps_ with x1.
The subproof is completed by applying H2.
Apply int_SNo with x2.
The subproof is completed by applying H5.
set y5 to be minus_SNo (mul_SNo (eps_ x1) x2)
Claim L9: ∀ x6 : ι → ο . x6 y5x6 (minus_SNo x0)
Let x6 of type ιο be given.
The subproof is completed by applying H6 with λ x7 x8 . (λ x9 . x6) (minus_SNo x7) (minus_SNo x8).
Let x6 of type ιιο be given.
Apply L9 with λ x7 . x6 x7 y5x6 y5 x7.
Assume H10: x6 y5 y5.
The subproof is completed by applying H10.