Cslib.Logic.CLL.Proposition.dual
defimported Lean
Propositional duality.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[scoped grind =] def Cslib.Logic.CLL.Proposition.dual : Proposition Atom → Proposition Atom
- Defined in
- CSLib, `Cslib.Logic.CLL.Proposition.dual`
- 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← Cslib.Logic.CLL.Proposition.dual (Cslib/Logics/LinearLogic/CLL/Basic.lean:126): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 8
- Cslib.Logic.CLL.instBotPropositionCslib.Logic.CLL.instBotProposition
- Cslib.Logic.CLL.Proposition.positiveDecidableWhether a
Propositionis positive is decidable. - Cslib.Logic.CLL.PropositionPropositions.
- Cslib.Logic.CLL.instZeroPropositionCslib.Logic.CLL.instZeroProposition
- Cslib.Logic.CLL.instOnePropositionCslib.Logic.CLL.instOneProposition
- Cslib.Logic.CLL.instHasContextPropositionCslib.Logic.CLL.instHasContextProposition
- Cslib.Logic.CLL.instTopPropositionCslib.Logic.CLL.instTopProposition
- Cslib.Logic.CLL.Proposition.negativeDecidableWhether a
Propositionis negative is decidable.
- Used by 21
- 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.PhaseSpace.orth_iUnionGiven a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that (⋃ᵢ Gᵢ)⫠ = ⋂ᵢ Gᵢ⫠.
- Cslib.Logic.CLL.PhaseSpace.orthogonal_defCslib.Logic.CLL.PhaseSpace.orthogonal_def
- Cslib.Logic.CLL.PhaseSpace.biorthogonalClosureThe biorthogonal closure operator on sets in a phase space.
- Cslib.Logic.CLL.Proposition.dual_neqNo proposition is equal to its dual.
- Cslib.Logic.CLL.Proposition.linImplLinear implication.
- Cslib.Logic.CLL.Proposition.top_eq_zero_dualCslib.Logic.CLL.Proposition.top_eq_zero_dual
- Cslib.Logic.CLL.Proof.cut'Cut, but where the premises are reversed.
- Cslib.Logic.CLL.Proposition.dual_sizeOfDuality preserves size.
- Cslib.Logic.CLL.PhaseSpace.iInter_biorth_eq_orth_iUnion_orthGiven a phase space (P, ⊥) and a set of subsets (Gᵢ)_{i ∈ I} of P, we have that ∩ᵢ Gᵢ⫠⫠ = (∪ᵢ Gᵢ⫠)⫠.
- Cslib.Logic.CLL.Proof.ax'The axiom, but where the order of propositions is reversed.
- Cslib.Logic.CLL.PhaseSpace.triple_orthThe triple orthogonal equals the orthogonal: X⫠⫠⫠ = X⫠.
- Cslib.Logic.CLL.ProofA proof in the sequent calculus for classical linear logic.
- Cslib.Logic.CLL.PhaseSpace.isFactA fact is a subset of a phase space that equals its biorthogonal closure.
- Cslib.Logic.CLL.Proof.parrInversionInversion of the ⅋ rule.
- Cslib.Logic.CLL.PhaseSpace.subset_dual_dualCslib.Logic.CLL.PhaseSpace.subset_dual_dual
- Cslib.Logic.CLL.PhaseSpace.triple_dualCslib.Logic.CLL.PhaseSpace.triple_dual
- Cslib.Logic.CLL.Proposition.equivTwo propositions are equivalent if one implies the other and vice versa. Proof-relevant version.
- Cslib.Logic.CLL.PhaseSpace.orth_antitoneThe orthogonal operation is antitone: if X ⊆ Y then Y⫠ ⊆ X⫠.
- Cslib.Logic.CLL.PhaseSpace.orth_extensiveThe biorthogonal operation is extensive: X ⊆ X⫠⫠ for any set X.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Propositional duality. -/ @[scoped grind =] def Cslib.Logic.CLL.Proposition.dual : Proposition Atom → Proposition Atom | atom x => atomDual x | atomDual x => atom x | one => bot | bot => one | zero => top | top => zero | tensor a b => parr a.dual b.dual | parr a b => tensor a.dual b.dual | oplus a b => .with a.dual b.dual | .with a b => oplus a.dual b.dual | bang a => quest a.dual | quest a => bang a.dual