Nuprl Lemma : fpf-const_wf
∀[A,B:Type]. ∀[L:A List]. ∀[v:B]. (L |-fpf-> v ∈ a:A fp-> B)
Proof
Definitions occuring in Statement :
fpf-const: L |-fpf-> v,
fpf: a:A fp-> B[a],
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
fpf-const: L |-fpf-> v,
fpf: a:A fp-> B[a],
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ
Lemmas referenced :
l_member_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
dependent_pairEquality,
hypothesisEquality,
lambdaEquality,
setEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
functionEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[A,B:Type]. \mforall{}[L:A List]. \mforall{}[v:B]. (L |-fpf-> v \mmember{} a:A fp-> B)
Date html generated:
2018_05_21-PM-09_24_16
Last ObjectModification:
2018_02_09-AM-10_19_37
Theory : finite!partial!functions
Home
Index