Cslib.Logic.CLL.instHasInferenceSystemSequent
instanceimported Lean
Cslib.Logic.CLL.instHasInferenceSystemSequent
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic Cslib.Logic.InferenceSystem in instance Cslib.Logic.CLL.instHasInferenceSystemSequent : HasInferenceSystem (Sequent Atom)
- Defined in
- CSLib, `Cslib.Logic.CLL.instHasInferenceSystemSequent`
- 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.instHasInferenceSystemSequent← @Cslib/Logics/LinearLogic/CLL/Basic.lean:209 (Cslib/Logics/LinearLogic/CLL/Basic.lean:209): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 16
- 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.ProofA proof in the sequent calculus for classical linear logic.
- Cslib.Logic.HasInferenceSystemClass for types (
α) that have a canonical inference system. - Cslib.Logic.CLL.SequentA sequent in CLL is a multiset of propositions.
- Cslib.Logic.InferenceSystemThe notation typeclass for inference systems. This enables the notation
S⇓a, whereSis a tag for the inference system anda : αis… - Cslib.Logic.InferenceSystem.DefaultDefault tag for inference system instances.
⇓ais short forDefault⇓a. - Cslib.Logic.CLL.instZeroPropositionCslib.Logic.CLL.instZeroProposition
- Cslib.Logic.CLL.instOnePropositionCslib.Logic.CLL.instOneProposition
- Cslib.Logic.CLL.instTopPropositionCslib.Logic.CLL.instTopProposition
- Cslib.Logic.CLL.instBotPropositionCslib.Logic.CLL.instBotProposition
- 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
- Used by 6
- 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.Proposition.equivTwo propositions are equivalent if one implies the other and vice versa. Proof-relevant version.
- Cslib.Logic.CLL.Proof.rwConclusionConvenience definition for rewriting conclusions in proofs.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic Cslib.Logic.InferenceSystem in instance Cslib.Logic.CLL.instHasInferenceSystemSequent : HasInferenceSystem (Sequent Atom) := ⟨Proof⟩