---

Step * 1 2 2 1 of Lemma nearby-partition-choice

.....assertion..... 
1. I : Interval@i
2. icompact(I)
3. p : partition(I)@i
4. q : partition(I)@i
5. e : {e:ℝ| r0 < e} @i
6. nearby-partitions(e;p;q)
7. x : partition-choice(full-partition(I;p))@i
8. nearby-partitions(e;full-partition(I;p);full-partition(I;q))
⊢ frs-non-dec(full-partition(I;p)) ∧ frs-non-dec(full-partition(I;q))
BY
{ EAuto 1 }

---

Latex:

---

Latex:
.....assertion..... 
1.  I  :  Interval@i
2.  icompact(I)
3.  p  :  partition(I)@i
4.  q  :  partition(I)@i
5.  e  :  \{e:\mBbbR{}|  r0  <  e\}  @i
6.  nearby-partitions(e;p;q)
7.  x  :  partition-choice(full-partition(I;p))@i
8.  nearby-partitions(e;full-partition(I;p);full-partition(I;q))
\mvdash{}  frs-non-dec(full-partition(I;p))  \mwedge{}  frs-non-dec(full-partition(I;q))


By

---

Latex:
EAuto  1

---

Home Index