Theorem: LO.FirstOrder.UFormula.subfEquiv_all (Logic/FirstOrder/Computability/Formula.lean)

State before:
L : Language
μ : Type v
n : ℕ
p : Semiformula L μ (n + 1)
⊢ (↑(subfEquiv p)).all.bv ≤ n
Tactic:
simp
State after:
no goals