SK001B

prime_exponent_common_divisor_drop

Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable

A common divisor of a successor beta prefix divides every entry of 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.

Exact expanded first-order arithmetic statement

forall b c l d. (forall ppf_index_common_successor ppf_entry_common_successor. (exists pvs_gap_common_successorbound. pvs_gap_common_successorbound + S (ppf_index_common_successor) = (S l)) -> (((exists ff_h_pvs_common_successorentry. ff_h_pvs_common_successorentry + S (ppf_entry_common_successor) = S ((S (ppf_index_common_successor)) * c)) /\ exists ff_q_pvs_common_successorentry. b = ff_q_pvs_common_successorentry * S ((S (ppf_index_common_successor)) * c) + (ppf_entry_common_successor))) -> (exists pvs_factor_common_successordivisor. (ppf_entry_common_successor) = (d) * pvs_factor_common_successordivisor)) -> (forall ppf_index_common_previous ppf_entry_common_previous. (exists pvs_gap_common_previousbound. pvs_gap_common_previousbound + S (ppf_index_common_previous) = (l)) -> (((exists ff_h_pvs_common_previousentry. ff_h_pvs_common_previousentry + S (ppf_entry_common_previous) = S ((S (ppf_index_common_previous)) * c)) /\ exists ff_q_pvs_common_previousentry. b = ff_q_pvs_common_previousentry * S ((S (ppf_index_common_previous)) * c) + (ppf_entry_common_previous))) -> (exists pvs_factor_common_previousdivisor. (ppf_entry_common_previous) = (d) * pvs_factor_common_previousdivisor))

Constructive proof overview

Generated structural guide

A common divisor of a successor beta prefix divides every entry of its predecessor.

The unchanged tactic script uses 1 declared prerequisite and contains 17 exact native proof lines.

Alpha v34 checked-use · first admitted v29 · independently kernel and Lean verified; not Stable

Proof neighborhood

Direct dependencies

le_succ Stable theorem; checked-use authorized

Direct dependents

Formal native tactic body

Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This exact body belongs to a complete independently kernel-checked constructive proof bundle and has Alpha checked-use authority; it does not imply Stable membership.

Read the argument

Proof checkpoints

17 script commands · 2 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.

01Fix variables and assumptionsL1–9

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

  1. L1
    intro b
  2. L2
    intro c
  3. L3
    intro l
  4. L4
    intro d
  5. L5
    intro hcommon
  6. L6
    intro i
  7. L7
    intro e
  8. L8
    intro hi
  9. L9
    intro hat
02Use earlier factsL10–17

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

  1. L10
    specialize hcommon (i)
  2. L11
    specialize hcommon (e)
  3. L12
    apply hcommon
  4. L13
    specialize le_succ (S i)
  5. L14
    specialize le_succ (l)
  6. L15
    apply le_succ
  7. L16
    exact hi
  8. L17
    exact hat

Library-wide reading audit

Original exact command ledger · 17 lines
  1. 0001intro b
  2. 0002intro c
  3. 0003intro l
  4. 0004intro d
  5. 0005intro hcommon
  6. 0006intro i
  7. 0007intro e
  8. 0008intro hi
  9. 0009intro hat
  10. 0010specialize hcommon (i)
  11. 0011specialize hcommon (e)
  12. 0012apply hcommon
  13. 0013specialize le_succ (S i)
  14. 0014specialize le_succ (l)
  15. 0015apply le_succ
  16. 0016exact hi
  17. 0017exact hat