theorem toList'_map (l : List α) (s : WSeq α) :
    Computation.corec (fun ⟨l, s⟩ =>
      match Seq.destruct s with
      | none => Sum.inl l.reverse
      | some (none, s') => Sum.inr (l, s')
      | some (some a, s') => Sum.inr (a :: l, s')) (l, s) = (l.reverse ++ ·) <$> toList s := by
  refine'
    Computation.eq_of_bisim
      (fun c1 c2 =>
        ∃ (l' : List α) (s : WSeq α),
          c1 = Computation.corec (fun ⟨l, s⟩ =>
            match Seq.destruct s with
            | none => Sum.inl l.reverse
            | some (none, s') => Sum.inr (l, s')
            | some (some a, s') => Sum.inr (a::l, s')) (l' ++ l, s) ∧
            c2 = Computation.map (l.reverse ++ ·) (Computation.corec (fun ⟨l, s⟩ =>
              match Seq.destruct s with
              | none => Sum.inl l.reverse
              | some (none, s') => Sum.inr (l, s')
              | some (some a, s') => Sum.inr (a::l, s')) (l', s)))
      _ ⟨[], s, rfl, rfl⟩
  intro s1 s2 h; rcases h with ⟨l', s, h⟩; rw [h.left, h.right]
  induction' s using WSeq.recOn with a s s <;> simp [toList, nil, cons, think, length]
  · refine' ⟨a::l', s, _, _⟩ <;> simp
  · 

Proof state:
case intro.intro.h3
α : Type u
β : Type v
γ : Type w
l : List α
s✝ : WSeq α
s1 s2 : Computation (List α)
l' : List α
s : WSeq α
h :
  s1 =
      Computation.corec
        (fun x =>
          match x with
          | (l, s) =>
            match Seq.destruct s with
            | none => Sum.inl (List.reverse l)
            | some (none, s') => Sum.inr (l, s')
            | some (some a, s') => Sum.inr (a :: l, s'))
        (l' ++ l, think s) ∧
    s2 =
      Computation.map (fun x => List.reverse l ++ x)
        (Computation.corec
          (fun x =>
            match x with
            | (l, s) =>
              match Seq.destruct s with
              | none => Sum.inl (List.reverse l)
              | some (none, s') => Sum.inr (l, s')
              | some (some a, s') => Sum.inr (a :: l, s'))
          (l', think s))
⊢ ∃ l'_1 s_1,
    Computation.corec
          (fun x =>
            match Seq.destruct x.2 with
            | none => Sum.inl (List.reverse x.1)
            | some (none, s') => Sum.inr (x.1, s')
            | some (some a, s') => Sum.inr (a :: x.1, s'))
          (l' ++ l, s) =
        Computation.corec
          (fun x =>
            match Seq.destruct x.2 with
            | none => Sum.inl (List.reverse x.1)
            | some (none, s') => Sum.inr (x.1, s')
            | some (some a, s') => Sum.inr (a :: x.1, s'))
          (l'_1 ++ l, s_1) ∧
      Computation.map (fun x => List.reverse l ++ x)
          (Computation.corec
            (fun x =>
              match Seq.destruct x.2 with
              | none => Sum.inl (List.reverse x.1)
              | some (none, s') => Sum.inr (x.1, s')
              | some (some a, s') => Sum.inr (a :: x.1, s'))
            (l', s)) =
        Computation.map (fun x => List.reverse l ++ x)
          (Computation.corec
            (fun x =>
              match Seq.destruct x.2 with
              | none => Sum.inl (List.reverse x.1)
              | some (none, s') => Sum.inr (x.1, s')
              | some (some a, s') => Sum.inr (a :: x.1, s'))
            (l'_1, s_1))

Next tactic:
refine' ⟨l', s, _, _⟩