Nuprl Lemma : csm-universe-decode
∀[t,s:Top]. ((decode(t))s ~ decode((t)s))
Proof
Definitions occuring in Statement :
universe-decode: decode(t),
csm-ap-term: (t)s,
csm-ap-type: (AF)s,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
universe-decode: decode(t),
csm-ap-term: (t)s,
cubical-term-at: u(a),
csm-ap-type: (AF)s,
csm-ap: (s)x,
uall: ∀[x:A]. B[x],
member: t ∈ T
Lemmas referenced :
istype-top
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation_alt,
introduction,
cut,
axiomSqEquality,
inhabitedIsType,
hypothesisEquality,
sqequalHypSubstitution,
isect_memberEquality_alt,
isectElimination,
thin,
isectIsTypeImplies,
extract_by_obid,
hypothesis
Latex:
\mforall{}[t,s:Top]. ((decode(t))s \msim{} decode((t)s))
Date html generated:
2020_05_20-PM-07_11_01
Last ObjectModification:
2020_04_25-PM-09_05_11
Theory : cubical!type!theory
Home
Index