Cslib.Logic.PL.Proposition
inductiveimported Lean
Propositions.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u in variable {Atom : Type u} [DecidableEq Atom] in inductive Cslib.Logic.PL.Proposition (Atom : Type u) : Type u
- Defined in
- CSLib, `Cslib.Logic.PL.Proposition`
- 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.Cslib.Logic.PL.Proposition← Cslib.Logic.PL.Proposition (Cslib/Logics/Propositional/Defs.lean:49): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 8
- Cslib.Logic.PL.instTopPropositionCslib.Logic.PL.instTopProposition
- Cslib.Logic.PL.Proposition.negWe view negation as a defined connective ~A := A → ⊥
- Cslib.Logic.PL.instHasAndPropositionCslib.Logic.PL.instHasAndProposition
- Cslib.Logic.PL.instHasImpPropositionCslib.Logic.PL.instHasImpProposition
- Cslib.Logic.PL.Proposition.topA fixed choice of a derivable proposition (of course any two are equivalent).
- Cslib.Logic.PL.instBotPropositionCslib.Logic.PL.instBotProposition
- Cslib.Logic.PL.instHasNotPropositionOfBotCslib.Logic.PL.instHasNotPropositionOfBot
- Cslib.Logic.PL.instHasOrPropositionCslib.Logic.PL.instHasOrProposition
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 /-- Propositions. -/ inductive Cslib.Logic.PL.Proposition (Atom : Type u) : Type u where /-- Propositional atoms -/ | atom (x : Atom) /-- Conjunction -/ | and (a b : Proposition Atom) /-- Disjunction -/ | or (a b : Proposition Atom) /-- Implication -/ | imp (a b : Proposition Atom) deriving DecidableEq, BEq