Nuprl Lemma : ps-cc_snd_csm_id_adjoin_lemma
∀u,G:Top. ((q)[u] ~ (u)1(G))
Proof
Definitions occuring in Statement :
pscm-id-adjoin: [u],
psc-snd: q,
pscm-ap-term: (t)s,
pscm-id: 1(X),
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
pscm-id: 1(X),
pscm-ap-term: (t)s,
psc-snd: q,
pscm-id-adjoin: [u],
pscm-ap: (s)x,
pscm-adjoin: (s;u),
pi2: snd(t),
member: t ∈ T
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
sqequalRule,
cut,
introduction,
extract_by_obid,
hypothesis
Latex:
\mforall{}u,G:Top. ((q)[u] \msim{} (u)1(G))
Date html generated:
2018_05_23-AM-08_13_22
Last ObjectModification:
2018_05_20-PM-09_52_27
Theory : presheaf!models!of!type!theory
Home
Index