Nuprl Lemma : eo-forward-eq
∀[eo,e:Top]. (es-eq(eo.e) ~ es-eq(eo))
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-eq: es-eq(es),
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-eq: es-eq(es),
eo-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
Latex:
\mforall{}[eo,e:Top]. (es-eq(eo.e) \msim{} es-eq(eo))
Date html generated:
2016_05_16-PM-01_07_29
Last ObjectModification:
2015_12_29-PM-01_49_25
Theory : event-ordering
Home
Index