AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.PL.Proposition.neg

abbrevimported Lean

We view negation as a defined connective ~A := A → ⊥

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {Atom : Type u} [DecidableEq Atom] in
abbrev Cslib.Logic.PL.Proposition.neg [Bot Atom] : Proposition Atom → Proposition Atom
Defined in
CSLib, `Cslib.Logic.PL.Proposition.neg`
Lean proof
By Thomas Waring, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Thomas Waring. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 2
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u in
variable {Atom : Type u} [DecidableEq Atom] in
/-- We view negation as a defined connective ~A := A → ⊥ -/
abbrev Cslib.Logic.PL.Proposition.neg [Bot Atom] : Proposition Atom → Proposition Atom := (Proposition.imp · ⊥)
See it in the graphDiscuss this resultChallenge it