Nuprl Lemma : ranked-eo-info-before
∀[L:Id ⟶ (Top List)]. ∀[rk:Top]. ∀[e:E]. (map(λe.info(e);before(e)) ~ firstn(snd(e);L (fst(e))))
Proof
Definitions occuring in Statement :
ranked-eo: ranked-eo(L;rk),
es-info: info(e),
es-before: before(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],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
compose: f o g,
pi2: snd(t),
pi1: fst(t),
es-E: E,
subtype_rel: A ⊆r B,
record-select: r.x,
ranked-eo: ranked-eo(L;rk),
mk-extended-eo: mk-extended-eo,
record-update: r[x := v],
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
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,
uimplies: b supposing a,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
int_seg: {i..j-},
so_lambda: λ2x.t[x],
so_apply: x[s],
squash: ↓T,
true: True,
sq_type: SQType(T),
all: ∀x:A. B[x],
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
lelt: i ≤ j < k,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
or: P ∨ Q,
bnot: ¬bb,
assert: ↑b
Latex:
\mforall{}[L:Id {}\mrightarrow{} (Top List)]. \mforall{}[rk:Top]. \mforall{}[e:E]. (map(\mlambda{}e.info(e);before(e)) \msim{} firstn(snd(e);L (fst(e))))
Date html generated:
2016_05_17-AM-08_45_17
Last ObjectModification:
2016_01_17-PM-02_39_16
Theory : event-ordering
Home
Index