ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
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) ⰀⰗⰕⰅⰓ 3 ⰔⰕⰅⰒⰔ — ⰕⰘⰅ ⰔⰕⰀⰕⰋⰑⰐ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰓⰅⰀⰜⰘⰅⰔ ⰗⰓⰑⰏ 5 ⰀⰕ ⰕⰘⰀⰕ ⰔⰕⰅⰒ, ⰔⰅⰅⰐ ⰕⰘⰓⰑⰖⰃⰘ σ.
Proposition
mirrorWalk 5 3 = station .poincareProof
By decide in five.lean. Checked by the Lean kernel.
- Debit
mirror_walk_reaches_poincare— 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/5/five.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
- ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰋⰔ ⰑⰐⰅ ⰜⰉⰜⰎⰅ ⰕⰘⰓⰑⰖⰃⰘ ⰅⰂⰅⰓⰉ ⰔⰕⰀⰕⰋⰑⰐ
- ⰗⰑⰓⰂⰀⰓⰄ ⰄⰑⰖⰁⰎⰅⰔ ⰀⰐⰄ ⰗⰋⰂⰅ ⰖⰐⰄⰑⰅⰔ ⰋⰕ
- ⰓⰅⰗⰎⰅⰜⰕ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ ⰗⰋⰘⰋⰐⰃ ⰈⰅⰓⰑ ⰀⰐⰄ ⰗⰋⰂⰅ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰎⰀⰃⰔ ⰕⰘⰅ ⰂⰀⰎⰍ ⰁⰉ ⰑⰐⰅ ⰔⰕⰅⰒ
- ⰐⰋⰐⰅ ⰜⰑⰏⰒⰎⰅⰏⰅⰐⰕ ⰜⰑⰏⰏⰖⰕⰅⰔ ⰂⰋⰕⰘ ⰕⰘⰅ ⰂⰀⰎⰍ
- ⰒⰓⰅⰂ ⰖⰐⰄⰑⰅⰔ ⰐⰅⰘⰕ
- ⰂⰀⰎⰍⰋⰐⰃ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰅⰘⰒⰅⰓⰋⰅⰐⰜⰅⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰏⰋⰓⰓⰑⰓⰋⰐⰃ ⰕⰂⰋⰜⰅ ⰋⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰕⰘⰅ ⰗⰑⰖⰓ ⰗⰀⰜⰅⰔ ⰀⰓⰅ ⰄⰋⰔⰕⰋⰐⰜⰕ
- ⰘⰅⰓⰅ ⰜⰀⰓⰓⰋⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰏⰅⰅⰕⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰕⰘⰅ ⰏⰋⰓⰓⰑⰓ ⰋⰔ ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰘⰅⰓⰅ ⰔⰘⰋⰗⰕⰅⰄ
- ⰘⰑⰄⰃⰅ ⰜⰑⰐⰉⰖⰃⰀⰕⰋⰑⰐ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ
- ⰘⰑⰄⰃⰅ ⰜⰑⰐⰉⰖⰃⰀⰕⰋⰑⰐ ⰗⰋⰘⰅⰔ ⰅⰘⰀⰜⰕⰎⰉ ⰕⰘⰅ ⰄⰋⰀⰃⰑⰐⰀⰎ
- ⰁⰔⰄ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ
- ⰁⰔⰄ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰗⰋⰘⰅⰔ ⰅⰘⰀⰜⰕⰎⰉ ⰕⰘⰅ ⰜⰅⰐⰕⰓⰀⰎ ⰒⰑⰋⰐⰕ