induction as <;> simp
α : Type u_1
p : α → Prop
as : List α
⊢ forAll p (reverse as) = forAll p as
case cons
α : Type u_1
p : α → Prop
head✝ : α
tail✝ : List α
tail_ih✝ : forAll p (reverse tail✝) = forAll p tail✝
⊢ forAll p (reverse tail✝) ∧ forAll p [head✝] ↔ forAll p (head✝ :: tail✝)