Step
*
of Lemma
monotone-bar-induction-strict3
∀B,Q:n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ.
((∀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]))))
⇒ (∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} . (B[n;s]
⇒ ⇃(Q[n;s])))
⇒ (∀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])))
⇒ (∀alpha:StrictInc. ⇃(∃m:ℕ. B[m;alpha]))
⇒ ⇃(Q[0;λx.⊥]))
BY
{ (Auto
THEN (RWO "all-quotient-true" (-1) THENA EAuto 2)
THEN MoveToConcl (-1)
THEN BLemma `implies-quotient-true2`
THEN Auto) }
1
1. B : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ@i'
2. Q : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ@i'
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])))@i
4. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} . (B[n;s]
⇒ ⇃(Q[n;s]))@i
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]))@i
⊢ λx.⊥ ∈ {s:ℕ0 ⟶ ℕ| strictly-increasing-seq(0;s)}
2
1. B : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ@i'
2. Q : n:ℕ ⟶ {s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} ⟶ ℙ@i'
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])))@i
4. ∀n:ℕ. ∀s:{s:ℕn ⟶ ℕ| strictly-increasing-seq(n;s)} . (B[n;s]
⇒ ⇃(Q[n;s]))@i
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]))@i
6. ∀alpha:StrictInc. ∃m:ℕ. B[m;alpha]@i
⊢ ⇃(Q[0;λx.⊥])
Latex:
Latex:
\mforall{}B,Q:n:\mBbbN{} {}\mrightarrow{} \{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} {}\mrightarrow{} \mBbbP{}.
((\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]))))
{}\mRightarrow{} (\mforall{}n:\mBbbN{}. \mforall{}s:\{s:\mBbbN{}n {}\mrightarrow{} \mBbbN{}| strictly-increasing-seq(n;s)\} . (B[n;s] {}\mRightarrow{} \00D9(Q[n;s])))
{}\mRightarrow{} (\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{} \00D9(Q[n + 1;s.m@n]))) {}\mRightarrow{} \00D9(Q[n;s])))
{}\mRightarrow{} (\mforall{}alpha:StrictInc. \00D9(\mexists{}m:\mBbbN{}. B[m;alpha]))
{}\mRightarrow{} \00D9(Q[0;\mlambda{}x.\mbot{}]))
By
Latex:
(Auto
THEN (RWO "all-quotient-true" (-1) THENA EAuto 2)
THEN MoveToConcl (-1)
THEN BLemma `implies-quotient-true2`
THEN Auto)
Home
Index