{ 
[A:Type]. [eq:EqDecider(A)]. [f,g:a:A fp-> Type]. [a:A].
(f 
g(a)?Top 
r f(a)?Top) }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
subtype_rel: A r B,
uall: [x:A]. B[x],
top: Top,
universe: Type,
deq: EqDecider(T)
Definitions :
cand: A c
B,
implies: P 
Q,
fpf-sub: f g,
pair: <a, b>,
list: type List,
true: True,
squash: 
T,
apply: f a,
so_apply: x[s],
prop: 
,
lambda: 
x.A[x],
void: Void,
strong-subtype: strong-subtype(A;B),
equal: s = t,
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uimplies: b supposing a,
and: P Q,
uiff: uiff(P;Q),
assert: 
b,
fpf-single: x : v,
product: x:A 
B[x],
set: {x:A| B[x]} ,
function: x:A 
B[x],
all: x:A. B[x],
fpf-join: f g,
top: Top,
fpf-cap: f(x)?z,
so_lambda: 
x.t[x],
universe: Type,
fpf: a:A fp-> B[a],
member: t 
T,
deq: EqDecider(T),
subtype_rel: A r B,
isect: 
x:A. B[x],
uall: [x:A]. B[x],
MaAuto: Error :MaAuto,
tactic: Error :tactic
Lemmas :
deq_wf,
uall_wf,
fpf_wf,
subtype_rel_wf,
fpf-cap_wf,
fpf-join_wf,
top_wf,
true_wf,
squash_wf,
subtype-fpf-cap-top,
fpf-sub_wf,
assert_wf,
fpf-sub-join-left
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> Type]. \mforall{}[a:A]. (f \moplus{} g(a)?Top \msubseteq{}r f(a)?Top)
Date html generated:
2011_08_10-AM-08_07_15
Last ObjectModification:
2011_06_18-AM-08_25_11
Home
Index