Nuprl Lemma : presheaf_type_ap_morph_pair_lemma
∀u,a,f,J,I,G,F:Top. ((u a f) ~ G I J f a u)
Proof
Definitions occuring in Statement :
presheaf-type-ap-morph: (u a f),
top: Top,
all: ∀x:A. B[x],
apply: f a,
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
presheaf-type-ap-morph: (u a f),
pi2: snd(t)
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
introduction,
extract_by_obid,
sqequalRule
Latex:
\mforall{}u,a,f,J,I,G,F:Top. ((u a f) \msim{} G I J f a u)
Date html generated:
2018_05_22-PM-10_02_50
Last ObjectModification:
2018_05_20-PM-09_47_04
Theory : presheaf!models!of!type!theory
Home
Index