Defining a decideable equality for generic inductive types in agda

Question

Below I have a vanilla inductive datatype for some formulas, and am wondering if there\'s anyway to streamline this process for defining decideable equality over any inducti