Skip to content

chore: update Mathlib #363

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
vihdzp merged 1 commit into from
Mar 13, 2026
Merged

chore: update Mathlib #363

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 0 additions & 12 deletions CombinatorialGames/Nimber/SimplestExtension/Algebraic.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,18 +23,6 @@ open Order Ordinal Polynomial Set

public section

/-! ### For Mathlib -/

@[simp]
theorem Ordinal.one_lt_opow {x y : Ordinal} (h : 1 < x) : 1 < x ^ y ↔ y ≠ 0 := by
obtain ⟨rfl, hy⟩ := eq_zero_or_pos y
· simp
· rw [← Ordinal.opow_zero x, Ordinal.opow_lt_opow_iff_right h, pos_iff_ne_zero]

@[simp]
theorem Ordinal.one_lt_pow {x : Ordinal} {n : ℕ} (h : 1 < x) : 1 < x ^ n ↔ n ≠ 0 :=
mod_cast one_lt_opow (y := n) h

namespace Nimber

/-! ### Lemmas relating rings to `leastNoRoots` -/
Expand Down
13 changes: 0 additions & 13 deletions CombinatorialGames/Nimber/SimplestExtension/Basic.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -50,15 +50,6 @@ theorem Maximal.isGreatest {α : Type*} [LinearOrder α] {P : α → Prop} {x :

namespace Ordinal

theorem div_two_opow_log {o : Ordinal} (ho : o ≠ 0) : o / 2 ^ log 2 o = 1 := by
apply le_antisymm
· simpa [← one_add_one_eq_two] using div_opow_log_lt o one_lt_two
· simpa [one_le_iff_ne_zero, pos_iff_ne_zero] using div_opow_log_pos 2 ho

theorem two_opow_log_add {o : Ordinal} (ho : o ≠ 0) : 2 ^ log 2 o + o % 2 ^ log 2 o = o := by
convert div_add_mod .. using 2
rw [div_two_opow_log ho, mul_one]

protected theorem mul_two (o : Ordinal) : o * 2 = o + o := by
rw [← one_add_one_eq_two, mul_add, mul_one]

Expand Down Expand Up @@ -100,10 +91,6 @@ theorem log_eq_zero_iff {b x : Ordinal} : log b x = 0 ↔ b ≤ 1 ∨ x < b := b
· exact log_eq_zero' hb
· exact log_eq_zero hb

theorem opow_mul_lt_opow {b u v x : Ordinal} (hv : v < b) (hu : u < x) :
b ^ u * v < b ^ x := by
simpa using opow_mul_add_lt_opow hv (opow_pos _ hv.pos) hu

end Ordinal

namespace Nimber
Expand Down
4 changes: 2 additions & 2 deletions lake-manifest.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@
"type": "git",
"subDir": null,
"scope": "leanprover-community",
"rev": "aa1dd647d3ccbb52a3e562dfb54d460cb96ea64e",
"rev": "c335381a50ac540e1265b1aeaae64eac6afed9c1",
"name": "mathlib",
"manifestFile": "lake-manifest.json",
"inputRev": "master",
Expand Down Expand Up @@ -75,7 +75,7 @@
"type": "git",
"subDir": null,
"scope": "leanprover-community",
"rev": "bd58e3506632241b59e406902d5e42b73cdeccce",
"rev": "87f6314ff2cc922489cd73cd0fbc2252f39aa153",
"name": "batteries",
"manifestFile": "lake-manifest.json",
"inputRev": "main",
Expand Down
Loading