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.
Statement with defined notation
∀ b. ∀ c. ∀ l. (∀ x. Lt(x,l) → ∃ y. ∃ z. ∃ n. BetaAt(b,c,x,y) ∧ y = z · z + n · n) → ∀ x. ∀ y. Lt(x,l) → BetaAt(b,c,x,y) → ∃ z. ∃ n. y = z · z + n · nEvery purple notation token opens its conservative definition. This reading surface never changes the unchanged intuitionistic kernel or confers checked-use authority.
Definitions used by this theorem
In the theorem statement
In local proof propositions
Exact expanded first-order statement
forall b c l. (forall ftsf_index_witness_source. (exists ftsf_gap_witness_source_bound. ftsf_gap_witness_source_bound + S ftsf_index_witness_source = (l)) -> exists ftsf_factor_witness_source ftsf_coordinate_first_witness_source ftsf_coordinate_second_witness_source. ((((exists ff_h_ftsf_witness_source_entry. ff_h_ftsf_witness_source_entry + S (ftsf_factor_witness_source) = S ((S (ftsf_index_witness_source)) * c)) /\ exists ff_q_ftsf_witness_source_entry. b = ff_q_ftsf_witness_source_entry * S ((S (ftsf_index_witness_source)) * c) + (ftsf_factor_witness_source))) /\ ftsf_factor_witness_source = ftsf_coordinate_first_witness_source * ftsf_coordinate_first_witness_source + ftsf_coordinate_second_witness_source * ftsf_coordinate_second_witness_source)) -> (forall ftsf_index_witness_result ftsf_factor_witness_result. (exists ftsf_gap_witness_result_bound. ftsf_gap_witness_result_bound + S ftsf_index_witness_result = (l)) -> (((exists ff_h_ftsf_witness_result_entry. ff_h_ftsf_witness_result_entry + S (ftsf_factor_witness_result) = S ((S (ftsf_index_witness_result)) * c)) /\ exists ff_q_ftsf_witness_result_entry. b = ff_q_ftsf_witness_result_entry * S ((S (ftsf_index_witness_result)) * c) + (ftsf_factor_witness_result))) -> (exists ftsf_first_witness_result_representation ftsf_second_witness_result_representation. (ftsf_factor_witness_result) = ftsf_first_witness_result_representation * ftsf_first_witness_result_representation + ftsf_second_witness_result_representation * ftsf_second_witness_result_representation))Proof neighborhood
Direct theorem prerequisites
Direct theorem dependents
Definition-aware tactic body
Only propositions whose conservative expansion has been checked for exact first-order equivalence are compacted. Every changed line retains its immutable exact replay command.
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–8
02Use earlier factsL9–9
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L9
specialize hwitnessed i
03Establish hfactorL10–12
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply hwitnessed.
- L10
have hfactor : ∃ p. ∃ x. ∃ y. BetaAt(b,c,i,p) ∧ p = x · x + y · yDefinitions: BetaAt(b,c,i,p)Original native command in the exact edition - L11
apply hwitnessed - L12
exact hi
04Separate the logical casesL13–16
05Establish hequalL17–25
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply beta at unique.
06Construct an explicit witnessL26–27
07Calculate and transport equalitiesL28–28
Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.
- L28
rewrite hequal
08Use earlier factsL29–29
Instantiate or apply named facts and discharge the corresponding proof obligations.
- L29
exact hfactor_witness_witness_witness_right
Original defined command ledger · 29 lines
- 0001
intro b - 0002
intro c - 0003
intro l - 0004
intro hwitnessed - 0005
intro i - 0006
intro a - 0007
intro hi - 0008
intro ha - 0009
specialize hwitnessed i - 0010
have hfactor : ∃ p. ∃ x. ∃ y. BetaAt(b,c,i,p) ∧ p = x · x + y · yExact native replay line
have hfactor : exists p x y. ((((exists ff_h_ftsf_witnessed_local. ff_h_ftsf_witnessed_local + S (p) = S ((S (i)) * c)) /\ exists ff_q_ftsf_witnessed_local. b = ff_q_ftsf_witnessed_local * S ((S (i)) * c) + (p))) /\ p = x * x + y * y) - 0011
apply hwitnessed - 0012
exact hi - 0013
cases hfactor - 0014
cases hfactor_witness - 0015
cases hfactor_witness_witness - 0016
cases hfactor_witness_witness_witness - 0017
have hequal : a = x - 0018
specialize beta_at_unique b - 0019
specialize beta_at_unique c - 0020
specialize beta_at_unique i - 0021
specialize beta_at_unique a - 0022
specialize beta_at_unique x - 0023
apply beta_at_unique - 0024
exact ha - 0025
exact hfactor_witness_witness_witness_left - 0026
exists x1 - 0027
exists x2 - 0028
rewrite hequal - 0029
exact hfactor_witness_witness_witness_right