Nuprl Lemma : es-increasing-sequence
∀es:EO. ∀m:ℕ+. ∀f:ℕm ⟶ E. ((∀i:ℕm - 1. (f i <loc f (i + 1))) ⇒ (∀i:ℕm. ∀j:ℕi. (f j <loc f i)))
Proof
Definitions occuring in Statement :
es-locl: (e <loc e'),
es-E: E,
event_ordering: EO,
int_seg: {i..j-},
nat_plus: ℕ+,
all: ∀x:A. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x],
subtract: n - m,
add: n + m,
natural_number: $n
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
uall: ∀[x:A]. B[x],
nat_plus: ℕ+,
so_lambda: λ2x.t[x],
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
uiff: uiff(P;Q),
subtract: n - m,
so_apply: x[s],
nat: ℕ,
ge: i ≥ j ,
es-locl: (e <loc e'),
es-causl: (e < e'),
squash: ↓T,
guard: {T},
sq_type: SQType(T),
le: A ≤ B,
less_than: a < b
Latex:
\mforall{}es:EO. \mforall{}m:\mBbbN{}\msupplus{}. \mforall{}f:\mBbbN{}m {}\mrightarrow{} E. ((\mforall{}i:\mBbbN{}m - 1. (f i <loc f (i + 1))) {}\mRightarrow{} (\mforall{}i:\mBbbN{}m. \mforall{}j:\mBbbN{}i. (f j <loc f i)))
Date html generated:
2016_05_16-AM-09_54_54
Last ObjectModification:
2016_01_17-PM-01_25_59
Theory : new!event-ordering
Home
Index