| i0 * i0 = i1 * i1 * j, max_prime_divisor(j0) * i0 = j0, j0 ≤ i0, 0 < max_prime_divisor(j0) * i1, 0 < j0, 0 < j, prime(max_prime_divisor(j0)), 0 < i0, ∀ j1, j, i. i→n(j1) < i→n(j0) → j1 * j1 = j * i * i ∧ 0 < j1 ∧ 0 < j ∧ 0 < i → i = 0 ∨ isSquare(j) ⊦ max_prime_divisor(j0) = 0, i1 = 0, prime(j0), isSquare(j) |
i0 * i0 = i1 * i1 * j, max_prime_divisor(j0) * i0 = j0, max_prime_divisor(j0) * i0 ≤ i0, 0 < max_prime_divisor(max_prime_divisor(j0) * i0) * i1, 0 < max_prime_divisor(j0) * i0, 0 < j, prime(max_prime_divisor(max_prime_divisor(j0) * i0)), 0 < i0, ∀ j1, j, i. i→n(j1) < i→n(max_prime_divisor(j0) * i0) → j1 * j1 = j * i * i ∧ 0 < j1 ∧ 0 < j ∧ 0 < i → i = 0 ∨ isSquare(j) ⊦ max_prime_divisor(max_prime_divisor(j0) * i0) = 0, i1 = 0, prime(max_prime_divisor(j0) * i0), isSquare(j)