Nuprl Lemma : global-eo-info-before
∀[L:(Id × Top) List]. ∀[e:E]. (map(λe.info(e);before(e)) ~ map(λx.(snd(x));filter(λx.fst(x) = loc(e);firstn(e;L))))
Proof
Definitions occuring in Statement :
global-eo: global-eo(L),
es-info: info(e),
es-before: before(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],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
int_seg: {i..j-},
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
all: ∀x:A. B[x],
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
lelt: i ≤ j < k,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
bfalse: ff,
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
nat: ℕ,
ge: i ≥ j ,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
nil: [],
less_than: a < b,
squash: ↓T,
sq_stable: SqStable(P)
Latex:
\mforall{}[L:(Id \mtimes{} Top) List]. \mforall{}[e:E].
(map(\mlambda{}e.info(e);before(e)) \msim{} map(\mlambda{}x.(snd(x));filter(\mlambda{}x.fst(x) = loc(e);firstn(e;L))))
Date html generated:
2016_05_17-AM-08_30_39
Last ObjectModification:
2016_01_17-PM-02_29_44
Theory : event-ordering
Home
Index