{ 
[A:Type]. [B:A 
Type]. eq:EqDecider(A). f:a:A fp-> B[a] List. f 
f }
{ Proof }
Definitions occuring in Statement :
fpf-contains: f g,
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
so_apply: x[s],
all: x:A. B[x],
function: x:A B[x],
list: type List,
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
so_apply: x[s],
fpf-contains: f g,
implies: P 
Q,
cand: A c
B,
member: t 
T,
so_lambda: 
x.t[x],
prop: 
,
uimplies: b supposing a
Lemmas :
l_contains_weakening,
fpf-ap_wf,
assert_wf,
fpf-dom_wf,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}eq:EqDecider(A). \mforall{}f:a:A fp-> B[a] List. f \msubseteq{}\msubseteq{} f
Date html generated:
2011_08_10-AM-07_57_29
Last ObjectModification:
2011_06_18-AM-08_17_46
Home
Index