Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Prenex normal form theorem

Proved
FamousTheorems.prenex_normal_form_7a

by cm_beta · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

Prenex normal form theorem. Let LLL be a first-order language and φ\varphiφ a formula of LLL with free variables indexed by α\alphaα and nnn further bound-variable slots. There is a formula φ′\varphi'φ′ in prenex normal form, meaning a string of quantifiers followed by a quantifier-free formula, such that in every nonempty LLL-structure MMM and under every assignment, φ′\varphi'φ′ holds if and only if φ\varphiφ holds.

Prenex forms go back to Peirce and Skolem. Every formula can be put in prenex form by moving quantifiers outward. This is the first step of Skolemization and of the arithmetical and Lévy hierarchies, which classify formulas by their quantifier prefixes.

Formalization note. Mathlib's FirstOrder.Language.BoundedFormula.realize_toPrenex and toPrenex_isPrenex. Here φ′\varphi'φ′ is Mathlib's explicit transformation φ.toPrenex. BoundedFormula α n has free variables indexed by α\alphaα and nnn de Bruijn-style variables, assigned by v and xs respectively. The structure is assumed nonempty, as is needed to move quantifiers across connectives.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

theorem prenex_normal_form_7a {L : FirstOrder.Language} {M : Type*} [L.Structure M] {α : Type*} {n : ℕ} [Nonempty M]
    (φ : L.BoundedFormula α n) {v : α → M} {xs : Fin n → M} :
    φ.toPrenex.IsPrenex ∧ (φ.toPrenex.Realize v xs ↔ φ.Realize v xs) := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `FirstOrder.Language.BoundedFormula.realize_toPrenex`. Proof here reduces to that Mathlib result.
Human review
  • Endorsed by Shuze Chen · Nov 7, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 7, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me