AFTD Auto-Formalizing Theoretical Domains

Cslib.FreeM.liftBind_eq

theoremverifiedformalizationimported Lean

Cslib.FreeM.liftBind_eq

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v w w' w'' in
variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in
@[simp]
lemma Cslib.FreeM.liftBind_eq (op : F ι) :
    liftBind op cont = (lift op : FreeM F ι).bind cont
Formalizes
CSLib, `Cslib.FreeM.liftBind_eq`
Lean proof
By Tanner Duve, Eric Wieser, 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
none — Lean reports it depends on no axioms
Built on 7
Used by 74

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
universe u v w w' w'' in
variable {F : Type u → Type v} {ι : Type u} {α : Type w} {β : Type w'} {γ : Type w''} in
@[simp]
lemma Cslib.FreeM.liftBind_eq (op : F ι) :
    liftBind op cont = (lift op : FreeM F ι).bind cont :=
  rfl
See it in the graphDiscuss this resultChallenge it