{ 
[Info:Type]. [es:EO+(Info)]. [e1,e2,e:E].
(es-hist(es;e1;e2) = (es-hist(es;e1;pred(e)) @ es-hist(es;e;e2))) supposing
(e 
loc e2 and
(e1 <loc e)) }
{ Proof }
Definitions occuring in Statement :
es-hist: es-hist(es;e1;e2),
event-ordering+: EO+(Info),
es-le: e loc e' ,
es-locl: (e <loc e'),
es-pred: pred(e),
es-E: E,
append: as @ bs,
uimplies: b supposing a,
uall: [x:A]. B[x],
list: type List,
universe: Type,
equal: s = t
Definitions :
uall: [x:A]. B[x],
uimplies: b supposing a,
es-hist: es-hist(es;e1;e2),
member: t 
T,
top: Top,
not: 
A,
assert: 
b,
bfalse: ff,
all: x:A. B[x],
implies: P 
Q,
ifthenelse: if b then t else f fi ,
true: True,
subtype: S 
T,
squash: 
T,
and: P 
Q,
prop: 
,
sq_type: SQType(T),
guard: {T},
false: False
Lemmas :
map_append_sq,
es-interval_wf2,
es-pred_wf,
subtype_base_sq,
bool_wf,
bool_subtype_base,
false_wf,
top_wf,
es-E_wf,
Id_wf,
es-loc_wf,
map_wf,
squash_wf,
true_wf,
es-info_wf,
es-le_wf,
event-ordering+_inc,
es-locl_wf,
event-ordering+_wf,
es-locl-first,
es-interval-partition
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[e1,e2,e:E].
(es-hist(es;e1;e2) = (es-hist(es;e1;pred(e)) @ es-hist(es;e;e2))) supposing
(e \mleq{}loc e2 and
(e1 <loc e))
Date html generated:
2011_08_16-AM-11_27_02
Last ObjectModification:
2011_06_20-AM-00_27_12
Home
Index