Cslib.Logic.CLL.Proposition
inductiveimported Lean
Propositions.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in inductive Cslib.Logic.CLL.Proposition (Atom : Type u) : Type u
- Defined in
- CSLib, `Cslib.Logic.CLL.Proposition`
- Lean proof
- By Fabrizio Montesi, from github.com/leanprover/cslib at
3951377e5a3f(Copyright (c) 2025 Fabrizio Montesi. 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.CLL.Proposition← Cslib.Logic.CLL.Proposition (Cslib/Logics/LinearLogic/CLL/Basic.lean:32): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 29
- Cslib.Logic.CLL.Sequent.allQuestChecks that all propositions in a sequent
Γare question marks. - Cslib.Logic.CLL.Proposition.dual_injTwo propositions are equal iff their respective duals are equal.
- Cslib.Logic.CLL.Proposition.dual_involutionDuality is an involution.
- Cslib.Logic.CLL.instBotPropositionCslib.Logic.CLL.instBotProposition
- Cslib.Logic.CLL.Proposition.ContextPropositional contexts (single-hole contexts for propositions).
- Cslib.Logic.CLL.Proposition.dualPropositional duality.
- Cslib.Logic.CLL.instHasHContextSequentPropositionCslib.Logic.CLL.instHasHContextSequentProposition
- Cslib.Logic.CLL.Proposition.positiveDecidableWhether a
Propositionis positive is decidable. - Cslib.Logic.CLL.Proposition.dual_neqNo proposition is equal to its dual.
- Cslib.Logic.CLL.Proposition.linImplLinear implication.
- Cslib.Logic.CLL.instZeroPropositionCslib.Logic.CLL.instZeroProposition
- Cslib.Logic.CLL.SequentA sequent in CLL is a multiset of propositions.
- Cslib.Logic.CLL.Proposition.top_eq_zero_dualCslib.Logic.CLL.Proposition.top_eq_zero_dual
- Cslib.Logic.CLL.Proof.botInversionInversion of the ⊥ rule.
- Cslib.Logic.CLL.Proof.cut'Cut, but where the premises are reversed.
- Cslib.Logic.CLL.Proposition.positivePositive propositions.
- Cslib.Logic.CLL.Proposition.dual_sizeOfDuality preserves size.
- Cslib.Logic.CLL.instOnePropositionCslib.Logic.CLL.instOneProposition
- Cslib.Logic.CLL.Sequent.Context.fillFilling a judgemental context returns a sequent.
- Cslib.Logic.CLL.instHasContextPropositionCslib.Logic.CLL.instHasContextProposition
- Cslib.Logic.CLL.Proposition.Context.fillReplaces the hole in a propositional context with a propositions.
- Cslib.Logic.CLL.Proposition.context_fill_defDefinition of context filling.
- Cslib.Logic.CLL.Proof.ax'The axiom, but where the order of propositions is reversed.
- Cslib.Logic.CLL.ProofA proof in the sequent calculus for classical linear logic.
- Cslib.Logic.CLL.Proof.parrInversionInversion of the ⅋ rule.
- Cslib.Logic.CLL.Proposition.negativeNegative propositions.
- Cslib.Logic.CLL.instTopPropositionCslib.Logic.CLL.instTopProposition
- Cslib.Logic.CLL.Proposition.equivTwo propositions are equivalent if one implies the other and vice versa. Proof-relevant version.
- Cslib.Logic.CLL.Proposition.negativeDecidableWhether a
Propositionis negative is decidable.
- Cslib.Logic.CLL.Sequent.allQuestChecks that all propositions in a sequent
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Propositions. -/ inductive Cslib.Logic.CLL.Proposition (Atom : Type u) : Type u where | atom (x : Atom) | atomDual (x : Atom) | one | zero | top | bot /-- The multiplicative conjunction connective. -/ | tensor (a b : Proposition Atom) /-- The multiplicative disjunction connective. -/ | parr (a b : Proposition Atom) /-- The additive disjunction connective. -/ | oplus (a b : Proposition Atom) /-- The additive conjunction connective. -/ | with (a b : Proposition Atom) /-- The "of course" exponential. -/ | bang (a : Proposition Atom) /-- The "why not" exponential. This is written as ʔ, or \_?, to distinguish itself from the lean syntatical hole ? syntax -/ | quest (a : Proposition Atom) deriving DecidableEq, BEq