BT00VR · Bertrand theorem

double_half_predecessor_data

Alpha v34 checked-use theorem · independently kernel and Lean verified; not Stable

An even successor has a nonzero half below its predecessor.

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

∀ n. ∀ k. S n = 2 · k → ¬k = 0 ∧ Le(k,n)

Every purple notation token opens its conservative definition. Expanding the displayed statement recovers the exact first-order Peano-arithmetic formula checked by the unchanged kernel.

Definitions used by this theorem

In the theorem statement

1 occurrences

In local proof propositions

none

0 occurrences

Exact expanded native-PA statement
forall n k. S n = 2 * k -> (~(k = 0) /\ (exists bcf_le_gap_bdhpb_result. bcf_le_gap_bdhpb_result + (k) = n))

Proof neighborhood

Direct theorem prerequisites

Direct theorem dependents

Definition-aware tactic body

Only local propositions introduced by have or suffices are compacted. Every changed line has an exact-AST conservative-expansion receipt; the kernel still receives the immutable original tactic script.

Read the argument

Proof checkpoints

19 script commands · 15 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.

01Fix variables and assumptionsL1–1

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro n
02Induction on kL2–3

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

  1. L2
    induction k
  2. L3
    intro heq
03Separate the logical casesL4–4

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

  1. L4
    exfalso
04Use earlier factsL5–5

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L5
    apply PA1
05Calculate and transport equalitiesL6–6

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

  1. L6
    trans 2 * 0
06Use earlier factsL7–7

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L7
    exact heq
07Calculate and transport equalitiesL8–8

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

  1. L8
    norm_num
08Fix variables and assumptionsL9–9

Work with arbitrary variables or the premises of the current implication.

  1. L9
    intro heq
09Separate the logical casesL10–10

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

  1. L10
    split
10Fix variables and assumptionsL11–11

Work with arbitrary variables or the premises of the current implication.

  1. L11
    intro hk
11Use earlier factsL12–13

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L12
    apply PA1
  2. L13
    exact hk
12Construct an explicit witnessL14–14

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

  1. L14
    exists k
13Use earlier factsL15–15

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L15
    apply PA2
14Calculate and transport equalitiesL16–18

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

  1. L16
    trans 2 * S k
  2. L17
    simp [two_mul_eq_add_self, add_succ_left]
  3. L18
    symm
15Use earlier factsL19–19

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L19
    exact heq

Library-wide reading audit

Original defined command ledger · 19 lines
  1. 0001intro n
  2. 0002induction k
  3. 0003intro heq
  4. 0004exfalso
  5. 0005apply PA1
  6. 0006trans 2 * 0
  7. 0007exact heq
  8. 0008norm_num
  9. 0009intro heq
  10. 0010split
  11. 0011intro hk
  12. 0012apply PA1
  13. 0013exact hk
  14. 0014exists k
  15. 0015apply PA2
  16. 0016trans 2 * S k
  17. 0017simp [two_mul_eq_add_self, add_succ_left]
  18. 0018symm
  19. 0019exact heq