Nuprl Lemma : eo-strict-forward-less
∀[Info:Type]. ∀[eo:EO+(Info)]. ∀[e,e1:Top]. ∀e2:Top. ((e1 < e2) ~ (e1 < e2))
Proof
Definitions occuring in Statement :
eo-strict-forward: eo>e,
event-ordering+: EO+(Info),
es-causl: (e < e'),
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
es-causl: (e < e'),
eo-strict-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{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e,e1:Top]. \mforall{}e2:Top. ((e1 < e2) \msim{} (e1 < e2))
Date html generated:
2016_05_16-PM-01_15_51
Last ObjectModification:
2015_12_29-PM-01_55_29
Theory : event-ordering
Home
Index