{ 
[Info:Type]
es:EO+(Info). e1,e2:E. L:Info List.
(L 
es-hist(es;e1;e2) 
e
[e1,e2].L = es-hist(es;e1;e)) supposing
((
(L = [])) and
(loc(e1) = loc(e2))) }
{ Proof }
Definitions occuring in Statement :
es-hist: es-hist(es;e1;e2),
event-ordering+: EO+(Info),
existse-between2: e[e1,e2].P[e],
es-loc: loc(e),
es-E: E,
Id: Id,
uimplies: b supposing a,
uall: [x:A]. B[x],
all: x:A. B[x],
not: A,
implies: P Q,
nil: [],
list: type List,
universe: Type,
equal: s = t,
iseg: l1 l2
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
uimplies: b supposing a,
not: A,
implies: P Q,
member: t T,
prop: 
,
so_lambda: 
x.t[x],
false: False,
top: Top,
subtype: S 
T,
or: P 
Q,
guard: {T},
and: P 
Q,
existse-between2: e[e1,e2].P[e],
exists: x:A. B[x],
cand: A c B,
es-le: e loc e' ,
es-hist: es-hist(es;e1;e2),
map: map(f;as),
ycomb: Y,
append: as @ bs,
so_apply: x[s],
wellfounded: WellFnd{i}(A;x,y.R[x; y]),
decidable: Dec(P),
rev_implies: P 
Q,
iff: P Q
Lemmas :
es-E_wf,
event-ordering+_inc,
event-ordering+_wf,
Id_wf,
es-loc_wf,
not_wf,
iseg_wf,
es-hist_wf,
existse-between2_wf,
es-locl_wf,
es-locl-wellfnd,
decidable__es-le,
es-interval-is-nil,
decidable__es-locl,
es-le-not-locl,
iseg_nil,
iff_weakening_uiff,
assert_wf,
null_wf3,
top_wf,
assert_of_null,
es-le-iff,
es-pred_wf,
es-pred-locl,
es-hist-last,
es-locl_transitivity1,
iseg_append_single,
es-info_wf,
es-loc-pred,
es-le_weakening,
es-le_wf,
es-interval-eq
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}e1,e2:E. \mforall{}L:Info List.
(L \mleq{} es-hist(es;e1;e2) {}\mRightarrow{} \mexists{}e\mmember{}[e1,e2].L = es-hist(es;e1;e)) supposing
((\mneg{}(L = [])) and
(loc(e1) = loc(e2)))
Date html generated:
2011_08_16-AM-11_27_46
Last ObjectModification:
2011_06_20-AM-00_27_42
Home
Index