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