Nuprl Lemma : fpf_ap_single_lemma
∀y,eq,v,x:Top. (x : v(y) ~ v)
Proof
Definitions occuring in Statement :
fpf-single: x : v,
fpf-ap: f(x),
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
fpf-single: x : v,
fpf-ap: f(x),
pi2: snd(t)
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}y,eq,v,x:Top. (x : v(y) \msim{} v)
Date html generated:
2018_05_21-PM-09_25_04
Last ObjectModification:
2018_02_09-AM-10_20_50
Theory : finite!partial!functions
Home
Index