Nuprl Lemma : mk_fpf_wf
∀[A:Type]. ∀[L:A List]. ∀[B:A ⟶ Type]. ∀[f:a:{a:A| (a ∈ L)} ⟶ B[a]]. (mk_fpf(L;f) ∈ a:A fp-> B[a])
Proof
Definitions occuring in Statement :
mk_fpf: mk_fpf(L;f),
fpf: a:A fp-> B[a],
l_member: (x ∈ l),
list: T List,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
mk_fpf: mk_fpf(L;f),
fpf: a:A fp-> B[a],
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
so_apply: x[s]
Latex:
\mforall{}[A:Type]. \mforall{}[L:A List]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:\{a:A| (a \mmember{} L)\} {}\mrightarrow{} B[a]]. (mk\_fpf(L;f) \mmember{} a:A fp-> B[a\000C])
Date html generated:
2016_05_16-AM-11_16_11
Last ObjectModification:
2015_12_29-AM-09_20_51
Theory : event-ordering
Home
Index