Nuprl Lemma : same-thread_inversion
∀[es:EO]. ∀[p:E ⟶ (E + Top)]. ∀[e,e':E].
(same-thread(es;p;e';e)) supposing (same-thread(es;p;e;e') and 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,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
function: x:A ⟶ B[x],
union: left + right
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
same-thread: same-thread(es;p;e;e'),
prop: ℙ
Latex:
\mforall{}[es:EO]. \mforall{}[p:E {}\mrightarrow{} (E + Top)]. \mforall{}[e,e':E].
(same-thread(es;p;e';e)) supposing (same-thread(es;p;e;e') and causal-predecessor(es;p))
Date html generated:
2016_05_16-AM-10_33_03
Last ObjectModification:
2015_12_28-PM-09_16_09
Theory : new!event-ordering
Home
Index