Nuprl Lemma : list-eo-info-before
∀L:Top List. ∀i:Id. ∀e:E. (map(λe.info(e);before(e)) ~ firstn(e;L))
Proof
Definitions occuring in Statement :
list-eo: list-eo(L;i),
es-info: info(e),
es-before: before(e),
es-E: E,
Id: Id,
firstn: firstn(n;as),
map: map(f;as),
list: T List,
top: Top,
all: ∀x:A. B[x],
lambda: λx.A[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
top: Top,
nat: ℕ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
prop: ℙ,
subtype_rel: A ⊆r B,
or: P ∨ Q,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T},
decidable: Dec(P),
nil: [],
it: ⋅,
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
firstn: firstn(n;as),
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3],
bool: 𝔹,
unit: Unit,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
bnot: ¬bb,
assert: ↑b,
le: A ≤ B,
nat_plus: ℕ+,
select: L[n],
compose: f o g,
int_seg: {i..j-},
lelt: i ≤ j < k,
upto: upto(n),
from-upto: [n, m),
lt_int: i <z j
Latex:
\mforall{}L:Top List. \mforall{}i:Id. \mforall{}e:E. (map(\mlambda{}e.info(e);before(e)) \msim{} firstn(e;L))
Date html generated:
2016_05_17-AM-08_24_03
Last ObjectModification:
2016_01_17-PM-02_34_29
Theory : event-ordering
Home
Index