Nuprl Lemma : pscm-presheaf-pair
∀[u,v,s:Top]. ((presheaf-pair(u;v))s ~ presheaf-pair((u)s;(v)s))
Proof
Definitions occuring in Statement :
presheaf-pair: presheaf-pair(u;v),
pscm-ap-term: (t)s,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
presheaf-pair: presheaf-pair(u;v),
pscm-ap-term: (t)s,
pscm-ap: (s)x,
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{}[u,v,s:Top]. ((presheaf-pair(u;v))s \msim{} presheaf-pair((u)s;(v)s))
Date html generated:
2018_05_23-AM-08_21_28
Last ObjectModification:
2018_05_20-PM-10_01_23
Theory : presheaf!models!of!type!theory
Home
Index