Nuprl Lemma : arrow_pair_lemma
∀y,x:Top. (arrow(<x, y>) ~ y)
Proof
Definitions occuring in Statement :
functor-arrow: arrow(F),
top: Top,
all: ∀x:A. B[x],
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
functor-arrow: arrow(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{}y,x:Top. (arrow(<x, y>) \msim{} y)
Date html generated:
2017_01_19-PM-02_52_21
Last ObjectModification:
2017_01_13-PM-01_21_16
Theory : small!categories
Home
Index