Nuprl Lemma : cc_snd_csm_id_adjoin_lemma
∀u,G:Top. ((q)[u] ~ (u)1(G))
Proof
Definitions occuring in Statement :
csm-id-adjoin: [u],
cc-snd: q,
csm-ap-term: (t)s,
csm-id: 1(X),
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
csm-ap-term: (t)s,
pscm-ap-term: (t)s,
cc-snd: q,
psc-snd: q,
csm-ap: (s)x,
pscm-ap: (s)x,
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-cc_snd_csm_id_adjoin_lemma
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalRule,
sqequalReflexivity,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
hypothesis
Latex:
\mforall{}u,G:Top. ((q)[u] \msim{} (u)1(G))
Date html generated:
2018_05_23-AM-08_51_00
Last ObjectModification:
2018_05_20-PM-06_00_11
Theory : cubical!type!theory
Home
Index