Cslib.Logic.CLL.Proof.rwConclusion
defimported Lean
Convenience definition for rewriting conclusions in proofs.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Cslib.Logic Cslib.Logic.InferenceSystem in @[grind =] def Cslib.Logic.CLL.Proof.rwConclusion {Γ Δ : Sequent Atom} (h : Γ = Δ) (p : ⇓Γ)
- Defined in
- CSLib, `Cslib.Logic.CLL.Proof.rwConclusion`
- 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.rwConclusion← Cslib.Logic.CLL.Proof.rwConclusion (Cslib/Logics/LinearLogic/CLL/Basic.lean:213): adapted
What was changed in
Cslib.Logic.CLL.Proof.rwConclusion--- Cslib/Logics/LinearLogic/CLL/Basic.lean:213 (Cslib.Logic.CLL.Proof.rwConclusion) +++ as compiled here @@ -1,3 +1,5 @@ -/-- Convenience definition for rewriting conclusions in proofs. -/ -@[scoped grind =] -def Proof.rwConclusion {Γ Δ : Sequent Atom} (h : Γ = Δ) (p : ⇓Γ) := InferenceSystem.rwConclusion h p +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open Cslib.Logic Cslib.Logic.InferenceSystem in +@[grind =] +def Cslib.Logic.CLL.Proof.rwConclusion {Γ Δ : Sequent Atom} (h : Γ = Δ) (p : ⇓Γ) := InferenceSystem.rwConclusion h p - Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 17
- 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.Proposition.dual_sizeOfDuality preserves size.
- Cslib.Logic.CLL.ProofA proof in the sequent calculus for classical linear logic.
- Cslib.Logic.InferenceSystem.rwConclusionRewrites the conclusion of a proof into an equal one.
- 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
Lean source view module on GitHub
set_option quotPrecheck false 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 /-- Convenience definition for rewriting conclusions in proofs. -/ @[grind =] def Cslib.Logic.CLL.Proof.rwConclusion {Γ Δ : Sequent Atom} (h : Γ = Δ) (p : ⇓Γ) := InferenceSystem.rwConclusion h p