{ 
[A,B:Type]. [eq1:EqDecider(A)]. [eq2:EqDecider(B)]. [L:(A 
B) List].
(fpf(L) 
a:A fp-> B List) }
{ Proof }
Definitions occuring in Statement :
pairs-fpf: fpf(L),
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
member: t T,
product: x:A B[x],
list: type List,
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
member: t T,
fpf: a:A fp-> B[a],
pairs-fpf: fpf(L),
top: Top,
all: x:A. B[x],
subtype: S 
T,
so_lambda: 
x.t[x],
so_apply: x[s],
prop: 
Lemmas :
remove-repeats_wf,
map_wf,
pi1_wf_top,
reduce_wf,
ifthenelse_wf,
eqof_wf,
insert_wf,
pi2_wf,
l_member_wf,
deq_wf
\mforall{}[A,B:Type]. \mforall{}[eq1:EqDecider(A)]. \mforall{}[eq2:EqDecider(B)]. \mforall{}[L:(A \mtimes{} B) List].
(fpf(L) \mmember{} a:A fp-> B List)
Date html generated:
2011_08_10-AM-08_11_28
Last ObjectModification:
2011_06_18-AM-08_26_53
Home
Index