`FermatsLastTheorem.lean`

Explanation legend Lean4 Domain Explanation Language (L4DEL)

L4DEL explanations are a separate layer. They do not change the Lean source. Intuition is explanatory prose; numbered items are a reading path; sources link the wording back to evidence.

L4DEL: Lean4 Domain Explanation Language

Annotation provenance. This overlay contains 8 curated AI-written annotations and 1204 mechanical source-derived annotations. They have not been human-reviewed as explanations; treat them as unverified and not mathematical authority. Retained generation history: The 71 original curated annotations were produced in a Claude Sonnet 5.5 session at medium effort; Claude Opus 5.5 is recorded in that session as the advisor model, not the direct author. The bulk source-derived expansion was generated mechanically from pinned source comments by tooling developed in a GPT-5.6 Sol session at ultra reasoning; GPT-5.6 Sol did not originate the quoted source prose. On 2026-10-17 the mechanically generated source-comment annotations of the Formal Conjectures, Carleson, FLT, PFR, CompFiles, Mathematics in Lean and Theorem Proving in Lean overlays were regenerated by the same generator after three corrections made in a Claude Sonnet 5.5 session: titles no longer cut a sentence inside mathematics or end on a dangling word, workflow markers are removed from the quoted prose, and declaration names follow the scanner's namespace resolution. The boilerplate step line was dropped, and comments that were only a row of dashes no longer yield annotations. No new prose was written and no human review is claimed.

Credit: The upstream authors and contributors retain credit for the project and mathematics. lean4-explainer only renders their pinned source and adds the separately disclosed explanation layer.

Project sources: Pinned project documentation, Pinned FLT blueprint introduction

1 declarations, 0 contain sorry, 0 declared as axioms

Fermat's Last Theorem

There are many ways of stating Fermat's Last Theorem. In this file, we give the traditional statement using the positive integers ℕ+, and deduce it from a proof of Mathlib's version FermatLastTheorem of the statement (which is a statement about the nonnegative integers ℕ.)

Note that many of the files imported by this file contain "sorried" theorems, that is, theorems whose proofs are not yet complete. So whilst the below looks like a complete proof of Fermat's Last Theorem, it currently relies on many incomplete proofs along the way, and is likely to do so for several years.

Imports (1)

theorem PNat.pow_add_pow_ne_pow Fermat's Last Theorem for positive naturals line 24 source
Source documentation
Fermat's Last Theorem for positive naturals.

depends on sorry what this means
Statement uses: PNat, Nat, GT.gt, OfNat.ofNat, Ne, HAdd.hAdd, HPow.hPow
Proof uses: PNat.pow_add_pow_ne_pow_of_FermatLastTheorem, flt
11 instances, coercions and auxiliary constants left out.
```
theorem PNat.pow_add_pow_ne_pow
    (x y z : ℕ+)
    (n : ℕ) (hn : n > 2) :
    x^n + y^n ≠ z^n :=
…
```