PA0057 · theorem

parity_cases

Stable checked-use theorem · independently closed

Every natural has a constructive even-or-odd witness.

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

Statement with defined notation

forall n. exists k. n = 2 * k \/ n = 2 * k + 1

Every purple notation token opens its conservative definition. This is a reading surface; the compiler expands the statement before the unchanged kernel checks it.

Definitions used by this theorem

In the theorem statement

none

0 occurrences

In local proof propositions

none

0 occurrences

Exact expanded native-PA statement
forall n. exists k. n = 2 * k \/ n = 2 * k + 1

Proof neighborhood

Direct theorem prerequisites

none

Direct theorem dependents

Definition-aware tactic body

Only local propositions introduced by have or suffices are compacted. The untrusted compiler re-expands each one before the original tactic script is replayed; defined notation is never accepted by the kernel. Open the exact replay line beneath every changed command.

Read the argument

Proof checkpoints

14 script commands · 11 reading checkpoints · 0 local claims

This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

01Induction on nL1–1

Split the argument into the base and successor obligations. The induction hypothesis is available only in the successor branch.

  1. L1
    induction n
02Construct an explicit witnessL2–2

Supply the displayed value, then prove that it has the required property.

  1. L2
    exists 0
03Separate the logical casesL3–3

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L3
    left
04Calculate and transport equalitiesL4–4

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L4
    norm_num
05Separate the logical casesL5–6

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L5
    cases IH
  2. L6
    cases IH_witness
06Construct an explicit witnessL7–7

Supply the displayed value, then prove that it has the required property.

  1. L7
    exists x
07Separate the logical casesL8–8

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L8
    right
08Calculate and transport equalitiesL9–10

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L9
    rewrite IH_witness_left
  2. L10
    simp
09Construct an explicit witnessL11–11

Supply the displayed value, then prove that it has the required property.

  1. L11
    exists x + 1
10Separate the logical casesL12–12

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L12
    left
11Calculate and transport equalitiesL13–14

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L13
    rewrite IH_witness_right
  2. L14
    simp

Library-wide reading audit

Original defined command ledger · 14 lines
  1. 0001induction n
  2. 0002exists 0
  3. 0003left
  4. 0004norm_num
  5. 0005cases IH
  6. 0006cases IH_witness
  7. 0007exists x
  8. 0008right
  9. 0009rewrite IH_witness_left
  10. 0010simp
  11. 0011exists x + 1
  12. 0012left
  13. 0013rewrite IH_witness_right
  14. 0014simp