Nuprl Lemma : global-eo-info-le-before
∀[L:(Id × Top) List]. ∀[e:E]. (map(λe.info(e);≤loc(e)) ~ map(λx.(snd(x));filter(λx.fst(x) = loc(e);firstn(e + 1;L))))
Proof
Definitions occuring in Statement :
global-eo: global-eo(L),
es-info: info(e),
es-le-before: ≤loc(e),
es-loc: loc(e),
es-E: E,
eq_id: a = b,
Id: Id,
firstn: firstn(n;as),
filter: filter(P;l),
map: map(f;as),
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
pi1: fst(t),
pi2: snd(t),
lambda: λx.A[x],
product: x:A × B[x],
add: n + m,
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-le-before: ≤loc(e),
top: Top,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
nat: ℕ,
int_seg: {i..j-},
guard: {T},
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
prop: ℙ,
less_than: a < b,
squash: ↓T,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b
Latex:
\mforall{}[L:(Id \mtimes{} Top) List]. \mforall{}[e:E].
(map(\mlambda{}e.info(e);\mleq{}loc(e)) \msim{} map(\mlambda{}x.(snd(x));filter(\mlambda{}x.fst(x) = loc(e);firstn(e + 1;L))))
Date html generated:
2016_05_17-AM-08_31_07
Last ObjectModification:
2016_01_17-PM-02_27_12
Theory : event-ordering
Home
Index