| max_prime_divisor(i) ≠ 0, max_prime_divisor(i) * i0 = i, 2 ≤ i, prime(j), j | max_prime_divisor(i) * i0, 0 ≤ i, 0 < i ⊦ j = max_prime_divisor(i), j | i0, prime(i) |
max_prime_divisor(i) * i0 = i, 0 ≤ i, 0 < i, 2 ≤ i, prime(j), j | max_prime_divisor(i) ⊦ j = max_prime_divisor(i), j | i0, prime(i)
Used simplifier rules: max_prime_divisor-not-zero: ⊦ ¬ prime(i) ∧ 2 ≤ i → max_prime_divisor(i) ≠ 0;%prime-divides: ⊦ prime(i) → (i | j * j0 ↔ i | j ∨ i | j0);%commutativity: ⊦ i * j = j * i; from specification int-mult%associativity: ⊦ i * j * j0 = (i * j) * j0; from specification int-mult