Exact expanded PA statement
forall b c a l i x. (forall ff_i_entry. (exists ff_lt_entry_bound. ff_lt_entry_bound + S ff_i_entry = l) -> (((exists ff_h_entry_decoded. ff_h_entry_decoded + S (a + ff_i_entry) = S ((S (ff_i_entry)) * c)) /\ exists ff_q_entry_decoded. b = ff_q_entry_decoded * S ((S (ff_i_entry)) * c) + (a + ff_i_entry)))) -> (exists h. h + S i = l) -> (((exists ff_h_range_entry_x. ff_h_range_entry_x + S (x) = S ((S (i)) * c)) /\ exists ff_q_range_entry_x. b = ff_q_range_entry_x * S ((S (i)) * c) + (x))) -> x = a + iStructural proof guide
Generated structural guide
A decoded entry of a Range prefix is its start plus its index.
Use the direct prerequisites beta_at_unique as previously established PA formulas.
The proof proceeds by intermediate claims (1).
Referenced ingredients
Proof neighborhood
Direct dependencies
Direct dependents
PA0034 beta_half_range_entry_bounds PA003T beta_range_injective PA0065 factorial_succ_decompose PA006A beta_range_transport_entry PA007C gauss_signed_half_magnitude_injective PA007V gauss_predecessor_half_range_aligned PA008F beta_range_one_entry_eq_succ PA00A1 scaled_pair_order_successor_lift_product_is_factorial PA00BC pair_order_predecessor_range_two_successor_lift_aligned PA00BG beta_range_two_product_is_factorial_succFormal native tactic body
Dependencies are introduced as named hypotheses before line 1. Linked names are exact direct references. This Stable checked-use theorem is independently kernel-checked when replayed.
- 0001
intro b - 0002
intro c - 0003
intro a - 0004
intro l - 0005
intro i - 0006
intro x - 0007
intro hrange - 0008
intro hi - 0009
intro hx - 0010
have ha : ((exists h. h + S (a + i) = S ((S i) * c)) /\ exists q. b = q * S ((S i) * c) + (a + i)) - 0011
specialize hrange i - 0012
apply hrange - 0013
exact hi - 0014
specialize beta_at_unique b - 0015
specialize beta_at_unique c - 0016
specialize beta_at_unique i - 0017
specialize beta_at_unique x - 0018
specialize beta_at_unique (a + i) - 0019
apply beta_at_unique - 0020
exact hx - 0021
exact ha