AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.CLL.Proof

inductiveimported Lean

A proof in the sequent calculus for classical linear logic.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib.Logic.CLL.Proposition in
inductive Cslib.Logic.CLL.Proof : Sequent Atom → Type u
Defined in
CSLib, `Cslib.Logic.CLL.Proof`
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.
What was changed in Cslib.Logic.CLL.Proof
--- Cslib/Logics/LinearLogic/CLL/Basic.lean:190 (Cslib.Logic.CLL.Proof)
+++ as compiled here
@@ -1,4 +1,5 @@
-open Proposition in
-/-- A proof in the sequent calculus for classical linear logic. -/
-inductive Proof : Sequent Atom → Type u where
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+open Cslib.Logic.CLL.Proposition in
+inductive Cslib.Logic.CLL.Proof : Sequent Atom → Type u where
   | ax : Proof {a, a⫠}
Verified
08 Oct 2026
Axioms
none listed
Built on 15
Used by 6

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
open Cslib.Logic.CLL
@[inherit_doc] local postfix:max "⫠" => Proposition.dual

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib.Logic.CLL.Proposition in
/-- A proof in the sequent calculus for classical linear logic. -/
inductive Cslib.Logic.CLL.Proof : Sequent Atom → Type u where
  | ax : Proof {a, a⫠}
  | cut : Proof (a ::ₘ Γ) → Proof (a⫠ ::ₘ Δ) → Proof (Γ + Δ)
  | one : Proof {1}
  | bot : Proof Γ → Proof (⊥ ::ₘ Γ)
  | parr : Proof (a ::ₘ b ::ₘ Γ) → Proof ((a ⅋ b) ::ₘ Γ)
  | tensor : Proof (a ::ₘ Γ) → Proof (b ::ₘ Δ) → Proof ((a ⊗ b) ::ₘ (Γ + Δ))
  | oplus₁ : Proof (a ::ₘ Γ) → Proof ((a ⊕ b) ::ₘ Γ)
  | oplus₂ : Proof (b ::ₘ Γ) → Proof ((a ⊕ b) ::ₘ Γ)
  | with : Proof (a ::ₘ Γ) → Proof (b ::ₘ Γ) → Proof ((a & b) ::ₘ Γ)
  | top : Proof (⊤ ::ₘ Γ)
  | quest : Proof (a ::ₘ Γ) → Proof (ʔa ::ₘ Γ)
  | weaken : Proof Γ → Proof (ʔa ::ₘ Γ)
  | contract : Proof (ʔa ::ₘ ʔa ::ₘ Γ) → Proof (ʔa ::ₘ Γ)
  | bang {Γ : Sequent Atom} {a} : Γ.allQuest → Proof (a ::ₘ Γ) → Proof ((!a) ::ₘ Γ)
  -- No rule for zero.
See it in the graphDiscuss this resultChallenge it