conv =>
  congr
  . skip
  . skip
  . rhs
    simp only [bind.automaton]
case refl
F : Type u → Type u
inst : QPF F
R S : Type u
k : R → Free F S
x y : QPF.M (FreeF F S)
⊢ QPF.M.liftr (FreeF F S) (fun x y => QPF.M.corec (bind.automaton k) (Sum.inr x) = y) (QPF.M.destruct x)
    ((fun x => QPF.M.corec (bind.automaton k) x) <$> bind.automaton k (Sum.inr x))
case refl
F : Type u → Type u
inst : QPF F
R S : Type u
k : R → Free F S
x y : QPF.M (FreeF F S)
⊢ QPF.M.liftr (FreeF F S) (fun x y => QPF.M.corec (bind.automaton k) (Sum.inr x) = y) (QPF.M.destruct x)
    ((fun x => QPF.M.corec (bind.automaton k) x) <$> Sum.inr <$> destruct x)