Let x0 of type ι be given.
Let x1 of type ι be given.
Let x2 of type ι be given.
Apply H0 with
divides_int x0 (add_SNo x1 x2).
Apply H2 with
(∃ x3 . and (x3 ∈ int) (mul_SNo x0 x3 = x1)) ⟶ divides_int x0 (add_SNo x1 x2).
Apply H5 with
divides_int x0 (add_SNo x1 x2).
Let x3 of type ι be given.
Apply H6 with
divides_int x0 (add_SNo x1 x2).
Apply H1 with
divides_int x0 (add_SNo x1 x2).
Apply H9 with
(∃ x4 . and (x4 ∈ int) (mul_SNo x0 x4 = x2)) ⟶ divides_int x0 (add_SNo x1 x2).
Apply H12 with
divides_int x0 (add_SNo x1 x2).
Let x4 of type ι be given.
Apply H13 with
divides_int x0 (add_SNo x1 x2).
Apply and3I with
x0 ∈ int,
add_SNo x1 x2 ∈ int,
∃ x5 . and (x5 ∈ int) (mul_SNo x0 x5 = add_SNo x1 x2) leaving 3 subgoals.
The subproof is completed by applying H3.
Apply int_add_SNo with
x1,
x2 leaving 2 subgoals.
The subproof is completed by applying H4.
The subproof is completed by applying H11.
Let x5 of type ο be given.
Apply H16 with
add_SNo x3 x4.
Apply andI with
add_SNo x3 x4 ∈ int,
mul_SNo x0 (add_SNo x3 x4) = add_SNo x1 x2 leaving 2 subgoals.
Apply int_add_SNo with
x3,
x4 leaving 2 subgoals.
The subproof is completed by applying H7.
The subproof is completed by applying H14.
Apply mul_SNo_distrL with
x0,
x3,
x4,
λ x6 x7 . x7 = add_SNo x1 x2 leaving 4 subgoals.
Apply int_SNo with
x0.
The subproof is completed by applying H3.
Apply int_SNo with
x3.
The subproof is completed by applying H7.
Apply int_SNo with
x4.
The subproof is completed by applying H14.
set y6 to be ...
set y7 to be ...
Claim L17: ∀ x8 : ι → ο . x8 y7 ⟶ x8 y6
Let x8 of type ι → ο be given.
set y9 to be ...
Let x8 of type ι → ι → ο be given.
Apply L17 with
λ x9 . x8 x9 y7 ⟶ x8 y7 x9.
Assume H18: x8 y7 y7.
The subproof is completed by applying H18.