[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 19 from proof fermat-pos (previous step)

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

User applied rule insert equation

And obtained the following new goals

Rule argument

pos: left 1 flags: discard

Additional information