Lax Lean Archive

Draft — mutable and not usable as a dependency; its citation marks the draft state.

Lax242665.OddPrimes

Every prime other than 2 is odd

concepts/Lax242665/OddPrimes.lean · lax-242665

proven

Loading review…

Community review

Flags

Each flag is tied to a public ORCID identity and explains why this concept may be incorrect.

No flags have been submitted.

    Community review

    Flag this concept

    State precisely what appears incorrect. This explanation will be public under your ORCID name.

    No source line selected.

    Concept map

    Proven claimDefinitionThis conceptRelated conceptA → B: B builds on A

    Evidence

    Each proof establishes this claim relative to its assumptions.

    In the paper

    • page 2 of this submission's paper

    Lemma

    Every prime number p≠2p \neq 2 is odd.

    Lean source view on GitHub

    1import Mathlib.Algebra.Ring.Parity
    2import Lax242665.Primes
    3
    4/-!
    5---
    6title: Every prime other than 2 is odd
    7type: lemma
    8---
    9Every prime number p≠2p \neq 2 is odd.
    10-/
    11
    12namespace Lax242665.OddPrimes
    13
    14/-- A prime `p` other than `2` is odd. -/
    15axiom odd_of_prime : ∀ p : ℕ, Primes.Prime p → p ≠ 2 → Odd p
    16
    17end Lax242665.OddPrimes
    18
    Show Proof

    Builds on

    Used by

    none

    From Mathlib

    Community review

    Discussion

    Ask a question or add context. Endorsements and structured flags are kept in the review panel above; your ORCID profile must share a public name.

    0 comments

    Loading discussion…