AFTD Auto-Formalizing Theoretical Domains

PFunctor.FreeM.liftM_seqRight

theoremverifiedformalizationimported Lean

PFunctor.FreeM.liftM_seqRight

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
variable [LawfulMonad m] in
@[simp]
lemma PFunctor.FreeM.liftM_seqRight {α β : Type uB}
    (interp : (a : P.A) → m (P.B a)) (x : P.FreeM α) (y : P.FreeM β) :
    (x *> y).liftM interp = x.liftM interp *> y.liftM interp
Formalizes
CSLib, `PFunctor.FreeM.liftM_seqRight`
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
Quot.soundpropext
Built on 6
Used by 3

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)) invariable [LawfulMonad m] in@[simp]lemma PFunctor.FreeM.liftM_seqRight {α β : Type uB}    (interp : (a : P.A) → m (P.B a)) (x : P.FreeM α) (y : P.FreeM β) :    (x *> y).liftM interp = x.liftM interp *> y.liftM interp := by  simp [seqRight_eq_bind]
See it in the graphDiscuss this resultChallenge it