Theorem: List.map_disj_append (Logic/Logic/LogicSymbol.lean)

State before:
α : Type u_1
inst✝² : LogicalConnective α
F : Type u_2
inst✝¹ : FunLike F α Prop
inst✝ : LogicalConnective.HomClass F α Prop
f : F
l₁ l₂ : List α
⊢ f (l₁ ++ l₂).disj ↔ f (l₁.disj ⋎ l₂.disj)
Tactic:
induction l₁ <;> induction l₂ <;> aesop
State after:
no goals