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 d n T C Q H. Q = S n * (b * T) + d * C -> 2 * C = (S n * n) * T + d * H -> 2 * (b * C + Q) = (S (S n) * S n) * (b * T) + d * (b * H + 2 * C)Constructive proof overview
Generated structural guide
Twice the correction has the exact triangular coefficient and an actual next remainder.
The unchanged tactic script uses 2 declared prerequisites and contains 26 exact native proof lines.
Alpha v34 checked-use · first admitted v29 · 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 (2)
01Fix variables and assumptionsL1–9
02Calculate and transport equalitiesL10–10
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L10
trans (S n * n + 2 * S n) * (b * T) + d * (b * H + 2 * C)
03Use earlier factsL11–20
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L11
specialize lte_twice_correction_polynomial (b) - L12
specialize lte_twice_correction_polynomial (d) - L13
specialize lte_twice_correction_polynomial (S n) - L14
specialize lte_twice_correction_polynomial (S n * n) - L15
specialize lte_twice_correction_polynomial (T) - L16
specialize lte_twice_correction_polynomial (C) - L17
specialize lte_twice_correction_polynomial (Q) - L18
specialize lte_twice_correction_polynomial (H) - L19
apply lte_twice_correction_polynomial - L20
exact hQ
04Use earlier factsL21–21
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L21
exact hC
05Establish hcoefficientL22–26
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply lte adjacent coefficient identity.
Original exact command ledger · 26 lines
- 0001
intro b - 0002
intro d - 0003
intro n - 0004
intro T - 0005
intro C - 0006
intro Q - 0007
intro H - 0008
intro hQ - 0009
intro hC - 0010
trans (S n * n + 2 * S n) * (b * T) + d * (b * H + 2 * C) - 0011
specialize lte_twice_correction_polynomial (b) - 0012
specialize lte_twice_correction_polynomial (d) - 0013
specialize lte_twice_correction_polynomial (S n) - 0014
specialize lte_twice_correction_polynomial (S n * n) - 0015
specialize lte_twice_correction_polynomial (T) - 0016
specialize lte_twice_correction_polynomial (C) - 0017
specialize lte_twice_correction_polynomial (Q) - 0018
specialize lte_twice_correction_polynomial (H) - 0019
apply lte_twice_correction_polynomial - 0020
exact hQ - 0021
exact hC - 0022
have hcoefficient : S n * n + 2 * S n = S (S n) * S n - 0023
specialize lte_adjacent_coefficient_identity (n) - 0024
apply lte_adjacent_coefficient_identity - 0025
rewrite hcoefficient - 0026
refl