ⰕⰘⰅ ⰗⰑⰖⰓ ⰗⰀⰜⰅⰔ ⰀⰓⰅ ⰄⰋⰔⰕⰋⰐⰜⰕ
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
let faceProof
By fun (f : Nat → Nat) => (List.range 10).map f in five.lean. Checked by the Lean kernel.
- Debit
the_four_faces_are_distinct— 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
- ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰋⰔ ⰑⰐⰅ ⰜⰉⰜⰎⰅ ⰕⰘⰓⰑⰖⰃⰘ ⰅⰂⰅⰓⰉ ⰔⰕⰀⰕⰋⰑⰐ
- ⰗⰑⰓⰂⰀⰓⰄ ⰄⰑⰖⰁⰎⰅⰔ ⰀⰐⰄ ⰗⰋⰂⰅ ⰖⰐⰄⰑⰅⰔ ⰋⰕ
- ⰓⰅⰗⰎⰅⰜⰕ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ ⰗⰋⰘⰋⰐⰃ ⰈⰅⰓⰑ ⰀⰐⰄ ⰗⰋⰂⰅ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰎⰀⰃⰔ ⰕⰘⰅ ⰂⰀⰎⰍ ⰁⰉ ⰑⰐⰅ ⰔⰕⰅⰒ
- ⰐⰋⰐⰅ ⰜⰑⰏⰒⰎⰅⰏⰅⰐⰕ ⰜⰑⰏⰏⰖⰕⰅⰔ ⰂⰋⰕⰘ ⰕⰘⰅ ⰂⰀⰎⰍ
- ⰒⰓⰅⰂ ⰖⰐⰄⰑⰅⰔ ⰐⰅⰘⰕ
- ⰂⰀⰎⰍⰋⰐⰃ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰅⰘⰒⰅⰓⰋⰅⰐⰜⰅⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰏⰋⰓⰓⰑⰓⰋⰐⰃ ⰕⰂⰋⰜⰅ ⰋⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰘⰅⰓⰅ ⰜⰀⰓⰓⰋⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰏⰅⰅⰕⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰕⰘⰅ ⰏⰋⰓⰓⰑⰓ ⰋⰔ ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰘⰅⰓⰅ ⰔⰘⰋⰗⰕⰅⰄ
- ⰘⰑⰄⰃⰅ ⰜⰑⰐⰉⰖⰃⰀⰕⰋⰑⰐ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ
- ⰘⰑⰄⰃⰅ ⰜⰑⰐⰉⰖⰃⰀⰕⰋⰑⰐ ⰗⰋⰘⰅⰔ ⰅⰘⰀⰜⰕⰎⰉ ⰕⰘⰅ ⰄⰋⰀⰃⰑⰐⰀⰎ
- ⰁⰔⰄ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ
- ⰁⰔⰄ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰗⰋⰘⰅⰔ ⰅⰘⰀⰜⰕⰎⰉ ⰕⰘⰅ ⰜⰅⰐⰕⰓⰀⰎ ⰒⰑⰋⰐⰕ