AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.liftM_lift_bind

theoremverifiedformalizationimported Lean

PFunctor.FreeM.liftM_lift_bind

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v uA uB in
variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in
variable {m : Type uB → Type v} {α : Type uB} in
variable [Monad m] (interp : (a : P.A) → m (P.B a)) in
@[simp]
lemma PFunctor.FreeM.liftM_lift_bind (a : P.A) (cont : P.B a → P.FreeM α) :
    FreeM.liftM interp (FreeM.lift a >>= cont) =
      (do let u ← interp a; (cont u).liftM interp)
Formalizes
CSLib, `PFunctor.FreeM.liftM_lift_bind`
Lean proof
By Quang Dao, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Quang Dao. 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 — Lean reports it depends on no axioms
Built on 13
Used by 11

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v uA uB invariable {P : PFunctor.{uA, uB}} {α β γ : Type*} invariable {m : Type uB → Type v} {α : Type uB} invariable [Monad m] (interp : (a : P.A) → m (P.B a)) in@[simp]lemma PFunctor.FreeM.liftM_lift_bind (a : P.A) (cont : P.B a → P.FreeM α) :    FreeM.liftM interp (FreeM.lift a >>= cont) =      (do let u ← interp a; (cont u).liftM interp) := by  dsimp only [FreeM.liftM, FreeM.bind, FreeM.lift]  rfl
See it in the graphDiscuss this resultChallenge it