Step
*
1
2
of Lemma
DAlembert-equation-iff
1. ∀f:ℝ ⟶ ℝ
(((∃c:ℝ. ∀x:ℝ. (f(x) = rcos(c * x))) ∨ (∃c:ℝ. ∀x:ℝ. (f(x) = cosh(c * x))))
⇒ (((∀x,y:ℝ. ((x = y)
⇒ (f(x) = f(y)))) ∧ (∀x,y:ℝ. ((f(x + y) + f(x - y)) = (r(2) * f(x) * f(y)))))
∧ (f(r0) = r1)))
2. f : ℝ ⟶ ℝ
3. ∀x,y:ℝ. ((x = y)
⇒ (f(x) = f(y)))
4. ∀x,y:ℝ. ((f(x + y) + f(x - y)) = (r(2) * f(x) * f(y)))
5. f(r0) = r1
6. ∀x:ℝ. (f(-(x)) = f(x))
7. n : ℤ
8. y : ℝ
⊢ f(r(n + 1) * y) = ((r(2) * f(y) * f(r(n) * y)) - f(r(n - 1) * y))
BY
{ (Thin 1
THEN InstHyp [⌜r(n) * y⌝;⌜y⌝] 3⋅
THEN Auto
THEN (Assert ((r(n) * y) + y) = (r(n + 1) * y) BY
(nRNorm 0 THEN Auto))
THEN (Assert ((r(n) * y) - y) = (r(n - 1) * y) BY
(nRNorm 0 THEN Auto))
THEN (RWO "-1 -2" (-3) THEN Auto)
THEN Fold `rfun-ap` 0
THEN BHyp 2
THEN Auto) }
Latex:
Latex:
1. \mforall{}f:\mBbbR{} {}\mrightarrow{} \mBbbR{}
(((\mexists{}c:\mBbbR{}. \mforall{}x:\mBbbR{}. (f(x) = rcos(c * x))) \mvee{} (\mexists{}c:\mBbbR{}. \mforall{}x:\mBbbR{}. (f(x) = cosh(c * x))))
{}\mRightarrow{} (((\mforall{}x,y:\mBbbR{}. ((x = y) {}\mRightarrow{} (f(x) = f(y))))
\mwedge{} (\mforall{}x,y:\mBbbR{}. ((f(x + y) + f(x - y)) = (r(2) * f(x) * f(y)))))
\mwedge{} (f(r0) = r1)))
2. f : \mBbbR{} {}\mrightarrow{} \mBbbR{}
3. \mforall{}x,y:\mBbbR{}. ((x = y) {}\mRightarrow{} (f(x) = f(y)))
4. \mforall{}x,y:\mBbbR{}. ((f(x + y) + f(x - y)) = (r(2) * f(x) * f(y)))
5. f(r0) = r1
6. \mforall{}x:\mBbbR{}. (f(-(x)) = f(x))
7. n : \mBbbZ{}
8. y : \mBbbR{}
\mvdash{} f(r(n + 1) * y) = ((r(2) * f(y) * f(r(n) * y)) - f(r(n - 1) * y))
By
Latex:
(Thin 1
THEN InstHyp [\mkleeneopen{}r(n) * y\mkleeneclose{};\mkleeneopen{}y\mkleeneclose{}] 3\mcdot{}
THEN Auto
THEN (Assert ((r(n) * y) + y) = (r(n + 1) * y) BY
(nRNorm 0 THEN Auto))
THEN (Assert ((r(n) * y) - y) = (r(n - 1) * y) BY
(nRNorm 0 THEN Auto))
THEN (RWO "-1 -2" (-3) THEN Auto)
THEN Fold `rfun-ap` 0
THEN BHyp 2
THEN Auto)
Home
Index