{ 
[A:Type]. [B:A 
Type]. [f:a:A fp-> B[a]]. [eq:EqDecider(A)].
(
f = f) }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-empty: ,
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
so_apply: x[s],
function: x:A B[x],
universe: Type,
equal: s = t,
deq: EqDecider(T)
Definitions :
member: t 
T,
uall: [x:A]. B[x],
fpf: a:A fp-> B[a],
so_apply: x[s],
fpf-join: f g,
fpf-empty: ,
append: as @ bs,
pi1: fst(t),
bnot: 
b,
fpf-dom: x dom(f),
fpf-cap: f(x)?z,
deq-member: deq-member(eq;x;L),
ifthenelse: if b then t else f fi ,
reduce: reduce(f;k;as),
bfalse: ff,
so_lambda: 
x.t[x],
all: x:A. B[x],
filter: filter(P;l),
btrue: tt,
prop: 
Lemmas :
l_member_wf,
deq_wf,
fpf_wf
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. \mforall{}[eq:EqDecider(A)]. (\motimes{} \moplus{} f = f)
Date html generated:
2011_08_10-AM-07_58_58
Last ObjectModification:
2011_06_18-AM-08_18_42
Home
Index