Cslib.Logic.CLL.Proposition.dual_neq
theoremverifiedformalizationimported Lean
No proposition is equal to its dual.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[scoped grind .] theorem Cslib.Logic.CLL.Proposition.dual_neq (a : Proposition Atom) : a ≠ a⫠
- Formalizes
- CSLib, `Cslib.Logic.CLL.Proposition.dual_neq`
- 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_neq← Cslib.Logic.CLL.Proposition.dual_neq (Cslib/Logics/LinearLogic/CLL/Basic.lean:152): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- 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.
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/-- No proposition is equal to its dual. -/@[scoped grind .]theorem Cslib.Logic.CLL.Proposition.dual_neq (a : Proposition Atom) : a ≠ a⫠ := by cases a <;> simp [Proposition.dual]