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: 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)
Lemmas :  causal-pred-wellfounded assert_wf can-apply_wf es-E_wf subtype_rel_dep_function top_wf subtype_rel_sum causal-predecessor_wf event_ordering_wf final-iterate_wf bool_cases subtype_base_sq bool_wf bool_subtype_base eqtt_to_assert 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: 2015_07_17-AM-09_08_40
Last ObjectModification: 2015_01_27-PM-00_46_12

Home Index