{ 
[A:Type]. [B:A 
Type]. [eq:EqDecider(A)]. [f,g:a:A fp-> B[a]].
SqStable(f 
g) }
{ Proof }
Definitions occuring in Statement :
fpf-sub: f g,
fpf: a:A fp-> B[a],
sq_stable: SqStable(P),
uall: [x:A]. B[x],
so_apply: x[s],
function: x:A B[x],
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
so_apply: x[s],
sq_stable: SqStable(P),
fpf-sub: f g,
member: t 
T,
implies: P 
Q,
all: x:A. B[x],
cand: A c
B,
prop: 
,
so_lambda: 
x.t[x],
assert: 
b,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
true: True,
false: False,
bool: 
,
uimplies: b supposing a,
unit: Unit,
iff: P 
Q,
and: P Q,
squash: 
T,
it: 
Lemmas :
pair_wf,
assert_wf,
fpf-dom_wf,
fpf-trivial-subtype-top,
assert_witness,
squash_wf,
fpf-sub_wf,
fpf_wf,
deq_wf,
sq_stable__all,
fpf-ap_wf,
bool_wf,
iff_weakening_uiff,
eqtt_to_assert,
sq_stable__implies,
true_wf,
not_wf,
uiff_transitivity,
bnot_wf,
eqff_to_assert,
assert_of_bnot,
false_wf,
sq_stable__and,
sq_stable__assert,
sq_stable__equal
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]]. SqStable(f \msubseteq{} g)
Date html generated:
2011_08_10-AM-07_57_00
Last ObjectModification:
2011_06_18-AM-08_17_25
Home
Index