AFTD Auto-Formalizing Theoretical Domains

nat_prime_power_parts_one

theoremverified

S(1) = ∅.

Statement

theorem nat_prime_power_parts_one : nat_prime_power_parts 1 = ∅
Source
Sanity lemma for nat_prime_power_parts (arXiv:2610.11098 (An improved lower bound for separating words by permutation automata)).
Verified
11 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • nat_prime_power_partsS(q): the set of maximal prime-power divisors of q, i.e. p^(v_p(q)) for each prime p dividing q.
Used by 1

The proof, explained

The theorem asserts that the set of prime-power parts of 1 is empty. By definition, the prime-power parts of 1 are obtained by mapping each prime factor p of 1 to p^(v_p(1)). Because 1 has no prime factors, this initial set is empty, and the image of the empty set is empty.

  1. nat_prime_power_parts 1 = ∅ automation

    Unfolding the definition of `nat_prime_power_parts`, the set of prime-power parts of 1 is the image of the set of prime factors of 1 under the map p ↦ p^(v_p(1)). Since 1 has no prime factors, its set of prime factors is empty, and the image of the empty set is empty. The `simp` tactic automatically applies these facts and completes the proof.

    line 2

    uses nat_prime_power_parts

      simp [nat_prime_power_parts]
nat_prime_power_parts
the finite set of prime powers p^(v_p(q)) corresponding to the prime factors p of q

Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem nat_prime_power_parts_one : nat_prime_power_parts 1 = ∅ := by  simp [nat_prime_power_parts]
See it in the graphDiscuss this resultChallenge it