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