{ 
[A:Type]. [B:A 
Type]. [eq:EqDecider(A)]. [f,h,g:a:A fp-> B[a]].
h 
f 
g supposing h f }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-sub: 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-sub: f g,
member: t 
T,
so_lambda: 
x.t[x],
all: x:A. B[x],
implies: P 
Q,
cand: A c
B,
prop: 
Lemmas :
fpf-sub_transitivity,
fpf-join_wf,
pair_wf,
assert_wf,
fpf-dom_wf,
top_wf,
fpf-trivial-subtype-top,
assert_witness,
fpf-sub_wf,
fpf_wf,
deq_wf,
fpf-sub-join-left
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,h,g:a:A fp-> B[a]]. h \msubseteq{} f \moplus{} g supposing h \msubseteq{} f
Date html generated:
2011_08_10-AM-08_00_16
Last ObjectModification:
2011_06_18-AM-08_19_26
Home
Index