ⰅⰂⰅⰓⰉ ⰀⰎⰒⰘⰀ ⰋⰔ Ⰰ ⰂⰋⰔⰋⰁⰎⰅ ⰗⰓⰀⰜⰕⰋⰑⰐ
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.
ⰀⰐ ⰀⰎⰒⰘⰀ ⰋⰔ ⰒⰑⰔⰋⰕⰋⰂⰅ (ⰅⰎⰔⰅ ⰕⰘⰅ ⰎⰀⰉⰅⰓ ⰋⰔ ⰋⰐⰂⰋⰔⰋⰁⰎⰅ) ⰀⰐⰄ ⰀⰕ ⰏⰑⰔⰕ ⰑⰐⰅ (ⰜⰀⰐⰂⰀⰔ ⰜⰎⰀⰏⰒⰔ ⰀⰁⰑⰂⰅ).
Proposition
alphas.all (fun a => a.positive && a.n ≤ a.d)Proof
By decide +kernel in movie.lean. Checked by the Lean kernel.
- Debit
every_alpha_is_a_visible_fraction— 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