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