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