Nuprl Lemma : list-eo-pred
∀L:Top List. ∀i:Id. ∀n:ℕ||L||. (0 < n ⇒ (pred(n) ~ n - 1))
Proof
Definitions occuring in Statement :
list-eo: list-eo(L;i),
es-pred: pred(e),
Id: Id,
length: ||as||,
list: T List,
int_seg: {i..j-},
less_than: a < b,
top: Top,
all: ∀x:A. B[x],
implies: P ⇒ Q,
subtract: n - m,
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
es-pred: pred(e),
member: t ∈ T,
uall: ∀[x:A]. B[x],
int_seg: {i..j-},
prop: ℙ,
list-eo: list-eo(L;i),
es-base-pred: pred1(e),
mk-extended-eo: mk-extended-eo,
top: Top,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff,
mk-eo: mk-eo(E;dom;l;R;locless;pred;rank),
mk-eo-record: mk-eo-record(E;dom;l;R;locless;pred;rank),
btrue: tt,
es-eq: es-eq(es),
es-dom: es-dom(es),
es-locless: es-locless(es;e1;e2),
es-loc: loc(e),
infix_ap: x f y,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
let: let,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
lelt: i ≤ j < k,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
nequal: a ≠ b ∈ T ,
less_than: a < b,
squash: ↓T
Latex:
\mforall{}L:Top List. \mforall{}i:Id. \mforall{}n:\mBbbN{}||L||. (0 < n {}\mRightarrow{} (pred(n) \msim{} n - 1))
Date html generated:
2016_05_17-AM-08_23_20
Last ObjectModification:
2016_01_17-PM-03_10_58
Theory : event-ordering
Home
Index