{ 
[T:Type]. [eq:EqDecider(T)]. [d:a:T fp-> Type]. (non-void(d) 
') }
{ Proof }
Definitions occuring in Statement :
non-void-decl: non-void(d),
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
prop: ,
member: t T,
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
member: t T,
prop: ,
non-void-decl: non-void(d),
so_lambda: 
x.t[x],
so_lambda: x y.t[x; y],
so_apply: x[s],
so_apply: x[s1;s2]
Lemmas :
fpf-all_wf,
assert_wf,
fpf-dom_wf,
fpf-trivial-subtype-top,
fpf_wf,
deq_wf
\mforall{}[T:Type]. \mforall{}[eq:EqDecider(T)]. \mforall{}[d:a:T fp-> Type]. (non-void(d) \mmember{} \mBbbP{}')
Date html generated:
2011_08_10-AM-08_09_02
Last ObjectModification:
2011_06_18-AM-08_25_28
Home
Index