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 i e f. (((((~(S (i) = 1) /\ forall bpr_left_pc_choice_functional_left_prime bpr_right_pc_choice_functional_left_prime. S (i) = bpr_left_pc_choice_functional_left_prime * bpr_right_pc_choice_functional_left_prime -> bpr_left_pc_choice_functional_left_prime = 1 \/ bpr_right_pc_choice_functional_left_prime = 1)) /\ e = 1) \/ (~((~(S (i) = 1) /\ forall bpr_left_pc_choice_functional_left_prime bpr_right_pc_choice_functional_left_prime. S (i) = bpr_left_pc_choice_functional_left_prime * bpr_right_pc_choice_functional_left_prime -> bpr_left_pc_choice_functional_left_prime = 1 \/ bpr_right_pc_choice_functional_left_prime = 1)) /\ e = 0))) -> (((((~(S (i) = 1) /\ forall bpr_left_pc_choice_functional_right_prime bpr_right_pc_choice_functional_right_prime. S (i) = bpr_left_pc_choice_functional_right_prime * bpr_right_pc_choice_functional_right_prime -> bpr_left_pc_choice_functional_right_prime = 1 \/ bpr_right_pc_choice_functional_right_prime = 1)) /\ f = 1) \/ (~((~(S (i) = 1) /\ forall bpr_left_pc_choice_functional_right_prime bpr_right_pc_choice_functional_right_prime. S (i) = bpr_left_pc_choice_functional_right_prime * bpr_right_pc_choice_functional_right_prime -> bpr_left_pc_choice_functional_right_prime = 1 \/ bpr_right_pc_choice_functional_right_prime = 1)) /\ f = 0))) -> e = fConstructive proof overview
Generated structural guide
The primality indicator is uniquely zero or one, without a classical principle.
The unchanged tactic script uses 0 declared prerequisites and contains 28 exact native proof lines.
Alpha v34 checked-use · first admitted v27 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
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
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–5
02Separate the logical casesL6–9
03Calculate and transport equalitiesL10–10
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L10
trans 1
04Use earlier factsL11–11
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
exact he_left_right
05Calculate and transport equalitiesL12–12
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L12
symm
06Use earlier factsL13–13
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L13
exact hf_left_right
07Separate the logical casesL14–15
08Use earlier factsL16–17
09Separate the logical casesL18–21
10Use earlier factsL22–23
11Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
cases hf_right
12Calculate and transport equalitiesL25–25
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L25
trans 0
13Use earlier factsL26–26
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L26
exact he_right_right
14Calculate and transport equalitiesL27–27
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L27
symm
15Use earlier factsL28–28
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L28
exact hf_right_right
Original exact command ledger · 28 lines
- 0001
intro i - 0002
intro e - 0003
intro f - 0004
intro he - 0005
intro hf - 0006
cases he - 0007
cases he_left - 0008
cases hf - 0009
cases hf_left - 0010
trans 1 - 0011
exact he_left_right - 0012
symm - 0013
exact hf_left_right - 0014
cases hf_right - 0015
exfalso - 0016
apply hf_right_left - 0017
exact he_left_left - 0018
cases he_right - 0019
cases hf - 0020
cases hf_left - 0021
exfalso - 0022
apply he_right_left - 0023
exact hf_left_left - 0024
cases hf_right - 0025
trans 0 - 0026
exact he_right_right - 0027
symm - 0028
exact hf_right_right