{ 
[es:EO]. [p:E 
(E + Top)].
[e:E]. same-thread(es;p;e;do-apply(p;e)) supposing 
can-apply(p;e)
supposing causal-predecessor(es;p) }
{ Proof }
Definitions occuring in Statement :
same-thread: same-thread(es;p;e;e'),
causal-predecessor: causal-predecessor(es;p),
es-E: E,
event_ordering: EO,
assert: b,
uimplies: b supposing a,
uall: [x:A]. B[x],
top: Top,
function: x:A B[x],
union: left + right,
do-apply: do-apply(f;x),
can-apply: can-apply(f;x)
Definitions :
uall: [x:A]. B[x],
top: Top,
uimplies: b supposing a,
same-thread: same-thread(es;p;e;e'),
member: t 
T,
all: x:A. B[x],
subtype: S 
T,
suptype: suptype(S; T),
implies: P 
Q,
prop: 
,
final-iterate: final-iterate(f;x),
ycomb: Y,
not: 
A,
false: False,
ifthenelse: if b then t else f fi ,
or: P 
Q,
btrue: tt,
bfalse: ff,
sq_type: SQType(T),
guard: {T},
iff: P 
Q,
and: P 
Q
Lemmas :
causal-pred-wellfounded,
assert_wf,
can-apply_wf,
es-E_wf,
top_wf,
causal-predecessor_wf,
event_ordering_wf,
final-iterate_wf,
bool_wf,
not_wf,
bnot_wf,
bool_cases,
subtype_base_sq,
bool_subtype_base,
iff_weakening_uiff,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot
\mforall{}[es:EO]. \mforall{}[p:E {}\mrightarrow{} (E + Top)].
\mforall{}[e:E]. same-thread(es;p;e;do-apply(p;e)) supposing \muparrow{}can-apply(p;e)
supposing causal-predecessor(es;p)
Date html generated:
2011_08_16-AM-11_16_42
Last ObjectModification:
2011_06_20-AM-00_22_20
Home
Index