Nuprl Lemma : fpf-compatible-self
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f:a:A fp-> B[a]]. f || f
Proof
Definitions occuring in Statement :
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf-compatible: f || g,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
prop: ℙ,
subtype_rel: A ⊆r B,
top: Top
Lemmas referenced :
fpf-ap_wf,
and_wf,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
fpf_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lambdaFormation,
sqequalHypSubstitution,
productElimination,
thin,
lemma_by_obid,
isectElimination,
hypothesisEquality,
sqequalRule,
lambdaEquality,
applyEquality,
independent_isectElimination,
hypothesis,
isect_memberEquality,
voidElimination,
voidEquality,
because_Cache,
dependent_functionElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
functionEquality,
cumulativity,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. f || f
Date html generated:
2018_05_21-PM-09_28_20
Last ObjectModification:
2018_02_09-AM-10_23_41
Theory : finite!partial!functions
Home
Index