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. ∀ p. ∀ s. l = S s · S s → FloorSqrt(p,s) → (∀ x. Lt(x,l) → ∃ y. BetaAt(b,c,x,y) ∧ Lt(y,p)) → ¬InjectivePrefix(b,c,l)Every 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 p s. l = S s * S s -> (((exists bcs_sqrt_lower_gap_ftsp_prime_floor. bcs_sqrt_lower_gap_ftsp_prime_floor + (s) * (s) = (p)) /\ exists bcs_sqrt_upper_gap_ftsp_prime_floor. bcs_sqrt_upper_gap_ftsp_prime_floor + S (p) = S (s) * S (s))) -> (forall fom_index_ftsp_grid_bounded. (exists fom_gap_ftsp_grid_bounded_index_bound. fom_gap_ftsp_grid_bounded_index_bound + S (fom_index_ftsp_grid_bounded) = l) -> exists fom_value_ftsp_grid_bounded. ((((exists fom_beta_height_ftsp_grid_bounded_entry. fom_beta_height_ftsp_grid_bounded_entry + S (fom_value_ftsp_grid_bounded) = S ((S (fom_index_ftsp_grid_bounded)) * c)) /\ exists fom_beta_quotient_ftsp_grid_bounded_entry. b = fom_beta_quotient_ftsp_grid_bounded_entry * S ((S (fom_index_ftsp_grid_bounded)) * c) + (fom_value_ftsp_grid_bounded))) /\ (exists fom_gap_ftsp_grid_bounded_value_bound. fom_gap_ftsp_grid_bounded_value_bound + S (fom_value_ftsp_grid_bounded) = p))) -> ~(forall fp_i_ftsp_grid_injective fp_j_ftsp_grid_injective fp_value_ftsp_grid_injective. (exists fp_gap_ftsp_grid_injective_i. fp_gap_ftsp_grid_injective_i + S fp_i_ftsp_grid_injective = l) -> (exists fp_gap_ftsp_grid_injective_j. fp_gap_ftsp_grid_injective_j + S fp_j_ftsp_grid_injective = l) -> (((exists ff_h_ftsp_grid_injective_left. ff_h_ftsp_grid_injective_left + S (fp_value_ftsp_grid_injective) = S ((S (fp_i_ftsp_grid_injective)) * c)) /\ exists ff_q_ftsp_grid_injective_left. b = ff_q_ftsp_grid_injective_left * S ((S (fp_i_ftsp_grid_injective)) * c) + (fp_value_ftsp_grid_injective))) -> (((exists ff_h_ftsp_grid_injective_right. ff_h_ftsp_grid_injective_right + S (fp_value_ftsp_grid_injective) = S ((S (fp_j_ftsp_grid_injective)) * c)) /\ exists ff_q_ftsp_grid_injective_right. b = ff_q_ftsp_grid_injective_right * S ((S (fp_j_ftsp_grid_injective)) * c) + (fp_value_ftsp_grid_injective))) -> fp_i_ftsp_grid_injective = fp_j_ftsp_grid_injective)Proof neighborhood
Direct theorem prerequisites
TS000I floor_square_successor_grid_strictly_exceeds_input TS000L finite_bounded_into_oversized_not_injectiveDirect 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.
Named ingredients (2)
01Fix variables and assumptionsL1–9
02Establish hoverflowL10–19
Establish this local claim before using it. It is not an additional assumption. The following proof commands apply floor square successor grid strictly exceeds input.
- L10
- L11
rewrite hlength - L12
specialize floor_square_successor_grid_strictly_exceeds_input p - L13
specialize floor_square_successor_grid_strictly_exceeds_input s - L14
apply floor_square_successor_grid_strictly_exceeds_input - L15
exact hfloor - L16
specialize finite_bounded_into_oversized_not_injective b - L17
specialize finite_bounded_into_oversized_not_injective c - L18
specialize finite_bounded_into_oversized_not_injective l - L19
specialize finite_bounded_into_oversized_not_injective p
Original defined command ledger · 23 lines
- 0001
intro b - 0002
intro c - 0003
intro l - 0004
intro p - 0005
intro s - 0006
intro hlength - 0007
intro hfloor - 0008
intro hbounded - 0009
intro hinjective - 0010
have hoverflow : Lt(p,l)Exact native replay line
have hoverflow : exists k. k + S p = l - 0011
rewrite hlength - 0012
specialize floor_square_successor_grid_strictly_exceeds_input p - 0013
specialize floor_square_successor_grid_strictly_exceeds_input s - 0014
apply floor_square_successor_grid_strictly_exceeds_input - 0015
exact hfloor - 0016
specialize finite_bounded_into_oversized_not_injective b - 0017
specialize finite_bounded_into_oversized_not_injective c - 0018
specialize finite_bounded_into_oversized_not_injective l - 0019
specialize finite_bounded_into_oversized_not_injective p - 0020
apply finite_bounded_into_oversized_not_injective - 0021
exact hbounded - 0022
exact hoverflow - 0023
exact hinjective