| binom_coef(2 * i, j + 1) = (fac(2 * i) * (2 * i + 1 - 2 * (j + 1))) / (fac(j + 1) * fac(2 * i - j)) + binom_coef(2 * i, j), (fac(2 * i) * (2 * i + 1 - 2 * (j + 1))) / (fac(j + 1) * fac(2 * i - j)) < i, (fac(2 * i) * (2 * i + 1 - 2 * (j + 1))) / (fac(j + 1) * fac(2 * i - j)) < 0, binom_coef(2 * i, j + 1) < binom_coef(2 * i, j), binom_coef(2 * i, j + 1) ≤ binom_coef(2 * i, i), 0 < i, 0 ≤ j, j < i, binom_coef(2 * i, i) < binom_coef(2 * i, j), j < 2 * i, j + 1 < i, ∀ i0, j0. i→n(i0 - j0) < i→n(i - j) → binom_coef(2 * i0, i0) < binom_coef(2 * i0, j0) ∧ j0 < i0 ∧ 0 ≤ j0 ∧ 0 < i0 → false ⊦ |
⊦ 0 ≤ i ∧ 0 < j → ¬ i / j < 0
¬(0 ≤ fac(2 * i) * (2 * i + 1 - 2 * (j + 1)) ∧ 0 < fac(2 * i - j) * fac(j + 1)), binom_coef(2 * i, j + 1) = (fac(2 * i) * (2 * i + 1 - 2 * (j + 1))) / (fac(j + 1) * fac(2 * i - j)) + binom_coef(2 * i, j), (fac(2 * i) * (2 * i + 1 - 2 * (j + 1))) / (fac(j + 1) * fac(2 * i - j)) < i, (fac(2 * i) * (2 * i + 1 - 2 * (j + 1))) / (fac(j + 1) * fac(2 * i - j)) < 0, binom_coef(2 * i, j + 1) < binom_coef(2 * i, j), binom_coef(2 * i, j + 1) ≤ binom_coef(2 * i, i), 0 < i, 0 ≤ j, j < i, binom_coef(2 * i, i) < binom_coef(2 * i, j), j < 2 * i, j + 1 < i, ∀ i0, j0. i→n(i0 - j0) < i→n(i - j) → binom_coef(2 * i0, i0) < binom_coef(2 * i0, j0) ∧ j0 < i0 ∧ 0 ≤ j0 ∧ 0 < i0 → false ⊦
Used simplifier rules: commutativity: ⊦ i * j = j * i; from specification int-mult Used terms: fac(2 * i - j) * fac(j + 1), fac(2 * i) * (2 * i + 1 - 2 * (j + 1))