Nuprl Lemma : ranked-lists-to-extended-eo
∀[Info:Type]
∀L:Id ⟶ (Info List). ∀rk:(i:Id × ℕ||L i||) ⟶ ℕ.
∃es:EO+(Info). ∀i:Id. (0 < ||L i|| ⇒ (∃e:E. ((L i) = map(λe.info(e);≤loc(e)) ∈ (Info List))))
supposing ∀i:Id. ∀j:ℕ||L i||. ∀k:ℕj. rk <i, k> < rk <i, j>
Proof
Definitions occuring in Statement :
es-info: info(e),
event-ordering+: EO+(Info),
es-le-before: ≤loc(e),
es-E: E,
Id: Id,
length: ||as||,
map: map(f;as),
list: T List,
int_seg: {i..j-},
nat: ℕ,
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
implies: P ⇒ Q,
apply: f a,
lambda: λx.A[x],
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
natural_number: $n,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
guard: {T},
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
le: A ≤ B,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[Info:Type]
\mforall{}L:Id {}\mrightarrow{} (Info List). \mforall{}rk:(i:Id \mtimes{} \mBbbN{}||L i||) {}\mrightarrow{} \mBbbN{}.
\mexists{}es:EO+(Info). \mforall{}i:Id. (0 < ||L i|| {}\mRightarrow{} (\mexists{}e:E. ((L i) = map(\mlambda{}e.info(e);\mleq{}loc(e)))))
supposing \mforall{}i:Id. \mforall{}j:\mBbbN{}||L i||. \mforall{}k:\mBbbN{}j. rk <i, k> < rk <i, j>
Date html generated:
2016_05_17-AM-08_46_30
Last ObjectModification:
2016_01_17-PM-02_38_51
Theory : event-ordering
Home
Index