AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 10
Used by 11

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it