α : Type u
β : Type v
γ : Type w
s : Seq α
⊢ Computation.pure (Option.map (Prod.fst ∘ fun a => (a, ↑(Seq.tail s))) (Seq.head s)) = Computation.pure (Seq.head s)
α : Type u
β : Type v
γ : Type w
s : Seq α
⊢ head ↑s = Computation.pure (Seq.head s)
simp [head]
no goals
α : Type u
β : Type v
γ : Type w
s : Seq α
⊢ Computation.pure (Option.map (Prod.fst ∘ fun a => (a, ↑(Seq.tail s))) (Seq.head s)) = Computation.pure (Seq.head s)
cases Seq.head s <;> rfl