Cslib.Logic.CLL.Proof
inductiveimported Lean
A proof in the sequent calculus for classical linear logic.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic.CLL.Proposition in inductive Cslib.Logic.CLL.Proof : Sequent Atom → Type u
- Defined in
- CSLib, `Cslib.Logic.CLL.Proof`
- 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.Proof← Cslib.Logic.CLL.Proof (Cslib/Logics/LinearLogic/CLL/Basic.lean:190): adapted
What was changed in
Cslib.Logic.CLL.Proof--- Cslib/Logics/LinearLogic/CLL/Basic.lean:190 (Cslib.Logic.CLL.Proof) +++ as compiled here @@ -1,4 +1,5 @@ -open Proposition in -/-- A proof in the sequent calculus for classical linear logic. -/ -inductive Proof : Sequent Atom → Type u where +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib.Logic.CLL.Proposition in +inductive Cslib.Logic.CLL.Proof : Sequent Atom → Type u where | ax : Proof {a, a⫠} - Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 15
- 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.Proposition.dual_sizeOfDuality preserves size.
- Cslib.Logic.CLL.SequentA sequent in CLL is a multiset of propositions.
- Cslib.Logic.CLL.PropositionPropositions.
- Cslib.Logic.CLL.Proposition.dualPropositional duality.
- Cslib.Logic.CLL.instOnePropositionCslib.Logic.CLL.instOneProposition
- Cslib.Logic.CLL.instBotPropositionCslib.Logic.CLL.instBotProposition
- Cslib.Logic.CLL.instTopPropositionCslib.Logic.CLL.instTopProposition
- Cslib.Logic.CLL.instZeroPropositionCslib.Logic.CLL.instZeroProposition
- Cslib.Logic.CLL.instHasContextPropositionCslib.Logic.CLL.instHasContextProposition
- Cslib.Logic.CLL.Proposition.positiveDecidableWhether a
Propositionis positive is decidable. - Cslib.Logic.CLL.Proposition.negativeDecidableWhether a
Propositionis negative is decidable. - Cslib.Logic.CLL.instHasHContextSequentPropositionCslib.Logic.CLL.instHasHContextSequentProposition
- Cslib.Logic.CLL.Sequent.allQuestChecks that all propositions in a sequent
- Used by 6
- Cslib.Logic.CLL.instHasInferenceSystemSequentCslib.Logic.CLL.instHasInferenceSystemSequent
- Cslib.Logic.CLL.Proof.botInversionInversion of the ⊥ rule.
- Cslib.Logic.CLL.Proof.cut'Cut, but where the premises are reversed.
- Cslib.Logic.CLL.Proof.ax'The axiom, but where the order of propositions is reversed.
- Cslib.Logic.CLL.Proof.parrInversionInversion of the ⅋ rule.
- Cslib.Logic.CLL.Proof.rwConclusionConvenience definition for rewriting conclusions in proofs.
Lean source view module on GitHub
open Cslib.Logic.CLL @[inherit_doc] local infix:35 " ⊗ " => Proposition.tensor @[inherit_doc] local infix:35 " ⊕ " => Proposition.oplus @[inherit_doc] local infix:30 " ⅋ " => Proposition.parr @[inherit_doc] local infix:30 " & " => Proposition.with @[inherit_doc] local prefix:95 "!" => Proposition.bang @[inherit_doc] local prefix:95 "ʔ" => Proposition.quest open Cslib.Logic.CLL @[inherit_doc] local postfix:max "⫠" => Proposition.dual set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic.CLL.Proposition in /-- A proof in the sequent calculus for classical linear logic. -/ inductive Cslib.Logic.CLL.Proof : Sequent Atom → Type u where | ax : Proof {a, a⫠} | cut : Proof (a ::ₘ Γ) → Proof (a⫠ ::ₘ Δ) → Proof (Γ + Δ) | one : Proof {1} | bot : Proof Γ → Proof (⊥ ::ₘ Γ) | parr : Proof (a ::ₘ b ::ₘ Γ) → Proof ((a ⅋ b) ::ₘ Γ) | tensor : Proof (a ::ₘ Γ) → Proof (b ::ₘ Δ) → Proof ((a ⊗ b) ::ₘ (Γ + Δ)) | oplus₁ : Proof (a ::ₘ Γ) → Proof ((a ⊕ b) ::ₘ Γ) | oplus₂ : Proof (b ::ₘ Γ) → Proof ((a ⊕ b) ::ₘ Γ) | with : Proof (a ::ₘ Γ) → Proof (b ::ₘ Γ) → Proof ((a & b) ::ₘ Γ) | top : Proof (⊤ ::ₘ Γ) | quest : Proof (a ::ₘ Γ) → Proof (ʔa ::ₘ Γ) | weaken : Proof Γ → Proof (ʔa ::ₘ Γ) | contract : Proof (ʔa ::ₘ ʔa ::ₘ Γ) → Proof (ʔa ::ₘ Γ) | bang {Γ : Sequent Atom} {a} : Γ.allQuest → Proof (a ::ₘ Γ) → Proof ((!a) ::ₘ Γ) -- No rule for zero.