Nuprl Lemma : same-thread_weakening
∀[es:EO]. ∀[p:E ⟶ (E + Top)].
∀[e,e':E]. same-thread(es;p;e;e') supposing e = e' ∈ 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,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
function: x:A ⟶ B[x],
union: left + right,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
same-thread: same-thread(es;p;e;e'),
prop: ℙ,
squash: ↓T,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
implies: P ⇒ Q
Latex:
\mforall{}[es:EO]. \mforall{}[p:E {}\mrightarrow{} (E + Top)].
\mforall{}[e,e':E]. same-thread(es;p;e;e') supposing e = e' supposing causal-predecessor(es;p)
Date html generated:
2016_05_16-AM-10_32_57
Last ObjectModification:
2016_01_17-PM-01_22_02
Theory : new!event-ordering
Home
Index