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 p n. ((~(p = 1) /\ forall frm_prime_left_lucas_two_digit_prime frm_prime_right_lucas_two_digit_prime. p = frm_prime_left_lucas_two_digit_prime * frm_prime_right_lucas_two_digit_prime -> frm_prime_left_lucas_two_digit_prime = 1 \/ frm_prime_right_lucas_two_digit_prime = 1)) -> exists q0 d0 q1 d1. (((((n) = (p) * (q0) + (d0)) /\ (exists ldc_lt_first_bound. ldc_lt_first_bound + S (d0) = p)) /\ (((q0) = (p) * (q1) + (d1)) /\ (exists ldc_lt_second_bound. ldc_lt_second_bound + S (d1) = p))))Constructive proof overview
Generated structural guide
Every prime base constructively provides two coherent successive digits and their remaining quotient.
The unchanged tactic script uses 2 declared prerequisites and contains 11 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
prime_nonzero Stable theorem; checked-use authorized LU000D lucas_base_p_two_digit_totalDirect dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This dependency-curried candidate body does not grant checked theorem use or Stable membership.
Read the argument
Proof checkpoints
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.
Named ingredients (1)
01Fix variables and assumptionsL1–3
02Use earlier factsL4–6
03Fix variables and assumptionsL7–7
Work with arbitrary variables or the premises of the current implication.
- L7
intro hzero
Original exact command ledger · 11 lines
- 0001
intro p - 0002
intro n - 0003
intro hprime - 0004
specialize lucas_base_p_two_digit_total p - 0005
specialize lucas_base_p_two_digit_total n - 0006
apply lucas_base_p_two_digit_total - 0007
intro hzero - 0008
specialize prime_nonzero p - 0009
apply prime_nonzero - 0010
exact hprime - 0011
exact hzero