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