Step
*
1
2
1
of Lemma
nth_tl-partition
1. I : Interval
2. icompact(I)
3. a : ℝ
4. p : ℝ List
5. i : ℤ
6. 0 ≤ i
7. i < ||p||
8. a = p[i]
9. left-endpoint(I) ≤ p[0]
10. last(p) ≤ right-endpoint(I)
11. 0 < ||nth_tl(i + 1;p)||
12. ∀j:ℕ||p||. ((i ≤ j)
⇒ (p[i] ≤ p[j]))
⊢ i < ||p|| - 1
BY
{ (RWO "length_nth_tl" (-2) THEN Auto) }
Latex:
Latex:
1. I : Interval
2. icompact(I)
3. a : \mBbbR{}
4. p : \mBbbR{} List
5. i : \mBbbZ{}
6. 0 \mleq{} i
7. i < ||p||
8. a = p[i]
9. left-endpoint(I) \mleq{} p[0]
10. last(p) \mleq{} right-endpoint(I)
11. 0 < ||nth\_tl(i + 1;p)||
12. \mforall{}j:\mBbbN{}||p||. ((i \mleq{} j) {}\mRightarrow{} (p[i] \mleq{} p[j]))
\mvdash{} i < ||p|| - 1
By
Latex:
(RWO "length\_nth\_tl" (-2) THEN Auto)
Home
Index