BT001M · Bertrand theorem

mul_le_mul_right

Stable checked-use theorem · independently kernel verified

Right multiplication preserves the witness-defined order.

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

∀ a. ∀ b. ∀ c. Le(a,b) → Le(a · c,b · c)

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

PD0001 Le

2 occurrences

In local proof propositions

none

0 occurrences

Exact expanded native-PA statement
forall a b c. (exists k. k + a = b) -> exists r. r + a * c = b * c

Proof neighborhood

Direct theorem prerequisites

BT000B add_mul

Direct theorem dependents

BT0055 le_scaled_nonzero BT00PV mul_le_mul BT00PX le_mul_of_one_le_left BT00R9 square_lt_successor_square BT00RC floor_sqrt_monotone BT00RG double_triple_remainder_complement_budget BT00TY mul_lt_mul_right_nonzero BT00VK central_binom_strong_upper_step BT00X6 bertrand_main_inequality_factorized_from_total BT00YH floor_sqrt_above_root_power_two_strict BT010C three_mul_le_square_of_three_le BT0117 factor_pair_has_small_member_below_square

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

12 script commands · 8 reading checkpoints · 0 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 (1)
add mul
01Fix variables and assumptionsL1–4

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

  1. L1
    intro a
  2. L2
    intro b
  3. L3
    intro c
  4. L4
    intro h
02Separate the logical casesL5–5

Follow the explicit conjunction, disjunction, witness, or contradiction step recorded below.

  1. L5
    cases h
03Construct an explicit witnessL6–6

Supply the displayed value, then prove that it has the required property.

  1. L6
    exists x * c
04Calculate and transport equalitiesL7–8

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L7
    trans (x + a) * c
  2. L8
    symm
05Use earlier factsL9–9

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

  1. L9
    apply add_mul
06Calculate and transport equalitiesL10–10

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L10
    congr
07Use earlier factsL11–11

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

  1. L11
    exact h_witness
08Calculate and transport equalitiesL12–12

Carry out the recorded arithmetic or equality steps; inspect the exact commands for their direction and premises.

  1. L12
    refl

Library-wide reading audit

Original defined command ledger · 12 lines
  1. 0001intro a
  2. 0002intro b
  3. 0003intro c
  4. 0004intro h
  5. 0005cases h
  6. 0006exists x * c
  7. 0007trans (x + a) * c
  8. 0008symm
  9. 0009apply add_mul
  10. 0010congr
  11. 0011exact h_witness
  12. 0012refl