BT00SA · Bertrand theorem

prime_power_quotient_tail_zero

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

The first omitted prime-power quotient is canonically zero.

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

∀ p. ∀ n. ∀ d. Prime(p)Pow(p,S n,d)DivRem(n,d,0,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

3 occurrences

In local proof propositions

none

0 occurrences

Exact expanded native-PA statement
forall p n d. ((~(p = 1) /\ forall frm_prime_left_blvb_prime frm_prime_right_blvb_prime. p = frm_prime_left_blvb_prime * frm_prime_right_blvb_prime -> frm_prime_left_blvb_prime = 1 \/ frm_prime_right_blvb_prime = 1)) -> (exists bpvi_b_blvb_quotient_tail_power bpvi_c_blvb_quotient_tail_power. ((forall bpvi_i_blvb_quotient_tail_power. (exists bpvi_repeat_gap_blvb_quotient_tail_power. bpvi_repeat_gap_blvb_quotient_tail_power + S bpvi_i_blvb_quotient_tail_power = S n) -> (((exists bpvi_h_blvb_quotient_tail_power_repeat. bpvi_h_blvb_quotient_tail_power_repeat + S (p) = S ((S (bpvi_i_blvb_quotient_tail_power)) * bpvi_c_blvb_quotient_tail_power)) /\ exists bpvi_q_blvb_quotient_tail_power_repeat. bpvi_b_blvb_quotient_tail_power = bpvi_q_blvb_quotient_tail_power_repeat * S ((S (bpvi_i_blvb_quotient_tail_power)) * bpvi_c_blvb_quotient_tail_power) + (p)))) /\ (exists bpvi_u_blvb_quotient_tail_power bpvi_v_blvb_quotient_tail_power. ((((exists bpvi_h_blvb_quotient_tail_power_start. bpvi_h_blvb_quotient_tail_power_start + S (1) = S ((S (0)) * bpvi_v_blvb_quotient_tail_power)) /\ exists bpvi_q_blvb_quotient_tail_power_start. bpvi_u_blvb_quotient_tail_power = bpvi_q_blvb_quotient_tail_power_start * S ((S (0)) * bpvi_v_blvb_quotient_tail_power) + (1))) /\ ((((exists bpvi_h_blvb_quotient_tail_power_terminal. bpvi_h_blvb_quotient_tail_power_terminal + S (d) = S ((S (S n)) * bpvi_v_blvb_quotient_tail_power)) /\ exists bpvi_q_blvb_quotient_tail_power_terminal. bpvi_u_blvb_quotient_tail_power = bpvi_q_blvb_quotient_tail_power_terminal * S ((S (S n)) * bpvi_v_blvb_quotient_tail_power) + (d))) /\ forall bpvi_j_blvb_quotient_tail_power. (exists bpvi_product_gap_blvb_quotient_tail_power. bpvi_product_gap_blvb_quotient_tail_power + S bpvi_j_blvb_quotient_tail_power = S n) -> exists bpvi_factor_blvb_quotient_tail_power bpvi_partial_blvb_quotient_tail_power bpvi_successor_blvb_quotient_tail_power. ((((exists bpvi_h_blvb_quotient_tail_power_factor. bpvi_h_blvb_quotient_tail_power_factor + S (bpvi_factor_blvb_quotient_tail_power) = S ((S (bpvi_j_blvb_quotient_tail_power)) * bpvi_c_blvb_quotient_tail_power)) /\ exists bpvi_q_blvb_quotient_tail_power_factor. bpvi_b_blvb_quotient_tail_power = bpvi_q_blvb_quotient_tail_power_factor * S ((S (bpvi_j_blvb_quotient_tail_power)) * bpvi_c_blvb_quotient_tail_power) + (bpvi_factor_blvb_quotient_tail_power))) /\ ((((exists bpvi_h_blvb_quotient_tail_power_partial. bpvi_h_blvb_quotient_tail_power_partial + S (bpvi_partial_blvb_quotient_tail_power) = S ((S (bpvi_j_blvb_quotient_tail_power)) * bpvi_v_blvb_quotient_tail_power)) /\ exists bpvi_q_blvb_quotient_tail_power_partial. bpvi_u_blvb_quotient_tail_power = bpvi_q_blvb_quotient_tail_power_partial * S ((S (bpvi_j_blvb_quotient_tail_power)) * bpvi_v_blvb_quotient_tail_power) + (bpvi_partial_blvb_quotient_tail_power))) /\ ((((exists bpvi_h_blvb_quotient_tail_power_successor. bpvi_h_blvb_quotient_tail_power_successor + S (bpvi_successor_blvb_quotient_tail_power) = S ((S (S bpvi_j_blvb_quotient_tail_power)) * bpvi_v_blvb_quotient_tail_power)) /\ exists bpvi_q_blvb_quotient_tail_power_successor. bpvi_u_blvb_quotient_tail_power = bpvi_q_blvb_quotient_tail_power_successor * S ((S (S bpvi_j_blvb_quotient_tail_power)) * bpvi_v_blvb_quotient_tail_power) + (bpvi_successor_blvb_quotient_tail_power))) /\ bpvi_successor_blvb_quotient_tail_power = bpvi_partial_blvb_quotient_tail_power * bpvi_factor_blvb_quotient_tail_power)))))))) -> ((n = (d) * (0) + (n) /\ exists blvb_remainder_gap_blvb_quotient_tail_zero. blvb_remainder_gap_blvb_quotient_tail_zero + S (n) = (d)))

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

18 script commands · 6 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.

Named ingredients (2)
01Fix variables and assumptionsL1–5

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

  1. L1
    intro p
  2. L2
    intro n
  3. L3
    intro d
  4. L4
    intro hp
  5. L5
    intro hpower
02Separate the logical casesL6–6

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

  1. L6
    split
03Calculate and transport equalitiesL7–9

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

  1. L7
    symm
  2. L8
    trans 0 + n
  3. L9
    congr
04Use earlier factsL10–10

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

  1. L10
    apply PA5
05Calculate and transport equalitiesL11–11

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

  1. L11
    refl
06Use earlier factsL12–18

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

  1. L12
    apply zero_add
  2. L13
    specialize prime_power_exponent_le p
  3. L14
    specialize prime_power_exponent_le (S n)
  4. L15
    specialize prime_power_exponent_le d
  5. L16
    apply prime_power_exponent_le
  6. L17
    exact hp
  7. L18
    exact hpower

Library-wide reading audit

Original defined command ledger · 18 lines
  1. 0001intro p
  2. 0002intro n
  3. 0003intro d
  4. 0004intro hp
  5. 0005intro hpower
  6. 0006split
  7. 0007symm
  8. 0008trans 0 + n
  9. 0009congr
  10. 0010apply PA5
  11. 0011refl
  12. 0012apply zero_add
  13. 0013specialize prime_power_exponent_le p
  14. 0014specialize prime_power_exponent_le (S n)
  15. 0015specialize prime_power_exponent_le d
  16. 0016apply prime_power_exponent_le
  17. 0017exact hp
  18. 0018exact hpower