ⰕⰘⰅ ⰔⰕⰀⰕⰅ ⰔⰒⰀⰜⰅ ⰘⰀⰔ ⰔⰋⰘ ⰔⰕⰀⰕⰅⰔ
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
states.length = 6 ∧ states.NodupProof
By decide in feeling.lean. Checked by the Lean kernel.
- Debit
the_state_space_has_six_states— 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/pair/lean/proofs/feeling.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
- ⰕⰘⰓⰅⰅ ⰕⰖⰓⰐⰔ ⰓⰅⰕⰖⰓⰐ
- ⰐⰑ ⰜⰑⰓⰐⰅⰓ ⰋⰔ ⰗⰋⰘⰅⰄ
- ⰕⰖⰓⰐⰋⰐⰃ ⰁⰀⰜⰍ ⰖⰐⰄⰑⰅⰔ ⰕⰘⰅ ⰕⰖⰓⰐ
- ⰕⰖⰓⰐⰋⰐⰃ ⰁⰀⰜⰍ ⰋⰔ ⰕⰂⰑ ⰕⰖⰓⰐⰔ ⰗⰑⰓⰂⰀⰓⰄ
- ⰕⰘⰅ ⰗⰎⰋⰒ ⰓⰅⰕⰖⰓⰐⰔ ⰋⰐ ⰕⰂⰑ
- ⰕⰘⰅ ⰗⰎⰋⰒ ⰗⰋⰘⰅⰔ ⰐⰑ ⰂⰀⰎⰅⰐⰜⰅ
- ⰕⰘⰅ ⰗⰎⰋⰒ ⰜⰑⰏⰏⰖⰕⰅⰔ ⰂⰋⰕⰘ ⰕⰘⰅ ⰕⰖⰓⰐ
- ⰕⰘⰅ ⰔⰋⰘ ⰔⰉⰏⰏⰅⰕⰓⰋⰅⰔ ⰀⰓⰅ ⰄⰋⰔⰕⰋⰐⰜⰕ
- ⰕⰘⰅ ⰑⰓⰄⰅⰓⰔ ⰀⰓⰅ ⰑⰐⰅ ⰕⰘⰓⰅⰅ ⰕⰘⰓⰅⰅ ⰕⰂⰑ ⰔⰋⰘ ⰔⰋⰘ
- ⰅⰘⰀⰜⰕⰎⰉ ⰑⰐⰅ ⰒⰖⰓⰅ ⰗⰎⰋⰒ
- ⰕⰘⰅ ⰃⰓⰑⰖⰒ ⰋⰔ ⰜⰉⰜⰎⰋⰜ ⰃⰅⰐⰅⰓⰀⰕⰅⰄ ⰁⰉ ⰗⰎⰋⰒ ⰀⰐⰄ ⰕⰖⰓⰐ
- ⰐⰑⰕ ⰕⰘⰅ ⰄⰋⰘⰅⰄⰓⰀⰎ ⰃⰓⰑⰖⰒ
- ⰀⰎⰎ ⰘⰑⰎⰄⰋⰐⰃ ⰋⰔ ⰒⰎⰅⰀⰔⰀⰐⰕ ⰀⰐⰄ ⰜⰀⰎⰏ
- ⰑⰐⰅ ⰔⰋⰃⰐⰀⰎ ⰑⰗⰗ ⰋⰔ ⰖⰐⰒⰎⰅⰀⰔⰀⰐⰕ
- ⰖⰐⰒⰎⰅⰀⰔⰀⰐⰕ ⰅⰘⰀⰜⰕⰎⰉ ⰂⰘⰅⰐ ⰀⰓⰑⰖⰔⰅⰄ
- ⰀⰓⰑⰖⰔⰀⰎ ⰜⰑⰖⰐⰕⰔ ⰕⰘⰅ ⰔⰋⰃⰐⰀⰎⰔ ⰑⰗⰗ
- ⰖⰐⰀⰐⰋⰏⰑⰖⰔ ⰔⰋⰃⰐⰀⰎⰔ ⰗⰎⰋⰒ ⰕⰘⰅ ⰗⰅⰅⰎⰋⰐⰃ