Nuprl Lemma : map-map
∀[as,f,g:Top]. (map(g;map(f;as)) ~ map(g o f;as))
Proof
Definitions occuring in Statement :
map: map(f;as),
compose: f o g,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T
Lemmas referenced :
map_map,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
sqequalAxiom,
sqequalRule,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[as,f,g:Top]. (map(g;map(f;as)) \msim{} map(g o f;as))
Date html generated:
2016_05_14-AM-06_54_40
Last ObjectModification:
2015_12_26-PM-00_19_29
Theory : list_0
Home
Index