[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 36 from proof fermat-pos (previous step)

0 < i2, 0 ≤ i2, 0 < j1, j1 ≤ i2, 0 ≤ i1, ≡mod(i1 ^ (i2 + 1), i1, i2 + 1), prime(i2 + 1), 0 ≤ j1, ∀ i0, j. i→n(i0) < i→n(i1 + 1) → prime(j) ∧ 0 < i0 → ≡mod(i0 ^ j, i0, j) ⊦ gcd(j1, i2 + 1) = 1, i2 + 1 | binom_coef(i2 + 1, j1), i2 + 1 | i1, i2 + 1 | Σ countFun(1, i2, λ j0. i1 ^ j0 * binom_coef(i2 + 1, j0)), ≡mod(Σ countFun(1, i2, λ j0. i1 ^ j0 * binom_coef(i2 + 1, j0)) + i1 ^ (i2 + 1), i1, i2 + 1)

User applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: int-gcd inst: name: gcd-prime seq: ⊦ prime(j) ∧ 1 < i ∧ i < j → gcd(i, j) = 1 subst: [j, i] → [i2 + 1, j1] flags: rewrite

Additional information

Used simplifier rules: succ-02: ⊦ i < j + 1 ↔ i ≤ j; from specification int-abs%add-a: ⊦ i + j + i0 = (i + j) + i0; from specification int-basic2%add-c: ⊦ i + j = j + i; from specification int-basic2%lels: ⊦ ¬ i < j ↔ j ≤ i; from specification int-abs%bet: ⊦ 0 < i → (i ≤ 1 ↔ i = 1); from specification int-abs%gcd-add: ⊦ 0 < i ∧ 0 < j → gcd(i + j, j) = gcd(i, j); from specification int-gcd%gcd-one-01: ⊦ gcd(i, 1) = 1; from specification int-gcd%gcd-com: ⊦ gcd(i, j) = gcd(j, i); from specification int-gcd Used terms: i2 + 1, j1