{ 
[A:Type]. [eq:EqDecider(A)]. [B:A 
Type]. [f,g,h:a:A fp-> B[a]].
(f 
g || h) supposing (g || h and f || h) }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
uimplies: b supposing a,
uall: [x:A]. B[x],
so_apply: x[s],
function: x:A B[x],
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
so_apply: x[s],
uimplies: b supposing a,
fpf-compatible: f || g,
member: t 
T,
so_lambda: 
x.t[x],
all: x:A. B[x],
implies: P 
Q,
and: P 
Q,
prop: 
Lemmas :
fpf-compatible-symmetry,
fpf-join_wf,
fpf-compatible-join,
assert_wf,
fpf-dom_wf,
top_wf,
fpf-trivial-subtype-top,
fpf-compatible_wf,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g,h:a:A fp-> B[a]].
(f \moplus{} g || h) supposing (g || h and f || h)
Date html generated:
2011_08_10-AM-08_06_05
Last ObjectModification:
2011_06_18-AM-08_24_36
Home
Index