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