{ 
[T:Type]
eq:EqDecider(T). d1,d2:a:T fp-> Type.
(non-void(d1) 
non-void(d2) non-void(d1 
d2)) }
{ Proof }
Definitions occuring in Statement :
non-void-decl: non-void(d),
fpf-join: f g,
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
all: x:A. B[x],
implies: P Q,
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
implies: P Q,
non-void-decl: non-void(d),
prop: 
,
member: t 
T,
so_lambda: 
x y.t[x; y],
so_lambda: x.t[x],
so_apply: x[s1;s2],
so_apply: x[s]
Lemmas :
fpf-all-join-decl,
fpf-all_wf,
assert_wf,
fpf-dom_wf,
fpf-trivial-subtype-top,
fpf_wf,
deq_wf
\mforall{}[T:Type]
\mforall{}eq:EqDecider(T). \mforall{}d1,d2:a:T fp-> Type. (non-void(d1) {}\mRightarrow{} non-void(d2) {}\mRightarrow{} non-void(d1 \moplus{} d2))
Date html generated:
2011_08_10-AM-08_09_05
Last ObjectModification:
2011_06_18-AM-08_25_30
Home
Index