Theorem: Complex.hasSum_sin'
File: Mathlib/Analysis/SpecialFunctions/Trigonometric/Series.lean

tactic: rw [Complex.sin, Complex.exp_eq_exp_ℂ]
state_before: z : ℂ
⊢ HasSum (fun n => (z * I) ^ (2 * n + 1) / ↑(2 * n + 1)! / I) (sin z)

tactic: have := (((expSeries_div_hasSum_exp ℂ (-z * Complex.I)).sub
  (expSeries_div_hasSum_exp ℂ (z * Complex.I))).mul_right Complex.I).div_const 2
state_before: z : ℂ
⊢ HasSum (fun n => (z * I) ^ (2 * n + 1) / ↑(2 * n + 1)! / I) ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)

tactic: replace := (Nat.divModEquiv 2).symm.hasSum_iff.mpr this
state_before: z : ℂ
this :
  HasSum (fun i => ((-z * I) ^ i / ↑i ! - (z * I) ^ i / ↑i !) * I / 2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
⊢ HasSum (fun n => (z * I) ^ (2 * n + 1) / ↑(2 * n + 1)! / I) ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)

tactic: dsimp [Function.comp] at this
state_before: z : ℂ
this :
  HasSum ((fun i => ((-z * I) ^ i / ↑i ! - (z * I) ^ i / ↑i !) * I / 2) ∘ ↑(Nat.divModEquiv 2).symm)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
⊢ HasSum (fun n => (z * I) ^ (2 * n + 1) / ↑(2 * n + 1)! / I) ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)

tactic: simp_rw [← mul_comm 2 _] at this
state_before: z : ℂ
this :
  HasSum
    (fun x =>
      ((-z * I) ^ (x.fst * 2 + ↑x.snd) / ↑(x.fst * 2 + ↑x.snd)! -
            (z * I) ^ (x.fst * 2 + ↑x.snd) / ↑(x.fst * 2 + ↑x.snd)!) *
          I /
        2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
⊢ HasSum (fun n => (z * I) ^ (2 * n + 1) / ↑(2 * n + 1)! / I) ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)

tactic: refine' this.prod_fiberwise fun k => _
state_before: z : ℂ
this :
  HasSum
    (fun x =>
      ((-z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)! -
            (z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)!) *
          I /
        2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
⊢ HasSum (fun n => (z * I) ^ (2 * n + 1) / ↑(2 * n + 1)! / I) ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)

tactic: dsimp only
state_before: z : ℂ
this :
  HasSum
    (fun x =>
      ((-z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)! -
            (z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)!) *
          I /
        2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
k : ℕ
⊢ HasSum
    (fun c =>
      ((-z * I) ^ (2 * (k, c).fst + ↑(k, c).snd) / ↑(2 * (k, c).fst + ↑(k, c).snd)! -
            (z * I) ^ (2 * (k, c).fst + ↑(k, c).snd) / ↑(2 * (k, c).fst + ↑(k, c).snd)!) *
          I /
        2)
    ((z * I) ^ (2 * k + 1) / ↑(2 * k + 1)! / I)

tactic: convert hasSum_fintype (_ : Fin 2 → ℂ) using 1
state_before: z : ℂ
this :
  HasSum
    (fun x =>
      ((-z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)! -
            (z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)!) *
          I /
        2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
k : ℕ
⊢ HasSum (fun c => ((-z * I) ^ (2 * k + ↑c) / ↑(2 * k + ↑c)! - (z * I) ^ (2 * k + ↑c) / ↑(2 * k + ↑c)!) * I / 2)
    ((z * I) ^ (2 * k + 1) / ↑(2 * k + 1)! / I)

tactic: rw [Fin.sum_univ_two]
state_before: case h.e'_6
z : ℂ
this :
  HasSum
    (fun x =>
      ((-z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)! -
            (z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)!) *
          I /
        2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
k : ℕ
⊢ (z * I) ^ (2 * k + 1) / ↑(2 * k + 1)! / I =
    Finset.sum Finset.univ fun b =>
      ((-z * I) ^ (2 * k + ↑b) / ↑(2 * k + ↑b)! - (z * I) ^ (2 * k + ↑b) / ↑(2 * k + ↑b)!) * I / 2

tactic: simp_rw [Fin.val_zero, Fin.val_one, add_zero, pow_succ', pow_mul, mul_pow, neg_sq, sub_self,
  MulZeroClass.zero_mul, zero_div, zero_add, neg_mul, mul_neg, neg_div, ← neg_add', ← two_mul,
  neg_mul, neg_div, mul_assoc, mul_div_cancel_left _ (two_ne_zero : (2 : ℂ) ≠ 0), Complex.div_I]
state_before: case h.e'_6
z : ℂ
this :
  HasSum
    (fun x =>
      ((-z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)! -
            (z * I) ^ (2 * x.fst + ↑x.snd) / ↑(2 * x.fst + ↑x.snd)!) *
          I /
        2)
    ((_root_.exp ℂ (-z * I) - _root_.exp ℂ (z * I)) * I / 2)
k : ℕ
⊢ (z * I) ^ (2 * k + 1) / ↑(2 * k + 1)! / I =
    ((-z * I) ^ (2 * k + ↑0) / ↑(2 * k + ↑0)! - (z * I) ^ (2 * k + ↑0) / ↑(2 * k + ↑0)!) * I / 2 +
      ((-z * I) ^ (2 * k + ↑1) / ↑(2 * k + ↑1)! - (z * I) ^ (2 * k + ↑1) / ↑(2 * k + ↑1)!) * I / 2