Theorem: Fitree.seq_assoc (MLIR/Semantics/FitreeLaws.lean)

State before:
E : Type → Type
R₁ R₂ R₃ : Type
t₁ : Fitree E R₁
t₂ : Fitree E (R₁ → R₂)
t₃ : Fitree E (R₂ → R₃)
⊢ (Seq.seq t₃ fun x => Seq.seq t₂ fun x => t₁) = Seq.seq (Seq.seq (Function.comp <$> t₃) fun x => t₂) fun x => t₁
Tactic:
sorry
State after:
no goals