Cslib.Logic.CLL.Proposition.top_eq_zero_dual
theoremverifiedformalizationimported Lean
Cslib.Logic.CLL.Proposition.top_eq_zero_dual
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[scoped grind =] theorem Cslib.Logic.CLL.Proposition.top_eq_zero_dual : ⊤ = (0⫠ : Proposition Atom)
- Formalizes
- CSLib, `Cslib.Logic.CLL.Proposition.top_eq_zero_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.top_eq_zero_dual← Cslib.Logic.CLL.Proposition.top_eq_zero_dual (Cslib/Logics/LinearLogic/CLL/Basic.lean:143): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 9
- Cslib.Logic.CLL.PropositionPropositions.
- Cslib.Logic.CLL.instTopPropositionCslib.Logic.CLL.instTopProposition
- Cslib.Logic.CLL.Proposition.dualPropositional duality.
- Cslib.Logic.CLL.instZeroPropositionCslib.Logic.CLL.instZeroProposition
- Cslib.Logic.CLL.instOnePropositionCslib.Logic.CLL.instOneProposition
- 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
open Cslib.Logic.CLL @[inherit_doc] local postfix:max "⫠" => Proposition.dual set_option autoImplicit true in set_option relaxedAutoImplicit true in @[scoped grind =] theorem Cslib.Logic.CLL.Proposition.top_eq_zero_dual : ⊤ = (0⫠ : Proposition Atom) := rfl