Nuprl Lemma : eo-strict-forward-eq
∀[Info:Type]. ∀[eo:EO+(Info)]. ∀[e:E]. (es-eq(eo>e) ~ es-eq(eo))
Proof
Definitions occuring in Statement :
eo-strict-forward: eo>e,
event-ordering+: EO+(Info),
es-eq: es-eq(es),
es-E: E,
uall: ∀[x:A]. B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-eq: es-eq(es),
eo-strict-forward: eo>e,
es-locless: es-locless(es;e1;e2),
es-loc: loc(e),
eo-restrict: eo-restrict(eo;P),
all: ∀x:A. B[x],
top: Top,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff,
subtype_rel: A ⊆r B
Latex:
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e:E]. (es-eq(eo>e) \msim{} es-eq(eo))
Date html generated:
2016_05_16-PM-01_16_49
Last ObjectModification:
2015_12_29-PM-01_56_31
Theory : event-ordering
Home
Index