AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.CLL.Proof.parrInversion

defimported Lean

Inversion of the ⅋ rule.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib.Logic Cslib.Logic.InferenceSystem in
def Cslib.Logic.CLL.Proof.parrInversion {Γ : Sequent Atom} (h : ⇓((a ⅋ b) ::ₘ Γ)) : ⇓(a ::ₘ b ::ₘ Γ)
Defined in
CSLib, `Cslib.Logic.CLL.Proof.parrInversion`
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 20

Lean source view module on GitHub

set_option quotPrecheck false
open Cslib Cslib.Logic 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 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
/-- Inversion of the ⅋ rule. -/
def Cslib.Logic.CLL.Proof.parrInversion {Γ : Sequent Atom} (h : ⇓((a ⅋ b) ::ₘ Γ)) : ⇓(a ::ₘ b ::ₘ Γ) :=
  show a ::ₘ b ::ₘ Γ = {a, b} + Γ by simp ▸
    cut' (show ({a, b} : Sequent Atom) = {a} + {b} by simp ▸ tensor ax' ax') h
See it in the graphDiscuss this resultChallenge it