Nuprl Lemma : eo-forward-less
∀[eo,e,e1,e2:Top]. ((e1 < e2) ~ (e1 < e2))
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-causl: (e < e'),
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
es-causl: (e < e'),
eo-forward: eo.e,
eo-restrict: eo-restrict(eo;P),
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff,
uall: ∀[x:A]. B[x]
Latex:
\mforall{}[eo,e,e1,e2:Top]. ((e1 < e2) \msim{} (e1 < e2))
Date html generated:
2016_05_16-PM-01_05_46
Last ObjectModification:
2015_12_29-PM-01_47_24
Theory : event-ordering
Home
Index