Step
*
2
1
of Lemma
rcos-is-1-iff
1. x : ℝ
2. rcos(x) = r1
3. ∀n:ℕ. (((2 * π * r(n)) < |x|)
⇒ ((2 * π * r(n + 1)) ≤ |x|))
⊢ ∃n:ℤ. (x = 2 * n * π)
BY
{ ((Assert r0 < 2 * π BY
(D 0 With ⌜10⌝ THEN Auto))
THEN (Assert ∀n:ℕ. ((r(n) < |(x/2 * π)|)
⇒ (r(n + 1) ≤ |(x/2 * π)|)) BY
(ParallelOp -2
THEN (Assert |2 * π| = 2 * π BY
(RWO "rabs-of-nonneg" 0 THEN Auto))
THEN (RWO "rabs-rdiv" 0 THENA Auto)
THEN (RWO "-1" 0 THENA Auto)
THEN (ParallelOp -2
THENL [(nRMul ⌜2 * π⌝ (-1)⋅ THEN Auto); (nRMul ⌜2 * π⌝ 0⋅ THEN Auto THEN nRNorm (-1) THEN Auto)]
)))
) }
1
1. x : ℝ
2. rcos(x) = r1
3. ∀n:ℕ. (((2 * π * r(n)) < |x|)
⇒ ((2 * π * r(n + 1)) ≤ |x|))
4. r0 < 2 * π
5. ∀n:ℕ. ((r(n) < |(x/2 * π)|)
⇒ (r(n + 1) ≤ |(x/2 * π)|))
⊢ ∃n:ℤ. (x = 2 * n * π)
Latex:
Latex:
1. x : \mBbbR{}
2. rcos(x) = r1
3. \mforall{}n:\mBbbN{}. (((2 * \mpi{} * r(n)) < |x|) {}\mRightarrow{} ((2 * \mpi{} * r(n + 1)) \mleq{} |x|))
\mvdash{} \mexists{}n:\mBbbZ{}. (x = 2 * n * \mpi{})
By
Latex:
((Assert r0 < 2 * \mpi{} BY
(D 0 With \mkleeneopen{}10\mkleeneclose{} THEN Auto))
THEN (Assert \mforall{}n:\mBbbN{}. ((r(n) < |(x/2 * \mpi{})|) {}\mRightarrow{} (r(n + 1) \mleq{} |(x/2 * \mpi{})|)) BY
(ParallelOp -2
THEN (Assert |2 * \mpi{}| = 2 * \mpi{} BY
(RWO "rabs-of-nonneg" 0 THEN Auto))
THEN (RWO "rabs-rdiv" 0 THENA Auto)
THEN (RWO "-1" 0 THENA Auto)
THEN (ParallelOp -2
THENL [(nRMul \mkleeneopen{}2 * \mpi{}\mkleeneclose{} (-1)\mcdot{} THEN Auto)
; (nRMul \mkleeneopen{}2 * \mpi{}\mkleeneclose{} 0\mcdot{} THEN Auto THEN nRNorm (-1) THEN Auto)]
)))
)
Home
Index