Nuprl Lemma : ap_fpf_restrict_lemma
∀x,eq,P,f:Top. (fpf-restrict(f;P)(x) ~ f(x))
Proof
Definitions occuring in Statement :
fpf-restrict: fpf-restrict(f;P),
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-restrict: fpf-restrict(f;P),
fpf-ap: f(x),
mk_fpf: mk_fpf(L;f),
pi2: snd(t)
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}x,eq,P,f:Top. (fpf-restrict(f;P)(x) \msim{} f(x))
Date html generated:
2018_05_21-PM-09_31_13
Last ObjectModification:
2018_02_09-AM-10_25_37
Theory : finite!partial!functions
Home
Index