Negation fixes exactly zero
NOT A NOVELTY CLAIM. This is a machine-checked formalisation, checked by the Lean 4 kernel and resting on no axiom beyond propext and Quot.sound. It is dated and citable. Prior art, where it exists, is cited below. No discovery is claimed.
Proposition
∀ x : Int, neg x = x ↔ x = 0Proof
By intro x; unfold neg in fallback.lean. Checked by the Lean kernel.
- Debit
negation_fixes_exactly_zero— this theorem- Credit
Quot.sound:∀ {α : Sort u_1} {r : α → α → Prop} {a b : α}, r a b → Quot.mk r a = Quot.mk r b— a quotient makes equal what its relation relates — the axiom behind function extensionalitypropext:∀ {a b : Prop}, (a ↔ b) → a = b— two propositions that imply each other are the same proposition
Sources and identifiers
- Lean source · src/pair/lean/proofs/fallback.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
- Invert is an involution
- Inversion swaps zero and infinity
- Dividing by zero is infinity
- Zero over zero is the fixed point that names nothing
- Inversion fixes exactly plus and minus one
- Negation is an involution
- A negative reflects to a positive
- The reflected root squares back
- A digit over zero falls back to its mirror