Cslib.Logic.CLL.Proposition.Context.fill
defimported Lean
Replaces the hole in a propositional context with a propositions.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in @[simp] def Cslib.Logic.CLL.Proposition.Context.fill (c : Context Atom) (a : Proposition Atom) : Proposition Atom
- Defined in
- CSLib, `Cslib.Logic.CLL.Proposition.Context.fill`
- 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.Cslib.Logic.CLL.Proposition.Context.fill← Cslib.Logic.CLL.Proposition.Context.fill (Cslib/Logics/LinearLogic/CLL/Basic.lean:85): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 6
- Cslib.Logic.CLL.instBotPropositionCslib.Logic.CLL.instBotProposition
- Cslib.Logic.CLL.Proposition.ContextPropositional contexts (single-hole contexts for propositions).
- Cslib.Logic.CLL.PropositionPropositions.
- Cslib.Logic.CLL.instZeroPropositionCslib.Logic.CLL.instZeroProposition
- Cslib.Logic.CLL.instOnePropositionCslib.Logic.CLL.instOneProposition
- Cslib.Logic.CLL.instTopPropositionCslib.Logic.CLL.instTopProposition
- Used by 4
- Cslib.Logic.LogicalEquivalenceA logical equivalence
eqvfor an inference systemSis a congruence on propositions (of typeα) that preserves validity of… - Cslib.Logic.CLL.instHasContextPropositionCslib.Logic.CLL.instHasContextProposition
- Cslib.Logic.CLL.Proposition.context_fill_defDefinition of context filling.
- Cslib.LawfulCongruenceAn equivalence relation on
αpreserved by all contexts.
- Cslib.Logic.LogicalEquivalenceA logical equivalence
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in /-- Replaces the hole in a propositional context with a propositions. -/ @[simp] def Cslib.Logic.CLL.Proposition.Context.fill (c : Context Atom) (a : Proposition Atom) : Proposition Atom := match c with | hole => a | tensorL c b => .tensor (c.fill a) b | tensorR b c => .tensor b (c.fill a) | parrL c b => .parr (c.fill a) b | parrR b c => .parr b (c.fill a) | oplusL c b => .oplus (c.fill a) b | oplusR b c => .oplus b (c.fill a) | withL c b => .with (c.fill a) b | withR b c => .with b (c.fill a) | bang c => .bang (c.fill a) | quest c => .quest (c.fill a)