AFTD Auto-Formalizing Theoretical Domains

Cslib.Logic.InferenceSystem.rwConclusion

defimported Lean

Rewrites the conclusion of a proof into an equal one.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
@[grind =]
def Cslib.Logic.InferenceSystem.rwConclusion [InferenceSystem S α] {Γ Δ : α} (h : Γ = Δ) (p : S⇓Γ) : S⇓Δ
Defined in
CSLib, `Cslib.Logic.InferenceSystem.rwConclusion`
Lean proof
By Fabrizio Montesi, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 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.InferenceSystem.rwConclusion
--- Cslib/Foundations/Logic/InferenceSystem.lean:49 (Cslib.Logic.InferenceSystem.rwConclusion)
+++ as compiled here
@@ -1,4 +1,5 @@
-/-- Rewrites the conclusion of a proof into an equal one. -/
-@[scoped grind =]
-def rwConclusion [InferenceSystem S α] {Γ Δ : α} (h : Γ = Δ) (p : S⇓Γ) : S⇓Δ :=
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+@[grind =]
+def Cslib.Logic.InferenceSystem.rwConclusion [InferenceSystem S α] {Γ Δ : α} (h : Γ = Δ) (p : S⇓Γ) : S⇓Δ :=
   h ▸ p
Verified
08 Oct 2026
Axioms
none listed
Built on 1
  • Cslib.Logic.InferenceSystemThe notation typeclass for inference systems. This enables the notation S⇓a, where S is a tag for the inference system and a : α is…
Used by 1

Lean source view module on GitHub

set_option quotPrecheck false
open Cslib Cslib.Logic Cslib.Logic.InferenceSystem
@[inherit_doc] local notation S:90 "⇓" a:90 => InferenceSystem.derivation S a

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- Rewrites the conclusion of a proof into an equal one. -/
@[grind =]
def Cslib.Logic.InferenceSystem.rwConclusion [InferenceSystem S α] {Γ Δ : α} (h : Γ = Δ) (p : S⇓Γ) : S⇓Δ :=
  h ▸ p
See it in the graphDiscuss this resultChallenge it