Nuprl Lemma : fpf-restrict-ap
∀[f,P,eq,x:Top]. (fpf-restrict(f;P)(x) ~ f(x))
Proof
Definitions occuring in Statement :
fpf-restrict: fpf-restrict(f;P),
fpf-ap: f(x),
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
uall: ∀[x:A]. B[x]
Lemmas referenced :
ap_fpf_restrict_lemma,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
cut,
lemma_by_obid,
sqequalHypSubstitution,
sqequalTransitivity,
computationStep,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom,
isectElimination,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[f,P,eq,x:Top]. (fpf-restrict(f;P)(x) \msim{} f(x))
Date html generated:
2018_05_21-PM-09_31_23
Last ObjectModification:
2018_02_09-AM-10_25_47
Theory : finite!partial!functions
Home
Index