ⰅⰂⰅⰓⰉ ⰗⰋⰁⰑⰐⰀⰜⰜⰋ ⰋⰐⰄⰅⰘ ⰗⰀⰎⰎⰔ ⰋⰐⰔⰋⰄⰅ ⰕⰘⰅ ⰕⰀⰁⰎⰅ
NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and depending on no axiom. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.
ⰗⰋⰁⰑⰐⰀⰜⰜⰋ ⰘⰀⰔ 32 ⰕⰅⰓⰏⰔ; ⰀⰐ ⰋⰐⰄⰅⰘ ⰒⰀⰔⰕ ⰕⰘⰅⰏ ⰓⰅⰀⰄⰔ ⰖⰐⰄⰅⰗⰋⰐⰅⰄ.
Proposition
fibonacciIndices.all (fun i => !i.neg && i.d == 1 && i.n < 32)Proof
By decide +kernel in movie.lean. Checked by the Lean kernel.
- Debit
every_fibonacci_index_falls_inside_the_table— this theorem- Credit
of_decide_eq_true:∀ {p : Prop} [inst : Decidable p], decide p = true → p— the kernel itself: the statement reduces to true by computation, and the rule that turns that reduction into a proof rests on no axiom
Sources and identifiers
- Lean source · src/pair/lean/proofs/movie.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778