Nuprl Lemma : ranked-eo-info-le-before
∀[L:Id ⟶ (Top List)]. ∀[rk:Top]. ∀[e:E]. (map(λe.info(e);≤loc(e)) ~ firstn((snd(e)) + 1;L (fst(e))))
Proof
Definitions occuring in Statement :
ranked-eo: ranked-eo(L;rk),
es-info: info(e),
es-le-before: ≤loc(e),
es-E: E,
Id: Id,
firstn: firstn(n;as),
map: map(f;as),
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
pi1: fst(t),
pi2: snd(t),
apply: f a,
lambda: λx.A[x],
function: 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,
top: Top,
prop: ℙ,
es-le-before: ≤loc(e),
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
implies: P ⇒ Q,
guard: {T},
nat: ℕ,
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
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,
squash: ↓T
Latex:
\mforall{}[L:Id {}\mrightarrow{} (Top List)]. \mforall{}[rk:Top]. \mforall{}[e:E].
(map(\mlambda{}e.info(e);\mleq{}loc(e)) \msim{} firstn((snd(e)) + 1;L (fst(e))))
Date html generated:
2016_05_17-AM-08_45_35
Last ObjectModification:
2016_01_17-PM-02_37_10
Theory : event-ordering
Home
Index