Nuprl Lemma : global-eo-locl
∀[L:(Id × Top) List]. ∀[a,b:E]. ((a <loc b) ⇐⇒ (loc(a) = loc(b) ∈ Id) ∧ a < b)
Proof
Definitions occuring in Statement :
global-eo: global-eo(L),
es-locl: (e <loc e'),
es-loc: loc(e),
es-E: E,
Id: Id,
list: T List,
less_than: a < b,
uall: ∀[x:A]. B[x],
top: Top,
iff: P ⇐⇒ Q,
and: P ∧ Q,
product: x:A × B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
global-eo: global-eo(L),
es-loc: loc(e),
es-locl: (e <loc e'),
es-E: E,
mk-extended-eo: mk-extended-eo,
es-causl: (e < e'),
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,
mk-eo: mk-eo(E;dom;l;R;locless;pred;rank),
mk-eo-record: mk-eo-record(E;dom;l;R;locless;pred;rank),
btrue: tt,
infix_ap: x f y,
assert: ↑b,
uall: ∀[x:A]. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
squash: ↓T,
prop: ℙ,
int_seg: {i..j-},
uimplies: b supposing a,
sq_stable: SqStable(P),
guard: {T},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
less_than: a < b,
rev_implies: P ⇐ Q,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[L:(Id \mtimes{} Top) List]. \mforall{}[a,b:E]. ((a <loc b) \mLeftarrow{}{}\mRightarrow{} (loc(a) = loc(b)) \mwedge{} a < b)
Date html generated:
2016_05_17-AM-08_28_33
Last ObjectModification:
2016_01_17-PM-02_32_22
Theory : event-ordering
Home
Index