Nuprl Lemma : csm_comp_fst_adjoin_set_lemma
∀y,x,K,s,X,B,A:Top. ((s o p)(x;y) ~ (s)x)
Proof
Definitions occuring in Statement :
psc-fst: p,
psc-adjoin-set: (v;u),
pscm-comp: G o F,
pscm-ap: (s)x,
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
pscm-ap: (s)x,
psc-adjoin-set: (v;u),
psc-fst: p,
pscm-comp: G o F,
compose: f o g,
pi1: fst(t),
all: ∀x:A. B[x],
member: t ∈ T
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
lambdaFormation,
cut,
introduction,
extract_by_obid,
hypothesis
Latex:
\mforall{}y,x,K,s,X,B,A:Top. ((s o p)(x;y) \msim{} (s)x)
Date html generated:
2018_05_23-AM-08_11_36
Last ObjectModification:
2018_05_20-PM-09_50_20
Theory : presheaf!models!of!type!theory
Home
Index