AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.CLL.Proposition.equiv

defimported Lean

Two propositions are equivalent if one implies the other and vice versa. Proof-relevant version.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib.Logic Cslib.Logic.InferenceSystem in
def Cslib.Logic.CLL.Proposition.equiv (a b : Proposition Atom)
Defined in
CSLib, `Cslib.Logic.CLL.Proposition.equiv`
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
none listed
Built on 17

Lean source view module on GitHub

set_option quotPrecheck false
open Cslib Cslib.Logic Cslib.Logic.CLL
@[inherit_doc] local postfix:max "⫠" => Proposition.dual
open Cslib Cslib.Logic Cslib.Logic.InferenceSystem
@[inherit_doc] local notation S:90 "⇓" a:90 => InferenceSystem.derivation S a
open Cslib Cslib.Logic Cslib.Logic.InferenceSystem
@[inherit_doc] local notation "⇓" a:90 => InferenceSystem.derivation Default a

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib.Logic Cslib.Logic.InferenceSystem in
/-- Two propositions are equivalent if one implies the other and vice versa. Proof-relevant version. -/
def Cslib.Logic.CLL.Proposition.equiv (a b : Proposition Atom) :=
  ⇓({a⫠, b} : Sequent Atom) × ⇓({b⫠, a} : Sequent Atom)
See it in the graphDiscuss this resultChallenge it