ⰕⰘⰅ ⰗⰑⰖⰓ ⰗⰀⰜⰅⰔ ⰀⰕ ⰕⰂⰑ
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.
ⰕⰘⰅ ⰗⰑⰖⰓ ⰗⰀⰜⰅⰔ ⰓⰅⰀⰄ ⰀⰕ 2: ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰔⰕⰅⰒⰔ ⰕⰑ 4, ⰁⰀⰜⰍ ⰕⰑ 1; ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰂⰀⰎⰍ ⰔⰕⰅⰒⰔ ⰕⰑ 3, ⰁⰀⰜⰍ ⰕⰑ 6.
Proposition
next 2 = 4 ∧ prev 2 = 1 ∧ mirrorNext 2 = 3 ∧ mirrorPrev 2 = 6Proof
By decide in two.lean. Checked by the Lean kernel.
- Debit
the_four_faces_at_two— 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/2/two.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
- ⰗⰓⰑⰏ ⰕⰂⰑ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ ⰋⰔ ⰑⰐⰅ ⰜⰉⰜⰎⰅ ⰕⰘⰓⰑⰖⰃⰘ ⰅⰂⰅⰓⰉ ⰔⰕⰀⰕⰋⰑⰐ
- ⰕⰘⰅ ⰔⰕⰅⰒ ⰑⰖⰕ ⰑⰗ ⰕⰂⰑ
- ⰘⰅⰓⰅ ⰓⰅⰗⰎⰅⰜⰕⰔ ⰕⰑ ⰋⰕⰔ ⰏⰋⰓⰓⰑⰓ
- ⰀⰕ ⰕⰂⰑ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰎⰀⰃⰔ ⰕⰘⰅ ⰂⰀⰎⰍ ⰁⰉ ⰑⰐⰅ ⰔⰕⰅⰒ
- ⰀⰕ ⰕⰂⰑ ⰕⰘⰅ ⰐⰋⰐⰅ ⰜⰑⰏⰒⰎⰅⰏⰅⰐⰕ ⰜⰑⰏⰏⰖⰕⰅⰔ ⰂⰋⰕⰘ ⰕⰘⰅ ⰂⰀⰎⰍ
- ⰗⰓⰑⰏ ⰕⰂⰑ ⰂⰀⰎⰍⰋⰐⰃ ⰕⰘⰅ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰅⰘⰒⰅⰓⰋⰅⰐⰜⰅⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰀⰕ ⰕⰂⰑ ⰏⰋⰓⰓⰑⰓⰋⰐⰃ ⰕⰂⰋⰜⰅ ⰋⰔ ⰕⰘⰅ ⰔⰅⰍⰖⰅⰐⰜⰅ
- ⰘⰅⰓⰅ ⰜⰀⰓⰓⰋⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰏⰅⰅⰕⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰑⰋⰐⰜⰀⰓⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰓⰋⰅⰏⰀⰐⰐ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰒⰂⰔⰐⰒ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰘⰑⰄⰃⰅ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰁⰔⰄ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰐⰀⰂⰋⰅⰓⰔⰕⰑⰍⰅⰔ
- ⰏⰋⰓⰓⰑⰓ ⰂⰀⰎⰍ ⰓⰅⰀⰜⰘⰅⰔ ⰉⰀⰐⰃⰏⰋⰎⰎⰔ
- ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰕⰘⰅ ⰏⰋⰓⰓⰑⰓ ⰋⰔ ⰂⰀⰎⰍⰋⰐⰃ ⰗⰓⰑⰏ ⰘⰅⰓⰅ ⰔⰘⰋⰗⰕⰅⰄ
- ⰓⰋⰅⰏⰀⰐⰐ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰋⰔ ⰀⰐ ⰋⰐⰂⰑⰎⰖⰕⰋⰑⰐ
- ⰓⰋⰅⰏⰀⰐⰐ ⰓⰅⰗⰎⰅⰜⰕⰋⰑⰐ ⰗⰋⰘⰅⰔ ⰅⰘⰀⰜⰕⰎⰉ ⰑⰐⰅ ⰘⰀⰎⰗ