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