{ 
[A:Type]. [eq:EqDecider(A)]. [f,g:a:A fp-> Type]. [a:A].
f 
g(a)?Top 
r g(a)?Top supposing f || g }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-compatible: f || g,
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
subtype_rel: A r B,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
uimplies: b supposing a,
fpf-cap: f(x)?z,
top: Top,
member: t 
T,
so_lambda: 
x.t[x],
prop: 
,
ifthenelse: if b then t else f fi ,
all: x:A. B[x],
implies: P 
Q,
btrue: tt,
bfalse: ff,
and: P 
Q,
so_apply: x[s],
not: 
A,
false: False,
bool: 
,
unit: Unit,
iff: P 
Q,
fpf-compatible: f || g,
it: 
Lemmas :
fpf-join-cap-sq,
fpf-trivial-subtype-top,
fpf-compatible_wf,
fpf_wf,
deq_wf,
fpf-dom_wf,
bool_wf,
assert_wf,
not_wf,
bnot_wf,
subtype_rel_self,
fpf-cap_wf,
top_wf,
iff_weakening_uiff,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
fpf-ap_wf
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> Type]. \mforall{}[a:A].
f \moplus{} g(a)?Top \msubseteq{}r g(a)?Top supposing f || g
Date html generated:
2011_08_10-AM-08_07_19
Last ObjectModification:
2011_06_18-AM-08_25_14
Home
Index