Nuprl Lemma : eo-strict-forward-first
∀[Info:Type]. ∀[eo:EO+(Info)]. ∀[e:E]. ∀[e':E].
(first(e') ~ if loc(e') = loc(e) then es-eq(eo) pred(e') e else first(e') fi )
Proof
Definitions occuring in Statement :
eo-strict-forward: eo>e,
event-ordering+: EO+(Info),
es-first: first(e),
es-pred: pred(e),
es-eq: es-eq(es),
es-loc: loc(e),
es-E: E,
eq_id: a = b,
ifthenelse: if b then t else f fi ,
uall: ∀[x:A]. B[x],
apply: f a,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
sq_type: SQType(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
subtype_rel: A ⊆r B,
and: P ∧ Q,
es-E: E,
es-base-E: es-base-E(es),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
top: Top,
es-eq-E: e = e',
es-locl: (e <loc e'),
cand: A c∧ B
Latex:
\mforall{}[Info:Type]. \mforall{}[eo:EO+(Info)]. \mforall{}[e:E]. \mforall{}[e':E].
(first(e') \msim{} if loc(e') = loc(e) then es-eq(eo) pred(e') e else first(e') fi )
Date html generated:
2016_05_16-PM-01_18_04
Last ObjectModification:
2015_12_29-PM-02_01_42
Theory : event-ordering
Home
Index