Cslib.Logic.CLL.Proposition.dual_inj
theoremverifiedformalizationimported Lean
Two propositions are equal iff their respective duals are equal.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[simp] theorem Cslib.Logic.CLL.Proposition.dual_inj (a b : Proposition Atom) : a⫠ = b⫠ ↔ a = b
- Formalizes
- CSLib, `Cslib.Logic.CLL.Proposition.dual_inj`
- 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.dual_inj← Cslib.Logic.CLL.Proposition.dual_inj (Cslib/Logics/LinearLogic/CLL/Basic.lean:157): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 10
- Cslib.Logic.CLL.Proposition.dual_sizeOfDuality preserves size.
- Cslib.Logic.CLL.PropositionPropositions.
- 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.
- Used by 11
- Cslib.Logic.CLL.Sequent.allQuestChecks that all propositions in a sequent
Γare question marks. - Cslib.Logic.CLL.Proposition.dual_involutionDuality is an involution.
- Cslib.Logic.CLL.instHasInferenceSystemSequentCslib.Logic.CLL.instHasInferenceSystemSequent
- Cslib.Logic.CLL.Proposition.linImplLinear implication.
- 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.ProofA proof in the sequent calculus for classical linear logic.
- 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.
- Cslib.Logic.CLL.Sequent.allQuestChecks that all propositions in a sequent
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
open Cslib.Logic.CLL@[inherit_doc] local postfix:max "⫠" => Proposition.dualset_option autoImplicit true inset_option relaxedAutoImplicit true in/-- Two propositions are equal iff their respective duals are equal. -/@[simp]theorem Cslib.Logic.CLL.Proposition.dual_inj (a b : Proposition Atom) : a⫠ = b⫠ ↔ a = b := by refine ⟨fun h ↦ ?_, congrArg dual⟩ induction a generalizing b <;> cases b <;> grind