Cslib.Logic.CLL.Proof.parrInversion
defimported Lean
Inversion of the ⅋ rule.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic Cslib.Logic.InferenceSystem in def Cslib.Logic.CLL.Proof.parrInversion {Γ : Sequent Atom} (h : ⇓((a ⅋ b) ::ₘ Γ)) : ⇓(a ::ₘ b ::ₘ Γ)
- Defined in
- CSLib, `Cslib.Logic.CLL.Proof.parrInversion`
- 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.parrInversion← Cslib.Logic.CLL.Proof.parrInversion (Cslib/Logics/LinearLogic/CLL/Basic.lean:227): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 20
- 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.instHasInferenceSystemSequentCslib.Logic.CLL.instHasInferenceSystemSequent
- Cslib.Logic.CLL.Proof.cut'Cut, but where the premises are reversed.
- Cslib.Logic.CLL.Proposition.dual_sizeOfDuality preserves size.
- 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.PropositionPropositions.
- 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.Proposition.dualPropositional duality.
- 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
Lean source view module on GitHub
set_option quotPrecheck false open Cslib Cslib.Logic 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 Cslib.Logic Cslib.Logic.InferenceSystem @[inherit_doc] local notation S:90 "⇓" a:90 => InferenceSystem.derivation S a open Cslib Cslib.Logic Cslib.Logic.InferenceSystem @[inherit_doc] local notation "⇓" a:90 => InferenceSystem.derivation Default a set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic Cslib.Logic.InferenceSystem in /-- Inversion of the ⅋ rule. -/ def Cslib.Logic.CLL.Proof.parrInversion {Γ : Sequent Atom} (h : ⇓((a ⅋ b) ::ₘ Γ)) : ⇓(a ::ₘ b ::ₘ Γ) := show a ::ₘ b ::ₘ Γ = {a, b} + Γ by simp ▸ cut' (show ({a, b} : Sequent Atom) = {a} + {b} by simp ▸ tensor ax' ax') h