PFunctor.FreeM.pure_ne_liftObj
theoremverifiedformalizationimported Lean
PFunctor.FreeM.pure_ne_liftObj
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in universe u v uA uB in variable {P : PFunctor.{uA, uB}} {α β γ : Type*} in @[simp] lemma PFunctor.FreeM.pure_ne_liftObj (x : P.Obj α) (y : α) : pure y ≠ (liftObj x : P.FreeM α)
- Formalizes
- CSLib, `PFunctor.FreeM.pure_ne_liftObj`
- 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.PFunctor.FreeM.pure_ne_liftObj← PFunctor.FreeM.pure_ne_liftObj (Cslib/Foundations/Data/PFunctor/Free.lean:148): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 10
- PFunctor.FreeM.pure_ne_liftPFunctor.FreeM.pure_ne_lift
- PFunctor.FreeM.liftObjLift an object of the base polynomial functor into the free monad. This lifts the shape
x.1withliftand relabels the responses with… - PFunctor.FreeM.liftObj_ne_purePFunctor.FreeM.liftObj_ne_pure
- PFunctor.FreeM.map_eq_mapNote that this lemma does not always apply, as it is universe-constrained by
Functor.map. - PFunctor.FreeM.liftBind_eqPFunctor.FreeM.liftBind_eq
- PFunctor.FreeM.lift_ne_purePFunctor.FreeM.lift_ne_pure
- PFunctor.FreeMThe free monad on a polynomial functor. This extends
WTypewith an extrapureconstructor. - PFunctor.FreeM.instPurePFunctor.FreeM.instPure
- PFunctor.FreeM.mapMap a function over a
FreeMcomputation. The builtin<$>notation should be preferred whenαandβare in the same universe. - PFunctor.FreeM.bind_pure_compPFunctor.FreeM.bind_pure_comp
- Used by 4
- PFunctor.FreeM.monadLift_eq_liftObjPFunctor.FreeM.monadLift_eq_liftObj
- PFunctor.FreeM.liftM_liftPFunctor.FreeM.liftM_lift
- PFunctor.FreeM.liftObj_bindPFunctor.FreeM.liftObj_bind
- PFunctor.FreeM.liftM_liftObjPFunctor.FreeM.liftM_liftObj
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true inuniverse u v uA uB invariable {P : PFunctor.{uA, uB}} {α β γ : Type*} in@[simp] lemma PFunctor.FreeM.pure_ne_liftObj (x : P.Obj α) (y : α) : pure y ≠ (liftObj x : P.FreeM α) := by simp [liftObj, lift, map, -liftBind_eq]