{ 
[A:Type]. [B:A 
Type]. [eq:EqDecider(A)]. [f1,g1,f2,g2:a:A fp-> B[a]].
({f1 || g1 supposing f2 || g2}) supposing (g1 
g2 and f1 f2) }
{ Proof }
Definitions occuring in Statement :
fpf-compatible: f || g,
fpf-sub: f g,
fpf: a:A fp-> B[a],
uimplies: b supposing a,
uall: [x:A]. B[x],
guard: {T},
so_apply: x[s],
function: x:A B[x],
universe: Type,
deq: EqDecider(T)
Definitions :
guard: {T}
Lemmas :
fpf-compatible_monotonic
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f1,g1,f2,g2:a:A fp-> B[a]].
(\{f1 || g1 supposing f2 || g2\}) supposing (g1 \msubseteq{} g2 and f1 \msubseteq{} f2)
Date html generated:
2011_08_10-AM-07_58_20
Last ObjectModification:
2011_06_18-AM-08_18_18
Home
Index