Theorem: Fin.tuple_sequence₁ (Etch/Verification/Misc.lean)

State before:
m : Type u → Type v
inst✝¹ : Monad m
inst✝ : LawfulMonad m
α : Fin 1 → Type u
x : (i : Fin 1) → m (α i)
⊢ tupleSequence x = do
    let r₀ ← x 0
    pure (cons r₀ default)
Tactic:
simp [Fin.tupleSequence, functor_norm]
State after:
no goals