Step
*
1
of Lemma
strong-continuity-test-bound-prop4
1. M : n:ℕ ⟶ (ℕn ⟶ ℕ) ⟶ (ℕn?)@i
2. n : ℤ@i
3. [%1] : 0 < n@i
4. ∀f:ℕn - 1 ⟶ ℕ. ∀b:ℕn - 1.
((↑isr(strong-continuity-test-bound(M;n - 1;f;b)))
⇒ (∃m:ℕ. (b < m ∧ m < n - 1 ∧ (↑isl(M m f)) ∧ (↑isl(strong-continuity-test-bound(M;m;f;b))))))@i
5. f : ℕn ⟶ ℕ@i
6. b : ℕn@i
7. ↑isr(strong-continuity-test-bound(M;n;f;b))@i
⊢ ∃m:ℕ. (b < m ∧ m < n ∧ (↑isl(M m f)) ∧ (↑isl(strong-continuity-test-bound(M;m;f;b))))
BY
{ ((RWO "strong-continuity-test-bound-unroll" (-1) THENA Auto)
THEN (SplitOnHypITE (-1) THEN AllReduce THEN Try (CpltAuto))
THEN (SplitOnHypITE (-2) THEN AllReduce THEN Try (CpltAuto))
THEN (SplitOnHypITE (-3) THEN AllReduce THEN Try (CpltAuto))
THEN SplitOnHypITE (-4)
THEN AllReduce
THEN Try (CpltAuto)) }
1
1. M : n:ℕ ⟶ (ℕn ⟶ ℕ) ⟶ (ℕn?)@i
2. n : ℤ@i
3. [%1] : 0 < n@i
4. ∀f:ℕn - 1 ⟶ ℕ. ∀b:ℕn - 1.
((↑isr(strong-continuity-test-bound(M;n - 1;f;b)))
⇒ (∃m:ℕ. (b < m ∧ m < n - 1 ∧ (↑isl(M m f)) ∧ (↑isl(strong-continuity-test-bound(M;m;f;b))))))@i
5. f : ℕn ⟶ ℕ@i
6. b : ℕn@i
7. True@i
8. ¬(n = 0 ∈ ℤ)
9. ¬n - 1 < b
10. ¬((n - 1) = b ∈ ℤ)
11. ↑isl(M (n - 1) f)
⊢ ∃m:ℕ. (b < m ∧ m < n ∧ (↑isl(M m f)) ∧ (↑isl(strong-continuity-test-bound(M;m;f;b))))
2
1. M : n:ℕ ⟶ (ℕn ⟶ ℕ) ⟶ (ℕn?)@i
2. n : ℤ@i
3. [%1] : 0 < n@i
4. ∀f:ℕn - 1 ⟶ ℕ. ∀b:ℕn - 1.
((↑isr(strong-continuity-test-bound(M;n - 1;f;b)))
⇒ (∃m:ℕ. (b < m ∧ m < n - 1 ∧ (↑isl(M m f)) ∧ (↑isl(strong-continuity-test-bound(M;m;f;b))))))@i
5. f : ℕn ⟶ ℕ@i
6. b : ℕn@i
7. ↑isr(strong-continuity-test-bound(M;n - 1;f;b))@i
8. ¬(n = 0 ∈ ℤ)
9. ¬n - 1 < b
10. ¬((n - 1) = b ∈ ℤ)
11. ¬↑isl(M (n - 1) f)
⊢ ∃m:ℕ. (b < m ∧ m < n ∧ (↑isl(M m f)) ∧ (↑isl(strong-continuity-test-bound(M;m;f;b))))
Latex:
Latex:
1. M : n:\mBbbN{} {}\mrightarrow{} (\mBbbN{}n {}\mrightarrow{} \mBbbN{}) {}\mrightarrow{} (\mBbbN{}n?)@i
2. n : \mBbbZ{}@i
3. [\%1] : 0 < n@i
4. \mforall{}f:\mBbbN{}n - 1 {}\mrightarrow{} \mBbbN{}. \mforall{}b:\mBbbN{}n - 1.
((\muparrow{}isr(strong-continuity-test-bound(M;n - 1;f;b)))
{}\mRightarrow{} (\mexists{}m:\mBbbN{}
(b < m \mwedge{} m < n - 1 \mwedge{} (\muparrow{}isl(M m f)) \mwedge{} (\muparrow{}isl(strong-continuity-test-bound(M;m;f;b))))))@i
5. f : \mBbbN{}n {}\mrightarrow{} \mBbbN{}@i
6. b : \mBbbN{}n@i
7. \muparrow{}isr(strong-continuity-test-bound(M;n;f;b))@i
\mvdash{} \mexists{}m:\mBbbN{}. (b < m \mwedge{} m < n \mwedge{} (\muparrow{}isl(M m f)) \mwedge{} (\muparrow{}isl(strong-continuity-test-bound(M;m;f;b))))
By
Latex:
((RWO "strong-continuity-test-bound-unroll" (-1) THENA Auto)
THEN (SplitOnHypITE (-1) THEN AllReduce THEN Try (CpltAuto))
THEN (SplitOnHypITE (-2) THEN AllReduce THEN Try (CpltAuto))
THEN (SplitOnHypITE (-3) THEN AllReduce THEN Try (CpltAuto))
THEN SplitOnHypITE (-4)
THEN AllReduce
THEN Try (CpltAuto))
Home
Index