Nuprl Lemma : list-eo-E
∀[L:Top List]. ∀[i:Top]. ∀n:ℕ||L||. (n ∈ E)
Proof
Definitions occuring in Statement :
list-eo: list-eo(L;i),
es-E: E,
length: ||as||,
list: T List,
int_seg: {i..j-},
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
member: t ∈ T,
natural_number: $n
Definitions unfolded in proof :
rev_uimplies: rev_uimplies(P;Q),
uiff: uiff(P;Q),
implies: P ⇒ Q,
and: P ∧ Q,
lelt: i ≤ j < k,
uimplies: b supposing a,
so_apply: x[s],
so_lambda: λ2x.t[x],
prop: ℙ,
nat: ℕ,
int_seg: {i..j-},
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
member: t ∈ T,
uall: ∀[x:A]. B[x]
Latex:
\mforall{}[L:Top List]. \mforall{}[i:Top]. \mforall{}n:\mBbbN{}||L||. (n \mmember{} E)
Date html generated:
2016_05_17-AM-08_22_03
Last ObjectModification:
2015_12_28-PM-11_02_10
Theory : event-ordering
Home
Index