Nuprl Lemma : csm-equiv-fun
∀[s,f:Top]. ((equiv-fun(f))s ~ equiv-fun((f)s))
Proof
Definitions occuring in Statement :
equiv-fun: equiv-fun(f),
csm-ap-term: (t)s,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
csm-ap-term: (t)s,
equiv-fun: equiv-fun(f),
cubical-fst: p.1,
uall: ∀[x:A]. B[x],
member: t ∈ T
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
sqequalAxiom,
extract_by_obid,
hypothesis,
sqequalHypSubstitution,
isect_memberEquality,
isectElimination,
thin,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[s,f:Top]. ((equiv-fun(f))s \msim{} equiv-fun((f)s))
Date html generated:
2018_05_23-AM-09_43_10
Last ObjectModification:
2018_05_20-PM-06_42_37
Theory : cubical!type!theory
Home
Index