BT00XK · Bertrand theorem

pow_tail_strict_of_square

Alpha v34 checked-use theorem · independently kernel and Lean verified; not Stable

Every exponent-two-or-larger power lies above the square tail.

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

∀ p. ∀ e. ∀ x. ∀ s. ∀ n. Lt(0,p)Lt(1,e)Pow(p,2,s)Pow(p,e,x)Lt(n,s)Lt(n,x)

Every purple notation token opens its conservative definition. Expanding the displayed statement recovers the exact first-order Peano-arithmetic formula checked by the unchanged kernel.

Definitions used by this theorem

In the theorem statement

6 occurrences

In local proof propositions

1 occurrences

Exact expanded native-PA statement
forall p e x s n. (exists bcf_le_gap_bpsts_base. bcf_le_gap_bpsts_base + (1) = p) -> (exists bcf_le_gap_bpsts_exponent. bcf_le_gap_bpsts_exponent + (2) = e) -> (exists bpvi_b_bpsts_square_power bpvi_c_bpsts_square_power. ((forall bpvi_i_bpsts_square_power. (exists bpvi_repeat_gap_bpsts_square_power. bpvi_repeat_gap_bpsts_square_power + S bpvi_i_bpsts_square_power = 2) -> (((exists bpvi_h_bpsts_square_power_repeat. bpvi_h_bpsts_square_power_repeat + S (p) = S ((S (bpvi_i_bpsts_square_power)) * bpvi_c_bpsts_square_power)) /\ exists bpvi_q_bpsts_square_power_repeat. bpvi_b_bpsts_square_power = bpvi_q_bpsts_square_power_repeat * S ((S (bpvi_i_bpsts_square_power)) * bpvi_c_bpsts_square_power) + (p)))) /\ (exists bpvi_u_bpsts_square_power bpvi_v_bpsts_square_power. ((((exists bpvi_h_bpsts_square_power_start. bpvi_h_bpsts_square_power_start + S (1) = S ((S (0)) * bpvi_v_bpsts_square_power)) /\ exists bpvi_q_bpsts_square_power_start. bpvi_u_bpsts_square_power = bpvi_q_bpsts_square_power_start * S ((S (0)) * bpvi_v_bpsts_square_power) + (1))) /\ ((((exists bpvi_h_bpsts_square_power_terminal. bpvi_h_bpsts_square_power_terminal + S (s) = S ((S (2)) * bpvi_v_bpsts_square_power)) /\ exists bpvi_q_bpsts_square_power_terminal. bpvi_u_bpsts_square_power = bpvi_q_bpsts_square_power_terminal * S ((S (2)) * bpvi_v_bpsts_square_power) + (s))) /\ forall bpvi_j_bpsts_square_power. (exists bpvi_product_gap_bpsts_square_power. bpvi_product_gap_bpsts_square_power + S bpvi_j_bpsts_square_power = 2) -> exists bpvi_factor_bpsts_square_power bpvi_partial_bpsts_square_power bpvi_successor_bpsts_square_power. ((((exists bpvi_h_bpsts_square_power_factor. bpvi_h_bpsts_square_power_factor + S (bpvi_factor_bpsts_square_power) = S ((S (bpvi_j_bpsts_square_power)) * bpvi_c_bpsts_square_power)) /\ exists bpvi_q_bpsts_square_power_factor. bpvi_b_bpsts_square_power = bpvi_q_bpsts_square_power_factor * S ((S (bpvi_j_bpsts_square_power)) * bpvi_c_bpsts_square_power) + (bpvi_factor_bpsts_square_power))) /\ ((((exists bpvi_h_bpsts_square_power_partial. bpvi_h_bpsts_square_power_partial + S (bpvi_partial_bpsts_square_power) = S ((S (bpvi_j_bpsts_square_power)) * bpvi_v_bpsts_square_power)) /\ exists bpvi_q_bpsts_square_power_partial. bpvi_u_bpsts_square_power = bpvi_q_bpsts_square_power_partial * S ((S (bpvi_j_bpsts_square_power)) * bpvi_v_bpsts_square_power) + (bpvi_partial_bpsts_square_power))) /\ ((((exists bpvi_h_bpsts_square_power_successor. bpvi_h_bpsts_square_power_successor + S (bpvi_successor_bpsts_square_power) = S ((S (S bpvi_j_bpsts_square_power)) * bpvi_v_bpsts_square_power)) /\ exists bpvi_q_bpsts_square_power_successor. bpvi_u_bpsts_square_power = bpvi_q_bpsts_square_power_successor * S ((S (S bpvi_j_bpsts_square_power)) * bpvi_v_bpsts_square_power) + (bpvi_successor_bpsts_square_power))) /\ bpvi_successor_bpsts_square_power = bpvi_partial_bpsts_square_power * bpvi_factor_bpsts_square_power)))))))) -> (exists ff_b_bpsts_tail_power ff_c_bpsts_tail_power. ((forall ff_i_bpsts_tail_power_repeat. (exists ff_lt_bpsts_tail_power_repeat_bound. ff_lt_bpsts_tail_power_repeat_bound + S ff_i_bpsts_tail_power_repeat = e) -> (((exists ff_h_bpsts_tail_power_repeat_decoded. ff_h_bpsts_tail_power_repeat_decoded + S (p) = S ((S (ff_i_bpsts_tail_power_repeat)) * ff_c_bpsts_tail_power)) /\ exists ff_q_bpsts_tail_power_repeat_decoded. ff_b_bpsts_tail_power = ff_q_bpsts_tail_power_repeat_decoded * S ((S (ff_i_bpsts_tail_power_repeat)) * ff_c_bpsts_tail_power) + (p)))) /\ (exists ff_u_bpsts_tail_power_product ff_v_bpsts_tail_power_product. ((((exists ff_h_bpsts_tail_power_product_start. ff_h_bpsts_tail_power_product_start + S (1) = S ((S (0)) * ff_v_bpsts_tail_power_product)) /\ exists ff_q_bpsts_tail_power_product_start. ff_u_bpsts_tail_power_product = ff_q_bpsts_tail_power_product_start * S ((S (0)) * ff_v_bpsts_tail_power_product) + (1))) /\ ((((exists ff_h_bpsts_tail_power_product_terminal. ff_h_bpsts_tail_power_product_terminal + S (x) = S ((S (e)) * ff_v_bpsts_tail_power_product)) /\ exists ff_q_bpsts_tail_power_product_terminal. ff_u_bpsts_tail_power_product = ff_q_bpsts_tail_power_product_terminal * S ((S (e)) * ff_v_bpsts_tail_power_product) + (x))) /\ forall ff_i_bpsts_tail_power_product. (exists ff_lt_bpsts_tail_power_product_bound. ff_lt_bpsts_tail_power_product_bound + S ff_i_bpsts_tail_power_product = e) -> exists ff_p_bpsts_tail_power_product ff_r_bpsts_tail_power_product ff_s_bpsts_tail_power_product. ((((exists ff_h_bpsts_tail_power_product_factor. ff_h_bpsts_tail_power_product_factor + S (ff_p_bpsts_tail_power_product) = S ((S (ff_i_bpsts_tail_power_product)) * ff_c_bpsts_tail_power)) /\ exists ff_q_bpsts_tail_power_product_factor. ff_b_bpsts_tail_power = ff_q_bpsts_tail_power_product_factor * S ((S (ff_i_bpsts_tail_power_product)) * ff_c_bpsts_tail_power) + (ff_p_bpsts_tail_power_product))) /\ ((((exists ff_h_bpsts_tail_power_product_partial. ff_h_bpsts_tail_power_product_partial + S (ff_r_bpsts_tail_power_product) = S ((S (ff_i_bpsts_tail_power_product)) * ff_v_bpsts_tail_power_product)) /\ exists ff_q_bpsts_tail_power_product_partial. ff_u_bpsts_tail_power_product = ff_q_bpsts_tail_power_product_partial * S ((S (ff_i_bpsts_tail_power_product)) * ff_v_bpsts_tail_power_product) + (ff_r_bpsts_tail_power_product))) /\ ((((exists ff_h_bpsts_tail_power_product_successor. ff_h_bpsts_tail_power_product_successor + S (ff_s_bpsts_tail_power_product) = S ((S (S ff_i_bpsts_tail_power_product)) * ff_v_bpsts_tail_power_product)) /\ exists ff_q_bpsts_tail_power_product_successor. ff_u_bpsts_tail_power_product = ff_q_bpsts_tail_power_product_successor * S ((S (S ff_i_bpsts_tail_power_product)) * ff_v_bpsts_tail_power_product) + (ff_s_bpsts_tail_power_product))) /\ ff_s_bpsts_tail_power_product = ff_r_bpsts_tail_power_product * ff_p_bpsts_tail_power_product)))))))) -> (exists bcf_lt_gap_bpsts_source. bcf_lt_gap_bpsts_source + S (n) = s) -> (exists bcf_lt_gap_bpsts_result. bcf_lt_gap_bpsts_result + S (n) = x)

Proof neighborhood

Direct theorem prerequisites

Direct theorem dependents

Definition-aware tactic body

Only local propositions introduced by have or suffices are compacted. Every changed line has an exact-AST conservative-expansion receipt; the kernel still receives the immutable original tactic script.

Read the argument

Proof checkpoints

27 script commands · 3 reading checkpoints · 1 local claims

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.

Definition notation is shown below. Open the paired exact edition for the original native formulas. Source pairing is not a new equivalence certificate.

Named ingredients (2)
01Fix variables and assumptionsL1–10

Work with arbitrary variables or the premises of the current implication.

  1. L1
    intro p
  2. L2
    intro e
  3. L3
    intro x
  4. L4
    intro s
  5. L5
    intro n
  6. L6
    intro hbase
  7. L7
    intro hexponent
  8. L8
    intro hsquare
  9. L9
    intro hpower
  10. L10
    intro hstrict
02Establish hpower_orderL11–20

Establish this local claim before using it. It is not an additional assumption. The following proof commands apply pow le pow of exponent le.

  1. L11
    have hpower_order : Le(s,x)Definitions: Le(s,x)Original native command in the exact edition
  2. L12
    specialize pow_le_pow_of_exponent_le p
  3. L13
    specialize pow_le_pow_of_exponent_le 2
  4. L14
    specialize pow_le_pow_of_exponent_le e
  5. L15
    specialize pow_le_pow_of_exponent_le s
  6. L16
    specialize pow_le_pow_of_exponent_le x
  7. L17
    apply pow_le_pow_of_exponent_le
  8. L18
    exact hbase
  9. L19
    exact hexponent
  10. L20
    exact hsquare
03Use earlier factsL21–27

Instantiate or apply named facts and discharge the corresponding proof obligations.

  1. L21
    exact hpower
  2. L22
    specialize lt_of_lt_of_le n
  3. L23
    specialize lt_of_lt_of_le s
  4. L24
    specialize lt_of_lt_of_le x
  5. L25
    apply lt_of_lt_of_le
  6. L26
    exact hstrict
  7. L27
    exact hpower_order

Library-wide reading audit

Original defined command ledger · 27 lines
  1. 0001intro p
  2. 0002intro e
  3. 0003intro x
  4. 0004intro s
  5. 0005intro n
  6. 0006intro hbase
  7. 0007intro hexponent
  8. 0008intro hsquare
  9. 0009intro hpower
  10. 0010intro hstrict
  11. 0011have hpower_order : Le(s,x)
    Exact native replay linehave hpower_order : exists bcf_le_gap_bpsts_square_order. bcf_le_gap_bpsts_square_order + (s) = x
  12. 0012specialize pow_le_pow_of_exponent_le p
  13. 0013specialize pow_le_pow_of_exponent_le 2
  14. 0014specialize pow_le_pow_of_exponent_le e
  15. 0015specialize pow_le_pow_of_exponent_le s
  16. 0016specialize pow_le_pow_of_exponent_le x
  17. 0017apply pow_le_pow_of_exponent_le
  18. 0018exact hbase
  19. 0019exact hexponent
  20. 0020exact hsquare
  21. 0021exact hpower
  22. 0022specialize lt_of_lt_of_le n
  23. 0023specialize lt_of_lt_of_le s
  24. 0024specialize lt_of_lt_of_le x
  25. 0025apply lt_of_lt_of_le
  26. 0026exact hstrict
  27. 0027exact hpower_order