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. (forall pc_index_mask_drop_source. (exists pc_lt_mask_drop_source_bound. pc_lt_mask_drop_source_bound + S (pc_index_mask_drop_source) = (S l)) -> exists pc_bit_mask_drop_source. (((exists fs_h_pc_mask_drop_source_entry. fs_h_pc_mask_drop_source_entry + S (pc_bit_mask_drop_source) = S ((S (pc_index_mask_drop_source)) * c)) /\ exists fs_q_pc_mask_drop_source_entry. b = fs_q_pc_mask_drop_source_entry * S ((S (pc_index_mask_drop_source)) * c) + (pc_bit_mask_drop_source))) /\ (((((~(S (pc_index_mask_drop_source) = 1) /\ forall bpr_left_pc_mask_drop_source_choice_prime bpr_right_pc_mask_drop_source_choice_prime. S (pc_index_mask_drop_source) = bpr_left_pc_mask_drop_source_choice_prime * bpr_right_pc_mask_drop_source_choice_prime -> bpr_left_pc_mask_drop_source_choice_prime = 1 \/ bpr_right_pc_mask_drop_source_choice_prime = 1)) /\ pc_bit_mask_drop_source = 1) \/ (~((~(S (pc_index_mask_drop_source) = 1) /\ forall bpr_left_pc_mask_drop_source_choice_prime bpr_right_pc_mask_drop_source_choice_prime. S (pc_index_mask_drop_source) = bpr_left_pc_mask_drop_source_choice_prime * bpr_right_pc_mask_drop_source_choice_prime -> bpr_left_pc_mask_drop_source_choice_prime = 1 \/ bpr_right_pc_mask_drop_source_choice_prime = 1)) /\ pc_bit_mask_drop_source = 0)))) -> (forall pc_index_mask_drop_target. (exists pc_lt_mask_drop_target_bound. pc_lt_mask_drop_target_bound + S (pc_index_mask_drop_target) = (l)) -> exists pc_bit_mask_drop_target. (((exists fs_h_pc_mask_drop_target_entry. fs_h_pc_mask_drop_target_entry + S (pc_bit_mask_drop_target) = S ((S (pc_index_mask_drop_target)) * c)) /\ exists fs_q_pc_mask_drop_target_entry. b = fs_q_pc_mask_drop_target_entry * S ((S (pc_index_mask_drop_target)) * c) + (pc_bit_mask_drop_target))) /\ (((((~(S (pc_index_mask_drop_target) = 1) /\ forall bpr_left_pc_mask_drop_target_choice_prime bpr_right_pc_mask_drop_target_choice_prime. S (pc_index_mask_drop_target) = bpr_left_pc_mask_drop_target_choice_prime * bpr_right_pc_mask_drop_target_choice_prime -> bpr_left_pc_mask_drop_target_choice_prime = 1 \/ bpr_right_pc_mask_drop_target_choice_prime = 1)) /\ pc_bit_mask_drop_target = 1) \/ (~((~(S (pc_index_mask_drop_target) = 1) /\ forall bpr_left_pc_mask_drop_target_choice_prime bpr_right_pc_mask_drop_target_choice_prime. S (pc_index_mask_drop_target) = bpr_left_pc_mask_drop_target_choice_prime * bpr_right_pc_mask_drop_target_choice_prime -> bpr_left_pc_mask_drop_target_choice_prime = 1 \/ bpr_right_pc_mask_drop_target_choice_prime = 1)) /\ pc_bit_mask_drop_target = 0))))Constructive proof overview
Generated structural guide
A primality mask restricts to its preceding prefix.
The unchanged tactic script uses 1 declared prerequisite and contains 12 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
le_succ Stable theorem; checked-use authorizedDirect 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
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.