Nuprl Lemma : same-thread-do-apply
∀[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 unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
same-thread: same-thread(es;p;e;e'),
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
top: Top,
final-iterate: final-iterate(f;x),
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
not: ¬A,
false: False
Latex:
\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:
2016_05_16-AM-10_32_27
Last ObjectModification:
2015_12_28-PM-09_16_35
Theory : new!event-ordering
Home
Index