Step
*
1
4
1
1
of Lemma
monotone-bar-induction-strict
1. B : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ
2. Q : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ
3. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} .
(B[n;s]
⇒ (∀m:ℕ. (strictly-increasing-seq(n + 1;s.m@n)
⇒ B[n + 1;s.m@n])))
4. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} . (B[n;s]
⇒ (↓Q[n;s]))
5. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} .
((∀m:ℕ. (strictly-increasing-seq(n + 1;s.m@n)
⇒ (↓Q[n + 1;s.m@n])))
⇒ (↓Q[n;s]))
6. ∀alpha:StrictInc. ∃m:ℕ. B[m;alpha]
7. alpha : ℕ ⟶ ℕ
8. m : ℕ
9. B[m;make-strict(alpha)]
10. strictly-increasing-seq(m;alpha)
⊢ B[m;alpha]
BY
{ (NthHypEq (-2) THEN Symmetry THEN EqCD THEN Auto) }
1
.....subterm..... T:t
2:n
1. B : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ
2. Q : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ
3. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} .
(B[n;s]
⇒ (∀m:ℕ. (strictly-increasing-seq(n + 1;s.m@n)
⇒ B[n + 1;s.m@n])))
4. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} . (B[n;s]
⇒ (↓Q[n;s]))
5. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} .
((∀m:ℕ. (strictly-increasing-seq(n + 1;s.m@n)
⇒ (↓Q[n + 1;s.m@n])))
⇒ (↓Q[n;s]))
6. ∀alpha:StrictInc. ∃m:ℕ. B[m;alpha]
7. alpha : ℕ ⟶ ℕ
8. m : ℕ
9. B[m;make-strict(alpha)]
10. strictly-increasing-seq(m;alpha)
⊢ make-strict(alpha) = alpha ∈ {s:ℕm ⟶ ℕ| strictly-increasing-seq(m;s)}
Latex:
Latex:
1. B : n:\mBbbN{} {}\mrightarrow{} \{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} {}\mrightarrow{} \mBbbP{}
2. Q : n:\mBbbN{} {}\mrightarrow{} \{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} {}\mrightarrow{} \mBbbP{}
3. \mforall{}n:\mBbbN{}. \mforall{}s:\{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} .
(B[n;s] {}\mRightarrow{} (\mforall{}m:\mBbbN{}. (strictly-increasing-seq(n + 1;s.m@n) {}\mRightarrow{} B[n + 1;s.m@n])))
4. \mforall{}n:\mBbbN{}. \mforall{}s:\{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} . (B[n;s] {}\mRightarrow{} (\mdownarrow{}Q[n;s]))
5. \mforall{}n:\mBbbN{}. \mforall{}s:\{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} .
((\mforall{}m:\mBbbN{}. (strictly-increasing-seq(n + 1;s.m@n) {}\mRightarrow{} (\mdownarrow{}Q[n + 1;s.m@n]))) {}\mRightarrow{} (\mdownarrow{}Q[n;s]))
6. \mforall{}alpha:StrictInc. \mexists{}m:\mBbbN{}. B[m;alpha]
7. alpha : \mBbbN{} {}\mrightarrow{} \mBbbN{}
8. m : \mBbbN{}
9. B[m;make-strict(alpha)]
10. strictly-increasing-seq(m;alpha)
\mvdash{} B[m;alpha]
By
Latex:
(NthHypEq (-2) THEN Symmetry THEN EqCD THEN Auto)
Home
Index