BT00XA

beta_product_uniform_le_pow

Alpha body-checked ยท checked-use disabled

A uniformly bounded finite product is at most the matching power.

Exact expanded PA statement

forall b c a l n q. (forall i x. (exists bpulp_bound. bpulp_bound + S i = l) -> (((exists ff_h_bpulp_source. ff_h_bpulp_source + S (x) = S ((S (i)) * c)) /\ exists ff_q_bpulp_source. b = ff_q_bpulp_source * S ((S (i)) * c) + (x))) -> exists bpulp_factor_gap. bpulp_factor_gap + x = a) -> (exists ff_u_bpulp_source_product ff_v_bpulp_source_product. ((((exists ff_h_bpulp_source_product_start. ff_h_bpulp_source_product_start + S (1) = S ((S (0)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_start. ff_u_bpulp_source_product = ff_q_bpulp_source_product_start * S ((S (0)) * ff_v_bpulp_source_product) + (1))) /\ ((((exists ff_h_bpulp_source_product_terminal. ff_h_bpulp_source_product_terminal + S (n) = S ((S (l)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_terminal. ff_u_bpulp_source_product = ff_q_bpulp_source_product_terminal * S ((S (l)) * ff_v_bpulp_source_product) + (n))) /\ forall ff_i_bpulp_source_product. (exists ff_lt_bpulp_source_product_bound. ff_lt_bpulp_source_product_bound + S ff_i_bpulp_source_product = l) -> exists ff_p_bpulp_source_product ff_r_bpulp_source_product ff_s_bpulp_source_product. ((((exists ff_h_bpulp_source_product_factor. ff_h_bpulp_source_product_factor + S (ff_p_bpulp_source_product) = S ((S (ff_i_bpulp_source_product)) * c)) /\ exists ff_q_bpulp_source_product_factor. b = ff_q_bpulp_source_product_factor * S ((S (ff_i_bpulp_source_product)) * c) + (ff_p_bpulp_source_product))) /\ ((((exists ff_h_bpulp_source_product_partial. ff_h_bpulp_source_product_partial + S (ff_r_bpulp_source_product) = S ((S (ff_i_bpulp_source_product)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_partial. ff_u_bpulp_source_product = ff_q_bpulp_source_product_partial * S ((S (ff_i_bpulp_source_product)) * ff_v_bpulp_source_product) + (ff_r_bpulp_source_product))) /\ ((((exists ff_h_bpulp_source_product_successor. ff_h_bpulp_source_product_successor + S (ff_s_bpulp_source_product) = S ((S (S ff_i_bpulp_source_product)) * ff_v_bpulp_source_product)) /\ exists ff_q_bpulp_source_product_successor. ff_u_bpulp_source_product = ff_q_bpulp_source_product_successor * S ((S (S ff_i_bpulp_source_product)) * ff_v_bpulp_source_product) + (ff_s_bpulp_source_product))) /\ ff_s_bpulp_source_product = ff_r_bpulp_source_product * ff_p_bpulp_source_product)))))) -> (exists ff_b_bpulp_target_power ff_c_bpulp_target_power. ((forall ff_i_bpulp_target_power_repeat. (exists ff_lt_bpulp_target_power_repeat_bound. ff_lt_bpulp_target_power_repeat_bound + S ff_i_bpulp_target_power_repeat = l) -> (((exists ff_h_bpulp_target_power_repeat_decoded. ff_h_bpulp_target_power_repeat_decoded + S (a) = S ((S (ff_i_bpulp_target_power_repeat)) * ff_c_bpulp_target_power)) /\ exists ff_q_bpulp_target_power_repeat_decoded. ff_b_bpulp_target_power = ff_q_bpulp_target_power_repeat_decoded * S ((S (ff_i_bpulp_target_power_repeat)) * ff_c_bpulp_target_power) + (a)))) /\ (exists ff_u_bpulp_target_power_product ff_v_bpulp_target_power_product. ((((exists ff_h_bpulp_target_power_product_start. ff_h_bpulp_target_power_product_start + S (1) = S ((S (0)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_start. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_start * S ((S (0)) * ff_v_bpulp_target_power_product) + (1))) /\ ((((exists ff_h_bpulp_target_power_product_terminal. ff_h_bpulp_target_power_product_terminal + S (q) = S ((S (l)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_terminal. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_terminal * S ((S (l)) * ff_v_bpulp_target_power_product) + (q))) /\ forall ff_i_bpulp_target_power_product. (exists ff_lt_bpulp_target_power_product_bound. ff_lt_bpulp_target_power_product_bound + S ff_i_bpulp_target_power_product = l) -> exists ff_p_bpulp_target_power_product ff_r_bpulp_target_power_product ff_s_bpulp_target_power_product. ((((exists ff_h_bpulp_target_power_product_factor. ff_h_bpulp_target_power_product_factor + S (ff_p_bpulp_target_power_product) = S ((S (ff_i_bpulp_target_power_product)) * ff_c_bpulp_target_power)) /\ exists ff_q_bpulp_target_power_product_factor. ff_b_bpulp_target_power = ff_q_bpulp_target_power_product_factor * S ((S (ff_i_bpulp_target_power_product)) * ff_c_bpulp_target_power) + (ff_p_bpulp_target_power_product))) /\ ((((exists ff_h_bpulp_target_power_product_partial. ff_h_bpulp_target_power_product_partial + S (ff_r_bpulp_target_power_product) = S ((S (ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_partial. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_partial * S ((S (ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product) + (ff_r_bpulp_target_power_product))) /\ ((((exists ff_h_bpulp_target_power_product_successor. ff_h_bpulp_target_power_product_successor + S (ff_s_bpulp_target_power_product) = S ((S (S ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product)) /\ exists ff_q_bpulp_target_power_product_successor. ff_u_bpulp_target_power_product = ff_q_bpulp_target_power_product_successor * S ((S (S ff_i_bpulp_target_power_product)) * ff_v_bpulp_target_power_product) + (ff_s_bpulp_target_power_product))) /\ ff_s_bpulp_target_power_product = ff_r_bpulp_target_power_product * ff_p_bpulp_target_power_product)))))))) -> exists bpulp_result_gap. bpulp_result_gap + n = q

Structural proof guide

A uniformly bounded finite product is at most the matching power.

Direct prerequisites: beta_repeat_entry_eq, beta_product_pointwise_le. The authored body proceeds by case analysis (3), intermediate claims (1), equality transport (1).

Proof neighborhood

Direct dependencies

Direct dependents

Formal native tactic body

Dependencies are hypotheses of this body receipt. The focused endpoint audits separately check the complete empty-context certificates.

  1. 0001intro b
  2. 0002intro c
  3. 0003intro a
  4. 0004intro l
  5. 0005intro n
  6. 0006intro q
  7. 0007intro huniform
  8. 0008intro hn
  9. 0009intro hq
  10. 0010cases hq
  11. 0011cases hq_witness
  12. 0012cases hq_witness_witness
  13. 0013specialize beta_product_pointwise_le b
  14. 0014specialize beta_product_pointwise_le c
  15. 0015specialize beta_product_pointwise_le x
  16. 0016specialize beta_product_pointwise_le x1
  17. 0017specialize beta_product_pointwise_le l
  18. 0018specialize beta_product_pointwise_le n
  19. 0019specialize beta_product_pointwise_le q
  20. 0020apply beta_product_pointwise_le
  21. 0021intro i
  22. 0022intro p
  23. 0023intro z
  24. 0024intro hi
  25. 0025intro hp
  26. 0026intro hz
  27. 0027have hza : z = a
  28. 0028specialize beta_repeat_entry_eq x
  29. 0029specialize beta_repeat_entry_eq x1
  30. 0030specialize beta_repeat_entry_eq a
  31. 0031specialize beta_repeat_entry_eq l
  32. 0032specialize beta_repeat_entry_eq i
  33. 0033specialize beta_repeat_entry_eq z
  34. 0034apply beta_repeat_entry_eq
  35. 0035exact hq_witness_witness_left
  36. 0036exact hi
  37. 0037exact hz
  38. 0038rewrite hza
  39. 0039specialize huniform i
  40. 0040specialize huniform p
  41. 0041apply huniform
  42. 0042exact hi
  43. 0043exact hp
  44. 0044exact hn
  45. 0045exact hq_witness_witness_right