Nuprl Lemma : csm_typedp_id_adjoin_lemma
∀E,s,F,G,u,H:Top. ((((E)s)tp{i:l})[u] ~ (E)s)
Proof
Definitions occuring in Statement :
csm-id-adjoin: [u],
typed-cc-fst: tp{i:l},
csm-ap-type: (AF)s,
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
csm-ap-type: (AF)s,
pscm-ap-type: (AF)s,
csm-ap: (s)x,
pscm-ap: (s)x,
typed-cc-fst: tp{i:l},
typed-psc-fst: tp{i:l},
cc-fst: p,
psc-fst: p,
csm-id-adjoin: [u],
pscm-id-adjoin: [u],
csm-adjoin: (s;u),
pscm-adjoin: (s;u),
csm-id: 1(X),
pscm-id: 1(X)
Lemmas referenced :
ps-csm_typedp_id_adjoin_lemma
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalRule,
sqequalReflexivity,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
hypothesis
Latex:
\mforall{}E,s,F,G,u,H:Top. ((((E)s)tp\{i:l\})[u] \msim{} (E)s)
Date html generated:
2018_05_23-AM-09_17_47
Last ObjectModification:
2018_05_20-PM-06_16_35
Theory : cubical!type!theory
Home
Index