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 input m. ~(m = 0) -> exists quotient r. (exists sif_positive_total sif_negative_total sif_quotient_positive_total sif_quotient_negative_total. (((input = 2 * sif_positive_total /\ sif_negative_total = 0) \/ exists sd_half_sif_total_input. ((input = 2 * sd_half_sif_total_input + 1 /\ sif_positive_total = 0) /\ sif_negative_total = S sd_half_sif_total_input)) /\ (((quotient = 2 * sif_quotient_positive_total /\ sif_quotient_negative_total = 0) \/ exists sd_half_sif_total_quotient. ((quotient = 2 * sd_half_sif_total_quotient + 1 /\ sif_quotient_positive_total = 0) /\ sif_quotient_negative_total = S sd_half_sif_total_quotient)) /\ (((sif_positive_total) + (m) * (sif_quotient_negative_total) = ((sif_negative_total) + (m) * (sif_quotient_positive_total)) + (r) /\ exists sif_gap_total. sif_gap_total + S (r) = (m))))))Constructive proof overview
Generated structural guide
Every canonical signed integer has a canonical floor quotient and a witnessed strict natural remainder for every positive divisor.
The unchanged tactic script uses 2 declared prerequisites and contains 28 exact native proof lines.
Alpha v34 checked-use · first admitted v28 · independently kernel and Lean verified; not Stable
Proof neighborhood
Direct dependencies
signed_decode_total Alpha theorem; checked-use authorized GI0004 signed_integer_canonical_floor_existsDirect 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–3
02Use earlier factsL4–4
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L4
specialize signed_decode_total input
03Separate the logical casesL5–6
04Establish hfloorL7–12
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply signed integer canonical floor exists.
- L7
have hfloor : exists code qp qn r. ((code = 2 * qp /\ qn = 0) \/ exists sd_half_sif_input_canonical. ((code = 2 * sd_half_sif_input_canonical + 1 /\ qp = 0) /\ qn = S sd_half_sif_input_canonical)) /\ (((x) + (m) * (qn) = ((x1) + (m) * (qp)) + (r) /\ exists sif_gap_input_canonical. sif_gap_input_canonical + S (r) = (m))) - L8
specialize signed_integer_canonical_floor_exists x - L9
specialize signed_integer_canonical_floor_exists x1 - L10
specialize signed_integer_canonical_floor_exists m - L11
apply signed_integer_canonical_floor_exists - L12
exact hm
05Separate the logical casesL13–17
06Construct an explicit witnessL18–23
07Separate the logical casesL24–24
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L24
split
08Use earlier factsL25–25
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L25
exact signed_decode_total_witness_witness
09Separate the logical casesL26–26
Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.
- L26
split
Original exact command ledger · 28 lines
- 0001
intro input - 0002
intro m - 0003
intro hm - 0004
specialize signed_decode_total input - 0005
cases signed_decode_total - 0006
cases signed_decode_total_witness - 0007
have hfloor : exists code qp qn r. ((code = 2 * qp /\ qn = 0) \/ exists sd_half_sif_input_canonical. ((code = 2 * sd_half_sif_input_canonical + 1 /\ qp = 0) /\ qn = S sd_half_sif_input_canonical)) /\ (((x) + (m) * (qn) = ((x1) + (m) * (qp)) + (r) /\ exists sif_gap_input_canonical. sif_gap_input_canonical + S (r) = (m))) - 0008
specialize signed_integer_canonical_floor_exists x - 0009
specialize signed_integer_canonical_floor_exists x1 - 0010
specialize signed_integer_canonical_floor_exists m - 0011
apply signed_integer_canonical_floor_exists - 0012
exact hm - 0013
cases hfloor - 0014
cases hfloor_witness - 0015
cases hfloor_witness_witness - 0016
cases hfloor_witness_witness_witness - 0017
cases hfloor_witness_witness_witness_witness - 0018
exists x2 - 0019
exists x5 - 0020
exists x - 0021
exists x1 - 0022
exists x3 - 0023
exists x4 - 0024
split - 0025
exact signed_decode_total_witness_witness - 0026
split - 0027
exact hfloor_witness_witness_witness_witness_left - 0028
exact hfloor_witness_witness_witness_witness_right