The notation typeclass for inference systems.
This enables the notation ⇓a, where a : α is a derivable value.
- derivation (s : α) : Sort v
⇓ais a derivation ofa, that is, a witness thatais derivable. The meaning of this notation is type-dependent.
Instances
⇓a is a derivation of a, that is, a witness that a is derivable.
The meaning of this notation is type-dependent.
Equations
- One or more equations did not get rendered due to their size.
Instances For
def
Cslib.Logic.InferenceSystem.rwConclusion
{α : Type u_1}
[InferenceSystem α]
{Γ Δ : α}
(h : Γ = Δ)
(p : derivation Γ)
:
Rewrites the conclusion of a proof into an equal one.
Equations
Instances For
a is derivable if it is the conclusion of some derivation.
Equations
Instances For
theorem
Cslib.Logic.InferenceSystem.Derivable.fromDerivation
{α : Type u_1}
[InferenceSystem α]
{a : α}
(d : derivation a)
:
Shows derivability from a derivation.
@[implicit_reducible]
instance
Cslib.Logic.InferenceSystem.instCoeDerivationDerivable
{α : Type u_1}
[InferenceSystem α]
{a : α}
:
Coe (derivation a) (Derivable a)
Equations
noncomputable def
Cslib.Logic.InferenceSystem.Derivable.toDerivation
{α : Type u_1}
[InferenceSystem α]
{a : α}
(d : Derivable a)
:
Extracts (noncomputably) a derivation from the fact that a conclusion is derivable.
Equations
Instances For
@[implicit_reducible]
noncomputable instance
Cslib.Logic.InferenceSystem.instCoeDerivableDerivation
{α : Type u_1}
[InferenceSystem α]
{a : α}
:
Coe (Derivable a) (derivation a)