{ 
[A:Type]. [eq:EqDecider(A)]. [x,y:A]. [v:Top].
(x 
dom(y : v) ~ eqof(eq) y x) }
{ Proof }
Definitions occuring in Statement :
fpf-single: x : v,
fpf-dom: x dom(f),
uall: [x:A]. B[x],
top: Top,
apply: f a,
universe: Type,
sqequal: s ~ t,
eqof: eqof(d),
deq: EqDecider(T)
Definitions :
fpf-dom: x dom(f),
fpf-single: x : v,
deq-member: deq-member(eq;x;L),
pi1: fst(t),
reduce: reduce(f;k;as),
bor: p 
q,
bfalse: ff,
member: t T,
all: x:A. B[x],
implies: P 
Q,
btrue: tt,
prop: 
,
ifthenelse: if b then t else f fi ,
bool: 
,
uall: [x:A]. B[x],
unit: Unit,
iff: P 
Q,
and: P 
Q,
it: 
Lemmas :
eqof_wf,
bool_wf,
iff_weakening_uiff,
assert_wf,
eqtt_to_assert,
not_wf,
uiff_transitivity,
bnot_wf,
eqff_to_assert,
assert_of_bnot,
top_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[x,y:A]. \mforall{}[v:Top]. (x \mmember{} dom(y : v) \msim{} eqof(eq) y x)
Date html generated:
2011_08_10-AM-08_06_23
Last ObjectModification:
2011_06_18-AM-08_24_47
Home
Index