{ 
[A:Type]. [B:A 
Type]. [eq:EqDecider(A)]. [f,g:a:A fp-> B[a]].
f 
g 
g f supposing f || g }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-compatible: f || g,
fpf-sub: f g,
fpf: a:A fp-> B[a],
uimplies: b supposing a,
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],
uimplies: b supposing a,
fpf-sub: f g,
member: t 
T,
all: x:A. B[x],
implies: P 
Q,
cand: A c
B,
prop: 
,
so_lambda: 
x.t[x],
or: P 
Q,
guard: {T},
top: Top,
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
and: P Q,
iff: P 
Q,
rev_implies: P Q,
bool: 
,
unit: Unit,
fpf-compatible: f || g,
not: 
A,
false: False,
it: 
Lemmas :
assert_wf,
fpf-dom_wf,
fpf-join_wf,
top_wf,
fpf-trivial-subtype-top,
pair_wf,
assert_witness,
fpf-compatible_wf,
fpf_wf,
deq_wf,
fpf-join-dom,
bool_wf,
not_wf,
bnot_wf,
fpf-ap_wf,
fpf-join-ap-sq,
iff_weakening_uiff,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]]. f \moplus{} g \msubseteq{} g \moplus{} f supposing f || g
Date html generated:
2011_08_10-AM-08_01_33
Last ObjectModification:
2011_06_18-AM-08_20_00
Home
Index