AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.FreeCont.run_bind

theoremverifiedformalizationimported Lean

Cslib.FreeM.FreeCont.run_bind

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Cslib Cslib.FreeM Cslib.FreeM.FreeCont in
universe u v w w' w'' in
variable {r : Type u} {α : Type v} {β : Type w} in
@[simp]
lemma Cslib.FreeM.FreeCont.run_bind (x : FreeCont r α) (f : α → FreeCont r β) (k : β → r) :
    run (x.bind f) k = run x (fun i => run (f i) k)
Formalizes
CSLib, `Cslib.FreeM.FreeCont.run_bind`
Lean proof
By Tanner Duve, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2025 Tanner Duve. 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
Quot.soundpropext
Built on 50
Used by 10

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Cslib Cslib.FreeM Cslib.FreeM.FreeCont inuniverse u v w w' w'' invariable {r : Type u} {α : Type v} {β : Type w} in@[simp]lemma Cslib.FreeM.FreeCont.run_bind (x : FreeCont r α) (f : α → FreeCont r β) (k : β → r) :    run (x.bind f) k = run x (fun i => run (f i) k) := by  induction x using FreeM.induction generalizing k with  | pure a => rfl  | lift_bind op cont ih =>    rw [FreeM.bind_assoc]    cases op    simp [← liftBind_eq, run, ih]
See it in the graphDiscuss this resultChallenge it