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
∀ b. ∀ c. ∀ l. ∀ i. ∀ p. AllPrime(b,c,l) → Lt(i,l) → BetaAt(b,c,i,p) → Prime(p)Every purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall b c l i p. (forall ftsf_index_all_prime_source. (exists ftsf_gap_all_prime_source_bound. ftsf_gap_all_prime_source_bound + S ftsf_index_all_prime_source = (l)) -> exists ftsf_factor_all_prime_source. ((((exists ff_h_ftsf_all_prime_source_entry. ff_h_ftsf_all_prime_source_entry + S (ftsf_factor_all_prime_source) = S ((S (ftsf_index_all_prime_source)) * c)) /\ exists ff_q_ftsf_all_prime_source_entry. b = ff_q_ftsf_all_prime_source_entry * S ((S (ftsf_index_all_prime_source)) * c) + (ftsf_factor_all_prime_source))) /\ ((~(ftsf_factor_all_prime_source = 1) /\ forall frm_prime_left_ftsf_all_prime_source_prime frm_prime_right_ftsf_all_prime_source_prime. ftsf_factor_all_prime_source = frm_prime_left_ftsf_all_prime_source_prime * frm_prime_right_ftsf_all_prime_source_prime -> frm_prime_left_ftsf_all_prime_source_prime = 1 \/ frm_prime_right_ftsf_all_prime_source_prime = 1)))) -> (exists ftsf_gap_all_prime_entry. ftsf_gap_all_prime_entry + S i = (l)) -> (((exists ff_h_ftsf_selected_entry. ff_h_ftsf_selected_entry + S (p) = S ((S (i)) * c)) /\ exists ff_q_ftsf_selected_entry. b = ff_q_ftsf_selected_entry * S ((S (i)) * c) + (p))) -> ((~(p = 1) /\ forall frm_prime_left_ftsf_selected_prime frm_prime_right_ftsf_selected_prime. p = frm_prime_left_ftsf_selected_prime * frm_prime_right_ftsf_selected_prime -> frm_prime_left_ftsf_selected_prime = 1 \/ frm_prime_right_ftsf_selected_prime = 1))Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
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.
01Fix variables and assumptionsL1–8
02Use earlier factsL9–9
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L9
specialize hall i
03Establish hentryL10–12
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hall.
- L10
have hentry : ∃ a. BetaAt(b,c,i,a) ∧ Prime(a)Definitions: BetaAt(b,c,i,a)Prime(a)Original native command in the exact edition - L11
apply hall - L12
exact hi
04Separate the logical casesL13–14
05Establish hequalL15–24
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
06Calculate and transport equalitiesL25–25
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L25
rewrite hequal
07Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact hentry_witness_right
Original defined command ledger · 26 lines
- 0001
intro b - 0002
intro c - 0003
intro l - 0004
intro i - 0005
intro p - 0006
intro hall - 0007
intro hi - 0008
intro hp - 0009
specialize hall i - 0010
have hentry : ∃ a. BetaAt(b,c,i,a) ∧ Prime(a)Exact native replay line
have hentry : exists a. ((((exists ff_h_ftsf_prime_local. ff_h_ftsf_prime_local + S (a) = S ((S (i)) * c)) /\ exists ff_q_ftsf_prime_local. b = ff_q_ftsf_prime_local * S ((S (i)) * c) + (a))) /\ ((~(a = 1) /\ forall frm_prime_left_ftsf_prime_local frm_prime_right_ftsf_prime_local. a = frm_prime_left_ftsf_prime_local * frm_prime_right_ftsf_prime_local -> frm_prime_left_ftsf_prime_local = 1 \/ frm_prime_right_ftsf_prime_local = 1))) - 0011
apply hall - 0012
exact hi - 0013
cases hentry - 0014
cases hentry_witness - 0015
have hequal : p = x - 0016
specialize beta_at_unique b - 0017
specialize beta_at_unique c - 0018
specialize beta_at_unique i - 0019
specialize beta_at_unique p - 0020
specialize beta_at_unique x - 0021
apply beta_at_unique - 0022
exact hp - 0023
exact hentry_witness_left - 0024
rewrite hequal - 0025
rewrite hequal - 0026
exact hentry_witness_right