Nuprl Lemma : es-p-le_transitivity
∀es:EO. ∀p:E ⟶ (E + Top). ∀a,b,c:E. (a p≤ b ⇒ b p≤ c ⇒ a p≤ c)
Proof
Definitions occuring in Statement :
es-p-le: e p≤ e',
es-E: E,
event_ordering: EO,
top: Top,
all: ∀x:A. B[x],
implies: P ⇒ Q,
function: x:A ⟶ B[x],
union: left + right
Definitions unfolded in proof :
es-p-le: e p≤ e',
all: ∀x:A. B[x],
implies: P ⇒ Q,
or: P ∨ Q,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
guard: {T}
Latex:
\mforall{}es:EO. \mforall{}p:E {}\mrightarrow{} (E + Top). \mforall{}a,b,c:E. (a p\mleq{} b {}\mRightarrow{} b p\mleq{} c {}\mRightarrow{} a p\mleq{} c)
Date html generated:
2016_05_16-AM-10_30_29
Last ObjectModification:
2015_12_28-PM-09_15_23
Theory : new!event-ordering
Home
Index