ⰗⰋⰂⰅ Ⱈ ⰒⰎⰖⰔ ⰑⰐⰅ ⰘⰀⰔ Ⰰ ⰜⰉⰜⰎⰅ ⰕⰘⰀⰕ ⰐⰅⰂⰅⰓ ⰏⰅⰅⰕⰔ ⰑⰐⰅ
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.
5Ⱈ + 1 ⰘⰀⰔ Ⰰ ⰜⰉⰜⰎⰅ ⰂⰋⰕⰘⰑⰖⰕ 1: ⰗⰓⰑⰏ 13 ⰋⰕ ⰓⰅⰕⰖⰓⰐⰔ ⰕⰑ 13 ⰀⰗⰕⰅⰓ ⰕⰅⰐ ⰔⰕⰅⰒⰔ ⰀⰐⰄ ⰐⰅⰂⰅⰓ ⰏⰅⰅⰕⰔ 1 ⰑⰐ ⰕⰘⰅ ⰂⰀⰉ.
Proposition
Nat.repeat (axPlusOne 5) 10 13 = 13 ∧ meetsOne 5 10 13 = falseProof
By decide in nine.lean. Checked by the Lean kernel.
- Debit
five_x_plus_one_has_a_cycle_that_never_meets_one— 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/9/nine.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778
Proved in the same file
- ⰗⰓⰑⰏ ⰐⰋⰐⰅ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰋⰔ ⰑⰐⰅ ⰜⰉⰜⰎⰅ ⰕⰘⰓⰑⰖⰃⰘ ⰅⰂⰅⰓⰉ ⰔⰕⰀⰕⰋⰑⰐ
- ⰕⰘⰅ ⰔⰕⰅⰒ ⰑⰖⰕ ⰑⰗ ⰐⰋⰐⰅ
- ⰘⰅⰓⰅ ⰓⰅⰗⰎⰅⰜⰕⰔ ⰕⰑ ⰋⰕⰔ ⰏⰋⰓⰓⰑⰓ
- ⰀⰕ ⰐⰋⰐⰅ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰎⰀⰃⰔ ⰕⰘⰅ ⰂⰀⰎⰍ ⰁⰉ ⰑⰐⰅ ⰔⰕⰅⰒ
- ⰀⰕ ⰐⰋⰐⰅ ⰕⰘⰅ ⰐⰋⰐⰅ ⰜⰑⰏⰒⰎⰅⰏⰅⰐⰕ ⰜⰑⰏⰏⰖⰕⰅⰔ ⰂⰋⰕⰘ ⰕⰘⰅ ⰂⰀⰎⰍ
- ⰗⰓⰑⰏ ⰐⰋⰐⰅ ⰂⰀⰎⰍⰋⰐⰃ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰅⰘⰒⰅⰓⰋⰅⰐⰜⰅⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰕⰘⰅ ⰗⰑⰖⰓ ⰗⰀⰜⰅⰔ ⰀⰕ ⰐⰋⰐⰅ
- ⰀⰕ ⰐⰋⰐⰅ ⰏⰋⰓⰓⰑⰓⰋⰐⰃ ⰕⰂⰋⰜⰅ ⰋⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰘⰅⰓⰅ ⰜⰀⰓⰓⰋⰅⰔ ⰐⰑ ⰜⰀⰔⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰏⰅⰅⰕⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰕⰘⰅ ⰏⰋⰓⰓⰑⰓ ⰋⰔ ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰘⰅⰓⰅ ⰔⰘⰋⰗⰕⰅⰄ
- ⰜⰑⰎⰎⰀⰕⰈ ⰘⰀⰔ ⰕⰘⰅ ⰕⰓⰋⰂⰋⰀⰎ ⰎⰑⰑⰒ
- ⰕⰘⰅ ⰎⰑⰑⰒ ⰋⰔ ⰕⰘⰅ ⰑⰒⰅⰐⰋⰐⰃ ⰂⰀⰎⰍⰅⰄ ⰁⰀⰜⰍ ⰀⰐⰄ ⰜⰎⰑⰔⰅⰄ ⰀⰘⰅⰀⰄ
- ⰕⰘⰅ ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰗⰓⰑⰏ ⰐⰋⰐⰅ ⰂⰀⰎⰍⰔ ⰕⰘⰅ ⰎⰑⰑⰒ ⰓⰅⰗⰎⰅⰜⰕⰅⰄ
- ⰅⰂⰅⰓⰉ Ⱀ ⰁⰅⰎⰑⰂ ⰔⰋⰘⰕⰉ ⰗⰑⰖⰓ ⰓⰅⰀⰜⰘⰅⰔ ⰑⰐⰅ
- ⰕⰂⰅⰐⰕⰉ ⰔⰅⰂⰅⰐ ⰐⰅⰅⰄⰔ ⰏⰑⰓⰅ ⰕⰘⰀⰐ ⰑⰐⰅ ⰘⰖⰐⰄⰓⰅⰄ ⰕⰅⰐ ⰔⰕⰅⰒⰔ
- ⰐⰋⰐⰅ ⰐⰋⰐⰅ ⰐⰋⰐⰅ Ⱀ ⰒⰎⰖⰔ ⰑⰐⰅ ⰋⰔ ⰔⰕⰀⰕⰋⰑⰐ ⰑⰐⰅ ⰋⰐ ⰕⰘⰅ ⰓⰋⰐⰃ
- ⰕⰘⰓⰅⰅ Ⱀ ⰒⰎⰖⰔ ⰑⰐⰅ ⰎⰀⰐⰄⰔ ⰑⰐ ⰑⰐⰅ ⰗⰑⰖⰓ ⰑⰓ ⰔⰅⰂⰅⰐ
- ⰐⰋⰐⰅ ⰐⰋⰐⰅ ⰐⰋⰐⰅ Ⱈ ⰒⰎⰖⰔ ⰑⰐⰅ ⰗⰓⰑⰏ ⰑⰐⰅ ⰕⰘⰑⰖⰔⰀⰐⰄ ⰘⰀⰔ ⰐⰑⰕ ⰏⰅⰕ ⰑⰐⰅ ⰋⰐ ⰔⰋⰘⰕⰉ ⰔⰕⰅⰒⰔ