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