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
Lemmas :
causal-pred-wellfounded,
same-thread_wf,
causal-predecessor_wf,
es-E_wf,
top_wf,
event_ordering_wf
\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:
2015_07_17-AM-09_08_48
Last ObjectModification:
2015_01_27-PM-00_45_49
Home
Index