Theorems / mh_ineq_a3c705

Mathlib held-out

Inequalities · easy

Statement, exactly as the model and Lean see it
theorem lg_target {M : Type u_1} [Monoid M] [LE M] [MulLeftMono M] (u : Mˣ) {a b : M} : a ≤ ↑u⁻¹ * b → ↑u * a ≤ b := by
Mathlib declaration
Units.mul_le_of_le_inv_mul
Held-out module
Mathlib.Algebra.Order.Monoid.Unbundled.Units
Banned modules (itself + downstream)
1
Reference proof premises (reachable / held-out)
0 / 1

Traces

Each configuration's full record: what was retrieved, what the model wrote, what Lean said back.

No configuration has attempted this theorem yet.

Reference proof

Mathlib's own source for this declaration, shown for comparison. It may use lemmas the prover is not allowed to use.

alias ⟨mul_le_of_le_inv_mul, le_inv_mul_of_mul_le⟩ := le_inv_mul_iff