ⰅⰂⰅⰓⰉ ⰜⰖⰕ ⰑⰗ Ⰰ ⰎⰑⰑⰒ ⰜⰓⰑⰔⰔⰅⰔ ⰁⰑⰕⰘ ⰂⰀⰉⰔ
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
cuts.all (fun p => forth loop p && back loop p) = trueProof
By decide in consciousness.lean. Checked by the Lean kernel.
- Debit
every_cut_of_a_loop_crosses_both_ways— 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/consciousness.lean
- Typeset paper · src/research/lean-theorems.tex
- Repository deposit · doi:10.5281/zenodo.21787144
- Author · ORCID 0009-0000-7312-9778