Nuprl Lemma : monad-unit_wf
∀[C:SmallCategory]. ∀[M:Monad(C)]. ∀[x:cat-ob(C)]. (monad-unit(M;x) ∈ cat-arrow(C) x M(x))
Proof
Definitions occuring in Statement :
monad-unit: monad-unit(M;x),
monad-fun: M(x),
cat-monad: Monad(C),
cat-arrow: cat-arrow(C),
cat-ob: cat-ob(C),
small-category: SmallCategory,
uall: ∀[x:A]. B[x],
member: t ∈ T,
apply: f a
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
monad-unit: monad-unit(M;x),
cat-monad: Monad(C),
nat-trans: nat-trans(C;D;F;G),
monad-fun: M(x),
pi2: snd(t),
pi1: fst(t),
monad-functor: monad-functor(M),
id_functor: 1,
all: ∀x:A. B[x],
top: Top,
so_lambda: so_lambda3,
so_apply: x[s1;s2;s3],
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
ob_mk_functor_lemma,
arrow_mk_functor_lemma,
cat-ob_wf,
cat-monad_wf,
small-category_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
sqequalHypSubstitution,
setElimination,
thin,
rename,
productElimination,
extract_by_obid,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
applyEquality,
functionExtensionality,
hypothesisEquality,
isectElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
because_Cache
Latex:
\mforall{}[C:SmallCategory]. \mforall{}[M:Monad(C)]. \mforall{}[x:cat-ob(C)]. (monad-unit(M;x) \mmember{} cat-arrow(C) x M(x))
Date html generated:
2020_05_20-AM-07_58_49
Last ObjectModification:
2017_01_17-AM-11_46_50
Theory : small!categories
Home
Index