AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.CLL.Sequent.allQuest

defimported Lean

Checks that all propositions in a sequent Γ are question marks.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
def Cslib.Logic.CLL.Sequent.allQuest (Γ : Sequent Atom)
Defined in
CSLib, `Cslib.Logic.CLL.Sequent.allQuest`
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 12
Used by 1

Lean source view module on GitHub

open Cslib.Logic.CLL
@[inherit_doc] local infix:35 " ⊗ " => Proposition.tensor
@[inherit_doc] local infix:35 " ⊕ " => Proposition.oplus
@[inherit_doc] local infix:30 " ⅋ " => Proposition.parr
@[inherit_doc] local infix:30 " & " => Proposition.with
@[inherit_doc] local prefix:95 "!" => Proposition.bang
@[inherit_doc] local prefix:95 "ʔ" => Proposition.quest

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- Checks that all propositions in a sequent `Γ` are question marks. -/
def Cslib.Logic.CLL.Sequent.allQuest (Γ : Sequent Atom) :=
  Γ.map (· matches ʔ_)
  |> Multiset.fold Bool.and true
See it in the graphDiscuss this resultChallenge it