Nuprl Lemma : es-pred-locl-implies-le
∀es:EO. ∀e1,e2:E. ((¬↑first(e1)) ⇒ (pred(e1) <loc e2) ⇒ e1 ≤loc e2 )
Proof
Definitions occuring in Statement :
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
es-first: first(e),
es-pred: pred(e),
es-E: E,
event_ordering: EO,
assert: ↑b,
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
es-locl: (e <loc e'),
or: P ∨ Q,
guard: {T},
prop: ℙ,
false: False
Latex:
\mforall{}es:EO. \mforall{}e1,e2:E. ((\mneg{}\muparrow{}first(e1)) {}\mRightarrow{} (pred(e1) <loc e2) {}\mRightarrow{} e1 \mleq{}loc e2 )
Date html generated:
2016_05_16-AM-09_23_38
Last ObjectModification:
2015_12_28-PM-09_52_18
Theory : new!event-ordering
Home
Index