{ 
[A:Type]. [B:A 
Type]. [f:a:A fp-> B[a]]. [eq:EqDecider(A)].
(f 
= f) }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-empty: ,
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
so_apply: x[s],
function: x:A B[x],
universe: Type,
equal: s = t,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
fpf: a:A fp-> B[a],
so_apply: x[s],
fpf-join: f g,
fpf-empty: ,
member: t 
T,
pi1: fst(t),
filter: filter(P;l),
fpf-dom: x dom(f),
fpf-cap: f(x)?z,
reduce: reduce(f;k;as),
top: Top,
all: x:A. B[x],
subtype: S 
T,
so_lambda: 
x.t[x],
prop: 
,
ifthenelse: if b then t else f fi ,
implies: P 
Q,
btrue: tt,
bfalse: ff,
not: 
A,
false: False,
bool: 
,
unit: Unit,
iff: P 
Q,
and: P 
Q,
uimplies: b supposing a,
it: 
Lemmas :
append-nil,
top_wf,
l_member_wf,
deq_wf,
fpf_wf,
deq-member_wf,
bool_wf,
assert_wf,
bnot_wf,
not_wf,
iff_transitivity,
iff_weakening_uiff,
eqtt_to_assert,
assert-deq-member,
eqff_to_assert,
assert_of_bnot,
not_functionality_wrt_iff
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. \mforall{}[eq:EqDecider(A)]. (f \moplus{} \motimes{} = f)
Date html generated:
2011_08_10-AM-07_59_02
Last ObjectModification:
2011_06_18-AM-08_18_45
Home
Index