ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
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.
ⰂⰀⰎⰍⰋⰐⰃ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰗⰓⰑⰏ 6, ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰋⰔ ⰅⰘⰒⰅⰓⰋⰅⰐⰜⰅⰄ ⰀⰔ ⰉⰀⰐⰃ–ⰏⰋⰎⰎⰔ (ⰔⰕⰀⰕⰋⰑⰐ 8) ⰀⰗⰕⰅⰓ 9 ⰔⰕⰅⰒⰔ — ⰕⰘⰅ ⰔⰕⰀⰕⰋⰑⰐ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰓⰅⰀⰜⰘⰅⰔ ⰗⰓⰑⰏ 4 ⰀⰕ ⰕⰘⰀⰕ ⰔⰕⰅⰒ, ⰔⰅⰅⰐ ⰕⰘⰓⰑⰖⰃⰘ σ.
Proposition
mirrorWalk 6 9 = station .yangMillsProof
By decide in six.lean. Checked by the Lean kernel.
- Debit
mirror_walk_reaches_yangMills— 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/6/six.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
- ⰗⰓⰑⰏ ⰔⰋⰘ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰋⰔ ⰑⰐⰅ ⰜⰉⰜⰎⰅ ⰕⰘⰓⰑⰖⰃⰘ ⰅⰂⰅⰓⰉ ⰔⰕⰀⰕⰋⰑⰐ
- ⰕⰘⰅ ⰔⰕⰅⰒ ⰑⰖⰕ ⰑⰗ ⰔⰋⰘ
- ⰘⰅⰓⰅ ⰓⰅⰗⰎⰅⰜⰕⰔ ⰕⰑ ⰋⰕⰔ ⰏⰋⰓⰓⰑⰓ
- ⰀⰕ ⰔⰋⰘ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰎⰀⰃⰔ ⰕⰘⰅ ⰂⰀⰎⰍ ⰁⰉ ⰑⰐⰅ ⰔⰕⰅⰒ
- ⰀⰕ ⰔⰋⰘ ⰕⰘⰅ ⰐⰋⰐⰅ ⰜⰑⰏⰒⰎⰅⰏⰅⰐⰕ ⰜⰑⰏⰏⰖⰕⰅⰔ ⰂⰋⰕⰘ ⰕⰘⰅ ⰂⰀⰎⰍ
- ⰗⰓⰑⰏ ⰔⰋⰘ ⰂⰀⰎⰍⰋⰐⰃ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰅⰘⰒⰅⰓⰋⰅⰐⰜⰅⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰕⰘⰅ ⰗⰑⰖⰓ ⰗⰀⰜⰅⰔ ⰀⰕ ⰔⰋⰘ
- ⰀⰕ ⰔⰋⰘ ⰏⰋⰓⰓⰑⰓⰋⰐⰃ ⰕⰂⰋⰜⰅ ⰋⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰘⰅⰓⰅ ⰜⰀⰓⰓⰋⰅⰔ ⰐⰑ ⰜⰀⰔⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰏⰅⰅⰕⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰕⰘⰅ ⰏⰋⰓⰓⰑⰓ ⰋⰔ ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰘⰅⰓⰅ ⰔⰘⰋⰗⰕⰅⰄ