{ 
[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],
uall: [x:A]. B[x],
so_apply: x[s],
member: t T,
function: x:A B[x],
list: type List,
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
so_apply: x[s],
member: t T,
fpf-join-list: (L),
so_lambda: 
x.t[x]
Lemmas :
reduce_wf,
fpf_wf,
fpf-join_wf,
fpf-empty_wf,
deq_wf
\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:
2011_08_10-AM-08_00_50
Last ObjectModification:
2011_06_18-AM-08_19_40
Home
Index