Nuprl Lemma : eo-forward-E-member
∀[Info:Type]. ∀eo:EO+(Info). ∀e:E. ∀e':E. ((e' ∈ E) ∧ ((loc(e') = loc(e) ∈ Id) ⇒ e ≤loc e' ))
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-loc: loc(e),
es-E: E,
Id: Id,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
member: t ∈ T,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
member: t ∈ T,
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
sq_stable: SqStable(P),
squash: ↓T,
prop: ℙ,
not: ¬A,
false: False,
or: P ∨ Q,
iff: P ⇐⇒ Q,
uiff: uiff(P;Q),
uimplies: b supposing a,
rev_implies: P ⇐ Q
Latex:
\mforall{}[Info:Type]. \mforall{}eo:EO+(Info). \mforall{}e:E. \mforall{}e':E. ((e' \mmember{} E) \mwedge{} ((loc(e') = loc(e)) {}\mRightarrow{} e \mleq{}loc e' ))
Date html generated:
2016_05_16-PM-01_05_25
Last ObjectModification:
2016_01_17-PM-07_57_16
Theory : event-ordering
Home
Index