Nuprl Lemma : fpf-join-list_wf
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[L:a:A fp-> B[a] List]. (⊕(L) ∈ a:A fp-> B[a])
Proof
Definitions occuring in Statement :
fpf-join-list: ⊕(L),
fpf: a:A fp-> B[a],
list: T List,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-join-list: ⊕(L),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[L:a:A fp-> B[a] List]. (\moplus{}(L) \mmember{} a:A fp-> B[a])
Date html generated:
2016_05_16-AM-11_12_25
Last ObjectModification:
2015_12_29-AM-09_18_20
Theory : event-ordering
Home
Index