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 d e. (((((forall pfp_i_emptypermutationbounded. (exists pfp_gap_emptypermutationboundedindex. pfp_gap_emptypermutationboundedindex + S (pfp_i_emptypermutationbounded) = (0)) -> exists pfp_a_emptypermutationbounded. (((exists ff_h_pfp_emptypermutationboundedentry. ff_h_pfp_emptypermutationboundedentry + S (pfp_a_emptypermutationbounded) = S ((S (pfp_i_emptypermutationbounded)) * 0)) /\ exists ff_q_pfp_emptypermutationboundedentry. 0 = ff_q_pfp_emptypermutationboundedentry * S ((S (pfp_i_emptypermutationbounded)) * 0) + (pfp_a_emptypermutationbounded))) /\ (exists pfp_gap_emptypermutationboundedvalue. pfp_gap_emptypermutationboundedvalue + S (pfp_a_emptypermutationbounded) = (0))) /\ (((forall pfp_i_emptypermutationinjective pfp_j_emptypermutationinjective pfp_a_emptypermutationinjective. (exists pfp_gap_emptypermutationinjectivefirst. pfp_gap_emptypermutationinjectivefirst + S (pfp_i_emptypermutationinjective) = (0)) -> (exists pfp_gap_emptypermutationinjectivesecond. pfp_gap_emptypermutationinjectivesecond + S (pfp_j_emptypermutationinjective) = (0)) -> (((exists ff_h_pfp_emptypermutationinjectiveleft. ff_h_pfp_emptypermutationinjectiveleft + S (pfp_a_emptypermutationinjective) = S ((S (pfp_i_emptypermutationinjective)) * 0)) /\ exists ff_q_pfp_emptypermutationinjectiveleft. 0 = ff_q_pfp_emptypermutationinjectiveleft * S ((S (pfp_i_emptypermutationinjective)) * 0) + (pfp_a_emptypermutationinjective))) -> (((exists ff_h_pfp_emptypermutationinjectiveright. ff_h_pfp_emptypermutationinjectiveright + S (pfp_a_emptypermutationinjective) = S ((S (pfp_j_emptypermutationinjective)) * 0)) /\ exists ff_q_pfp_emptypermutationinjectiveright. 0 = ff_q_pfp_emptypermutationinjectiveright * S ((S (pfp_j_emptypermutationinjective)) * 0) + (pfp_a_emptypermutationinjective))) -> pfp_i_emptypermutationinjective = pfp_j_emptypermutationinjective) /\ (forall pfp_a_emptypermutationsurjective. (exists pfp_gap_emptypermutationsurjectivevalue. pfp_gap_emptypermutationsurjectivevalue + S (pfp_a_emptypermutationsurjective) = (0)) -> exists pfp_i_emptypermutationsurjective. (exists pfp_gap_emptypermutationsurjectiveindex. pfp_gap_emptypermutationsurjectiveindex + S (pfp_i_emptypermutationsurjective) = (0)) /\ (((exists ff_h_pfp_emptypermutationsurjectiveentry. ff_h_pfp_emptypermutationsurjectiveentry + S (pfp_a_emptypermutationsurjective) = S ((S (pfp_i_emptypermutationsurjective)) * 0)) /\ exists ff_q_pfp_emptypermutationsurjectiveentry. 0 = ff_q_pfp_emptypermutationsurjectiveentry * S ((S (pfp_i_emptypermutationsurjective)) * 0) + (pfp_a_emptypermutationsurjective)))))))) /\ (forall pfp_i_emptymatching pfp_j_emptymatching pfp_a_emptymatching. (exists pfp_gap_emptymatchingbound. pfp_gap_emptymatchingbound + S (pfp_i_emptymatching) = (0)) -> (((exists ff_h_pfp_emptymatchingmap. ff_h_pfp_emptymatchingmap + S (pfp_j_emptymatching) = S ((S (pfp_i_emptymatching)) * 0)) /\ exists ff_q_pfp_emptymatchingmap. 0 = ff_q_pfp_emptymatchingmap * S ((S (pfp_i_emptymatching)) * 0) + (pfp_j_emptymatching))) -> (((exists ff_h_pfp_emptymatchingsource. ff_h_pfp_emptymatchingsource + S (pfp_a_emptymatching) = S ((S (pfp_i_emptymatching)) * c)) /\ exists ff_q_pfp_emptymatchingsource. b = ff_q_pfp_emptymatchingsource * S ((S (pfp_i_emptymatching)) * c) + (pfp_a_emptymatching))) -> (((exists ff_h_pfp_emptymatchingtarget. ff_h_pfp_emptymatchingtarget + S (pfp_a_emptymatching) = S ((S (pfp_j_emptymatching)) * e)) /\ exists ff_q_pfp_emptymatchingtarget. d = ff_q_pfp_emptymatchingtarget * S ((S (pfp_j_emptymatching)) * e) + (pfp_a_emptymatching))))))Constructive proof overview
Generated structural guide
The actual literal zero beta code is a bounded/injective/surjective matching permutation between any two empty factor prefixes.
The unchanged tactic script uses 1 declared prerequisite and contains 40 exact native proof lines.
Alpha v34 checked-use · first admitted v28 · 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.
Named ingredients (1)
01Fix variables and assumptionsL1–4
02Separate the logical casesL5–6
03Fix variables and assumptionsL7–8
04Separate the logical casesL9–9
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L9
exfalso
05Use earlier factsL10–12
06Separate the logical casesL13–13
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L13
split
07Fix variables and assumptionsL14–20
08Separate the logical casesL21–21
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L21
exfalso
09Use earlier factsL22–24
10Fix variables and assumptionsL25–26
11Separate the logical casesL27–27
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L27
exfalso
12Use earlier factsL28–30
13Fix variables and assumptionsL31–36
14Separate the logical casesL37–37
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L37
exfalso
Original exact command ledger · 40 lines
- 0001
intro b - 0002
intro c - 0003
intro d - 0004
intro e - 0005
split - 0006
split - 0007
intro i - 0008
intro hi - 0009
exfalso - 0010
specialize factor_permutation_below_zero_impossible (i) - 0011
apply factor_permutation_below_zero_impossible - 0012
exact hi - 0013
split - 0014
intro i - 0015
intro j - 0016
intro a - 0017
intro hi - 0018
intro hj - 0019
intro hfirst - 0020
intro hsecond - 0021
exfalso - 0022
specialize factor_permutation_below_zero_impossible (i) - 0023
apply factor_permutation_below_zero_impossible - 0024
exact hi - 0025
intro a - 0026
intro ha - 0027
exfalso - 0028
specialize factor_permutation_below_zero_impossible (a) - 0029
apply factor_permutation_below_zero_impossible - 0030
exact ha - 0031
intro i - 0032
intro j - 0033
intro a - 0034
intro hi - 0035
intro hmap - 0036
intro hsource - 0037
exfalso - 0038
specialize factor_permutation_below_zero_impossible (i) - 0039
apply factor_permutation_below_zero_impossible - 0040
exact hi