Nuprl Lemma : I_set_pair_redex_lemma
∀I,G,F:Top. (<F, G>(I) ~ F I)
Proof
Definitions occuring in Statement :
I_set: A(I),
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,
I_set: A(I),
functor-ob: ob(F),
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{}I,G,F:Top. (<F, G>(I) \msim{} F I)
Date html generated:
2018_05_22-PM-09_58_33
Last ObjectModification:
2018_05_20-PM-09_41_26
Theory : presheaf!models!of!type!theory
Home
Index