{ 
[A:Type]. [eq:EqDecider(A)]. [B:Top]. [f:a:A fp-> Top]. f || 
}
{ Proof }
Definitions occuring in Statement :
fpf-compatible: f || g,
fpf-empty: ,
fpf: a:A fp-> B[a],
uall: [x:A]. B[x],
top: Top,
so_apply: x[s],
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
fpf-compatible: f || g,
member: t 
T,
all: x:A. B[x],
implies: P 
Q,
and: P 
Q,
prop: 
,
so_lambda: 
x.t[x],
so_apply: x[s],
fpf-empty: ,
assert: 
b,
fpf-dom: x dom(f),
deq-member: deq-member(eq;x;L),
pi1: fst(t),
reduce: reduce(f;k;as),
bfalse: ff,
ifthenelse: if b then t else f fi ,
false: False
Lemmas :
assert_wf,
fpf-dom_wf,
fpf-empty_wf,
top_wf,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:Top]. \mforall{}[f:a:A fp-> Top]. f || \motimes{}
Date html generated:
2011_08_10-AM-08_09_11
Last ObjectModification:
2011_06_18-AM-08_25_35
Home
Index