---

Step * 1 of Lemma nearby-partition-mesh


1. I : Interval
2. icompact(I)
3. e : {e:ℝ| r0 < e} 
4. p : partition(I)
5. p' : partition(I)
6. nearby-partitions((e/r(2));p;p')
⊢ frs-mesh(full-partition(I;p')) ≤ (frs-mesh(full-partition(I;p)) + e)
BY
{ Assert ⌜nearby-partitions((e/r(2));full-partition(I;p);full-partition(I;p'))⌝⋅ }

1
.....assertion..... 
1. I : Interval
2. icompact(I)
3. e : {e:ℝ| r0 < e} 
4. p : partition(I)
5. p' : partition(I)
6. nearby-partitions((e/r(2));p;p')
⊢ nearby-partitions((e/r(2));full-partition(I;p);full-partition(I;p'))

2
1. I : Interval
2. icompact(I)
3. e : {e:ℝ| r0 < e} 
4. p : partition(I)
5. p' : partition(I)
6. nearby-partitions((e/r(2));p;p')
7. nearby-partitions((e/r(2));full-partition(I;p);full-partition(I;p'))
⊢ frs-mesh(full-partition(I;p')) ≤ (frs-mesh(full-partition(I;p)) + e)

---

Latex:

---

Latex:

1.  I  :  Interval
2.  icompact(I)
3.  e  :  \{e:\mBbbR{}|  r0  <  e\} 
4.  p  :  partition(I)
5.  p'  :  partition(I)
6.  nearby-partitions((e/r(2));p;p')
\mvdash{}  frs-mesh(full-partition(I;p'))  \mleq{}  (frs-mesh(full-partition(I;p))  +  e)


By

---

Latex:
Assert  \mkleeneopen{}nearby-partitions((e/r(2));full-partition(I;p);full-partition(I;p'))\mkleeneclose{}\mcdot{}

---

Home Index