set_theory.game.ordinal | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

b90e72c7

(last sync)

Changes in mathlib3port

mathlib3

mathlib3port

08b63ab5

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -247,7 +247,7 @@ theorem toPGame_add : ∀ a b : Ordinal.{u}, a.toPGame + b.toPGame ≈ (a ♯ b)
       · exact nadd_lt_nadd_left wf _
     · rw [to_pgame_move_left']
       rcases lt_nadd_iff.1 (to_left_moves_to_pgame_symm_lt i) with (⟨c, hc, hc'⟩ | ⟨c, hc, hc'⟩) <;>
-          rw [← to_pgame_le_iff, ← le_congr_right (to_pgame_add _ _)] at hc'  <;>
+          rw [← to_pgame_le_iff, ← le_congr_right (to_pgame_add _ _)] at hc' <;>
         apply lf_of_le_of_lf hc'
       · apply add_lf_add_right
         rwa [to_pgame_lf_iff]

08b63ab5

bump to nightly-2023-12-20-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

058cd493

Diff

@@ -114,17 +114,17 @@ theorem toPGame_moveLeft {o : Ordinal} (i) :
 #align ordinal.to_pgame_move_left Ordinal.toPGame_moveLeft
 -/
 
-#print Ordinal.zeroToPgameRelabelling /-
+#print Ordinal.zeroToPGameRelabelling /-
 /-- `0.to_pgame` has the same moves as `0`. -/
-noncomputable def zeroToPgameRelabelling : toPGame 0 ≡r 0 :=
+noncomputable def zeroToPGameRelabelling : toPGame 0 ≡r 0 :=
   SetTheory.PGame.Relabelling.isEmpty _
-#align ordinal.zero_to_pgame_relabelling Ordinal.zeroToPgameRelabelling
+#align ordinal.zero_to_pgame_relabelling Ordinal.zeroToPGameRelabelling
 -/
 
-#print Ordinal.uniqueOneToPgameLeftMoves /-
-noncomputable instance uniqueOneToPgameLeftMoves : Unique (toPGame 1).LeftMoves :=
+#print Ordinal.uniqueOneToPGameLeftMoves /-
+noncomputable instance uniqueOneToPGameLeftMoves : Unique (toPGame 1).LeftMoves :=
   (Equiv.cast <| toPGame_leftMoves 1).unique
-#align ordinal.unique_one_to_pgame_left_moves Ordinal.uniqueOneToPgameLeftMoves
+#align ordinal.unique_one_to_pgame_left_moves Ordinal.uniqueOneToPGameLeftMoves
 -/
 
 #print Ordinal.one_toPGame_leftMoves_default_eq /-
@@ -178,7 +178,7 @@ theorem toPGame_lt {a b : Ordinal} (h : a < b) : a.toPGame < b.toPGame :=
 
 #print Ordinal.toPGame_nonneg /-
 theorem toPGame_nonneg (a : Ordinal) : 0 ≤ a.toPGame :=
-  zeroToPgameRelabelling.ge.trans <| toPGame_le <| Ordinal.zero_le a
+  zeroToPGameRelabelling.ge.trans <| toPGame_le <| Ordinal.zero_le a
 #align ordinal.to_pgame_nonneg Ordinal.toPGame_nonneg
 -/

08b63ab5

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -3,8 +3,8 @@ Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Violeta Hernández Palacios
 -/
-import Mathbin.SetTheory.Game.Basic
-import Mathbin.SetTheory.Ordinal.NaturalOps
+import SetTheory.Game.Basic
+import SetTheory.Ordinal.NaturalOps
 
 #align_import set_theory.game.ordinal from "leanprover-community/mathlib"@"08b63ab58a6ec1157ebeafcbbe6c7a3fb3c9f6d5"

08b63ab5

bump to nightly-2023-09-02-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/442a83d738cb208d3600056c489be16900ba701d

a4ca67cb

Diff

@@ -28,15 +28,15 @@ The map to surreals is defined in `ordinal.to_surreal`.
 
 universe u
 
-open PGame
+open SetTheory.PGame
 
-open scoped NaturalOps PGame
+open scoped NaturalOps SetTheory.PGame
 
 namespace Ordinal
 
 #print Ordinal.toPGame /-
 /-- Converts an ordinal into the corresponding pre-game. -/
-noncomputable def toPGame : Ordinal.{u} → PGame.{u}
+noncomputable def toPGame : Ordinal.{u} → SetTheory.PGame.{u}
   | o =>
     ⟨o.out.α, PEmpty, fun x =>
       let hwf := Ordinal.typein_lt_self x
@@ -117,7 +117,7 @@ theorem toPGame_moveLeft {o : Ordinal} (i) :
 #print Ordinal.zeroToPgameRelabelling /-
 /-- `0.to_pgame` has the same moves as `0`. -/
 noncomputable def zeroToPgameRelabelling : toPGame 0 ≡r 0 :=
-  Relabelling.isEmpty _
+  SetTheory.PGame.Relabelling.isEmpty _
 #align ordinal.zero_to_pgame_relabelling Ordinal.zeroToPgameRelabelling
 -/
 
@@ -192,7 +192,7 @@ theorem toPGame_lf_iff {a b : Ordinal} : a.toPGame ⧏ b.toPGame ↔ a < b :=
 #print Ordinal.toPGame_le_iff /-
 @[simp]
 theorem toPGame_le_iff {a b : Ordinal} : a.toPGame ≤ b.toPGame ↔ a ≤ b :=
-  ⟨by contrapose; rw [not_le, PGame.not_le]; exact to_pgame_lf, toPGame_le⟩
+  ⟨by contrapose; rw [not_le, SetTheory.PGame.not_le]; exact to_pgame_lf, toPGame_le⟩
 #align ordinal.to_pgame_le_iff Ordinal.toPGame_le_iff
 -/
 
@@ -206,13 +206,13 @@ theorem toPGame_lt_iff {a b : Ordinal} : a.toPGame < b.toPGame ↔ a < b :=
 #print Ordinal.toPGame_equiv_iff /-
 @[simp]
 theorem toPGame_equiv_iff {a b : Ordinal} : (a.toPGame ≈ b.toPGame) ↔ a = b := by
-  rw [PGame.Equiv, le_antisymm_iff, to_pgame_le_iff, to_pgame_le_iff]
+  rw [SetTheory.PGame.Equiv, le_antisymm_iff, to_pgame_le_iff, to_pgame_le_iff]
 #align ordinal.to_pgame_equiv_iff Ordinal.toPGame_equiv_iff
 -/
 
 #print Ordinal.toPGame_injective /-
 theorem toPGame_injective : Function.Injective Ordinal.toPGame := fun a b h =>
-  toPGame_equiv_iff.1 <| equiv_of_eq h
+  toPGame_equiv_iff.1 <| SetTheory.PGame.equiv_of_eq h
 #align ordinal.to_pgame_injective Ordinal.toPGame_injective
 -/
 
@@ -226,7 +226,7 @@ theorem toPGame_eq_iff {a b : Ordinal} : a.toPGame = b.toPGame ↔ a = b :=
 #print Ordinal.toPGameEmbedding /-
 /-- The order embedding version of `to_pgame`. -/
 @[simps]
-noncomputable def toPGameEmbedding : Ordinal.{u} ↪o PGame.{u}
+noncomputable def toPGameEmbedding : Ordinal.{u} ↪o SetTheory.PGame.{u}
     where
   toFun := Ordinal.toPGame
   inj' := toPGame_injective

08b63ab5

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Violeta Hernández Palacios
-
-! This file was ported from Lean 3 source module set_theory.game.ordinal
-! leanprover-community/mathlib commit 08b63ab58a6ec1157ebeafcbbe6c7a3fb3c9f6d5
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.SetTheory.Game.Basic
 import Mathbin.SetTheory.Ordinal.NaturalOps
 
+#align_import set_theory.game.ordinal from "leanprover-community/mathlib"@"08b63ab58a6ec1157ebeafcbbe6c7a3fb3c9f6d5"
+
 /-!
 # Ordinals as games

08b63ab5

bump to nightly-2023-06-30-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/9240e8be927a0955b9a82c6c85ef499ee3a626b8

397a8f48

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Violeta Hernández Palacios
 
 ! This file was ported from Lean 3 source module set_theory.game.ordinal
-! leanprover-community/mathlib commit b90e72c7eebbe8de7c8293a80208ea2ba135c834
+! leanprover-community/mathlib commit 08b63ab58a6ec1157ebeafcbbe6c7a3fb3c9f6d5
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
@@ -14,6 +14,9 @@ import Mathbin.SetTheory.Ordinal.NaturalOps
 /-!
 # Ordinals as games
 
+> THIS FILE IS SYNCHRONIZED WITH MATHLIB4.
+> Any changes to this file require a corresponding PR to mathlib4.
+
 We define the canonical map `ordinal → pgame`, where every ordinal is mapped to the game whose left
 set consists of all previous ordinals.

b90e72c7

bump to nightly-2023-06-26-17

mathlib commit https://github.com/leanprover-community/mathlib/commit/fdc286cc6967a012f41b87f76dcd2797b53152af

53117b4d

Diff

@@ -34,152 +34,209 @@ open scoped NaturalOps PGame
 
 namespace Ordinal
 
+#print Ordinal.toPGame /-
 /-- Converts an ordinal into the corresponding pre-game. -/
-noncomputable def toPgame : Ordinal.{u} → PGame.{u}
+noncomputable def toPGame : Ordinal.{u} → PGame.{u}
   | o =>
     ⟨o.out.α, PEmpty, fun x =>
       let hwf := Ordinal.typein_lt_self x
-      (typein (· < ·) x).toPgame,
+      (typein (· < ·) x).toPGame,
       PEmpty.elim⟩
-#align ordinal.to_pgame Ordinal.toPgame
+#align ordinal.to_pgame Ordinal.toPGame
+-/
 
-theorem toPgame_def (o : Ordinal) :
-    o.toPgame = ⟨o.out.α, PEmpty, fun x => (typein (· < ·) x).toPgame, PEmpty.elim⟩ := by
+#print Ordinal.toPGame_def /-
+theorem toPGame_def (o : Ordinal) :
+    o.toPGame = ⟨o.out.α, PEmpty, fun x => (typein (· < ·) x).toPGame, PEmpty.elim⟩ := by
   rw [to_pgame]
-#align ordinal.to_pgame_def Ordinal.toPgame_def
+#align ordinal.to_pgame_def Ordinal.toPGame_def
+-/
 
+#print Ordinal.toPGame_leftMoves /-
 @[simp]
-theorem toPgame_leftMoves (o : Ordinal) : o.toPgame.LeftMoves = o.out.α := by
+theorem toPGame_leftMoves (o : Ordinal) : o.toPGame.LeftMoves = o.out.α := by
   rw [to_pgame, left_moves]
-#align ordinal.to_pgame_left_moves Ordinal.toPgame_leftMoves
+#align ordinal.to_pgame_left_moves Ordinal.toPGame_leftMoves
+-/
 
+#print Ordinal.toPGame_rightMoves /-
 @[simp]
-theorem toPgame_rightMoves (o : Ordinal) : o.toPgame.RightMoves = PEmpty := by
+theorem toPGame_rightMoves (o : Ordinal) : o.toPGame.RightMoves = PEmpty := by
   rw [to_pgame, right_moves]
-#align ordinal.to_pgame_right_moves Ordinal.toPgame_rightMoves
+#align ordinal.to_pgame_right_moves Ordinal.toPGame_rightMoves
+-/
 
-instance isEmpty_zero_toPgame_leftMoves : IsEmpty (toPgame 0).LeftMoves := by
+#print Ordinal.isEmpty_zero_toPGame_leftMoves /-
+instance isEmpty_zero_toPGame_leftMoves : IsEmpty (toPGame 0).LeftMoves := by
   rw [to_pgame_left_moves]; infer_instance
-#align ordinal.is_empty_zero_to_pgame_left_moves Ordinal.isEmpty_zero_toPgame_leftMoves
+#align ordinal.is_empty_zero_to_pgame_left_moves Ordinal.isEmpty_zero_toPGame_leftMoves
+-/
 
-instance isEmpty_toPgame_rightMoves (o : Ordinal) : IsEmpty o.toPgame.RightMoves := by
+#print Ordinal.isEmpty_toPGame_rightMoves /-
+instance isEmpty_toPGame_rightMoves (o : Ordinal) : IsEmpty o.toPGame.RightMoves := by
   rw [to_pgame_right_moves]; infer_instance
-#align ordinal.is_empty_to_pgame_right_moves Ordinal.isEmpty_toPgame_rightMoves
+#align ordinal.is_empty_to_pgame_right_moves Ordinal.isEmpty_toPGame_rightMoves
+-/
 
+#print Ordinal.toLeftMovesToPGame /-
 /-- Converts an ordinal less than `o` into a move for the `pgame` corresponding to `o`, and vice
 versa. -/
-noncomputable def toLeftMovesToPgame {o : Ordinal} : Set.Iio o ≃ o.toPgame.LeftMoves :=
-  (enumIsoOut o).toEquiv.trans (Equiv.cast (toPgame_leftMoves o).symm)
-#align ordinal.to_left_moves_to_pgame Ordinal.toLeftMovesToPgame
+noncomputable def toLeftMovesToPGame {o : Ordinal} : Set.Iio o ≃ o.toPGame.LeftMoves :=
+  (enumIsoOut o).toEquiv.trans (Equiv.cast (toPGame_leftMoves o).symm)
+#align ordinal.to_left_moves_to_pgame Ordinal.toLeftMovesToPGame
+-/
 
+#print Ordinal.toLeftMovesToPGame_symm_lt /-
 @[simp]
-theorem toLeftMovesToPgame_symm_lt {o : Ordinal} (i : o.toPgame.LeftMoves) :
-    ↑(toLeftMovesToPgame.symm i) < o :=
-  (toLeftMovesToPgame.symm i).Prop
-#align ordinal.to_left_moves_to_pgame_symm_lt Ordinal.toLeftMovesToPgame_symm_lt
+theorem toLeftMovesToPGame_symm_lt {o : Ordinal} (i : o.toPGame.LeftMoves) :
+    ↑(toLeftMovesToPGame.symm i) < o :=
+  (toLeftMovesToPGame.symm i).Prop
+#align ordinal.to_left_moves_to_pgame_symm_lt Ordinal.toLeftMovesToPGame_symm_lt
+-/
 
-theorem toPgame_moveLeft_hEq {o : Ordinal} :
-    HEq o.toPgame.moveLeft fun x : o.out.α => (typein (· < ·) x).toPgame := by rw [to_pgame]; rfl
-#align ordinal.to_pgame_move_left_heq Ordinal.toPgame_moveLeft_hEq
+#print Ordinal.toPGame_moveLeft_hEq /-
+theorem toPGame_moveLeft_hEq {o : Ordinal} :
+    HEq o.toPGame.moveLeft fun x : o.out.α => (typein (· < ·) x).toPGame := by rw [to_pgame]; rfl
+#align ordinal.to_pgame_move_left_heq Ordinal.toPGame_moveLeft_hEq
+-/
 
+#print Ordinal.toPGame_moveLeft' /-
 @[simp]
-theorem toPgame_move_left' {o : Ordinal} (i) :
-    o.toPgame.moveLeft i = (toLeftMovesToPgame.symm i).val.toPgame :=
-  (congr_heq toPgame_moveLeft_hEq.symm (cast_hEq _ i)).symm
-#align ordinal.to_pgame_move_left' Ordinal.toPgame_move_left'
+theorem toPGame_moveLeft' {o : Ordinal} (i) :
+    o.toPGame.moveLeft i = (toLeftMovesToPGame.symm i).val.toPGame :=
+  (congr_heq toPGame_moveLeft_hEq.symm (cast_hEq _ i)).symm
+#align ordinal.to_pgame_move_left' Ordinal.toPGame_moveLeft'
+-/
 
-theorem toPgame_moveLeft {o : Ordinal} (i) :
-    o.toPgame.moveLeft (toLeftMovesToPgame i) = i.val.toPgame := by simp
-#align ordinal.to_pgame_move_left Ordinal.toPgame_moveLeft
+#print Ordinal.toPGame_moveLeft /-
+theorem toPGame_moveLeft {o : Ordinal} (i) :
+    o.toPGame.moveLeft (toLeftMovesToPGame i) = i.val.toPGame := by simp
+#align ordinal.to_pgame_move_left Ordinal.toPGame_moveLeft
+-/
 
+#print Ordinal.zeroToPgameRelabelling /-
 /-- `0.to_pgame` has the same moves as `0`. -/
-noncomputable def zeroToPgameRelabelling : toPgame 0 ≡r 0 :=
+noncomputable def zeroToPgameRelabelling : toPGame 0 ≡r 0 :=
   Relabelling.isEmpty _
 #align ordinal.zero_to_pgame_relabelling Ordinal.zeroToPgameRelabelling
+-/
 
-noncomputable instance uniqueOneToPgameLeftMoves : Unique (toPgame 1).LeftMoves :=
-  (Equiv.cast <| toPgame_leftMoves 1).unique
+#print Ordinal.uniqueOneToPgameLeftMoves /-
+noncomputable instance uniqueOneToPgameLeftMoves : Unique (toPGame 1).LeftMoves :=
+  (Equiv.cast <| toPGame_leftMoves 1).unique
 #align ordinal.unique_one_to_pgame_left_moves Ordinal.uniqueOneToPgameLeftMoves
+-/
 
+#print Ordinal.one_toPGame_leftMoves_default_eq /-
 @[simp]
-theorem one_toPgame_leftMoves_default_eq :
-    (default : (toPgame 1).LeftMoves) = @toLeftMovesToPgame 1 ⟨0, zero_lt_one⟩ :=
+theorem one_toPGame_leftMoves_default_eq :
+    (default : (toPGame 1).LeftMoves) = @toLeftMovesToPGame 1 ⟨0, zero_lt_one⟩ :=
   rfl
-#align ordinal.one_to_pgame_left_moves_default_eq Ordinal.one_toPgame_leftMoves_default_eq
+#align ordinal.one_to_pgame_left_moves_default_eq Ordinal.one_toPGame_leftMoves_default_eq
+-/
 
+#print Ordinal.to_leftMoves_one_toPGame_symm /-
 @[simp]
-theorem to_leftMoves_one_toPgame_symm (i) : (@toLeftMovesToPgame 1).symm i = ⟨0, zero_lt_one⟩ := by
+theorem to_leftMoves_one_toPGame_symm (i) : (@toLeftMovesToPGame 1).symm i = ⟨0, zero_lt_one⟩ := by
   simp
-#align ordinal.to_left_moves_one_to_pgame_symm Ordinal.to_leftMoves_one_toPgame_symm
+#align ordinal.to_left_moves_one_to_pgame_symm Ordinal.to_leftMoves_one_toPGame_symm
+-/
 
-theorem one_toPgame_moveLeft (x) : (toPgame 1).moveLeft x = toPgame 0 := by simp
-#align ordinal.one_to_pgame_move_left Ordinal.one_toPgame_moveLeft
+#print Ordinal.one_toPGame_moveLeft /-
+theorem one_toPGame_moveLeft (x) : (toPGame 1).moveLeft x = toPGame 0 := by simp
+#align ordinal.one_to_pgame_move_left Ordinal.one_toPGame_moveLeft
+-/
 
+#print Ordinal.oneToPGameRelabelling /-
 /-- `1.to_pgame` has the same moves as `1`. -/
-noncomputable def oneToPgameRelabelling : toPgame 1 ≡r 1 :=
+noncomputable def oneToPGameRelabelling : toPGame 1 ≡r 1 :=
   ⟨Equiv.equivOfUnique _ _, Equiv.equivOfIsEmpty _ _, fun i => by
     simpa using zero_to_pgame_relabelling, isEmptyElim⟩
-#align ordinal.one_to_pgame_relabelling Ordinal.oneToPgameRelabelling
+#align ordinal.one_to_pgame_relabelling Ordinal.oneToPGameRelabelling
+-/
 
-theorem toPgame_lf {a b : Ordinal} (h : a < b) : a.toPgame ⧏ b.toPgame := by
+#print Ordinal.toPGame_lf /-
+theorem toPGame_lf {a b : Ordinal} (h : a < b) : a.toPGame ⧏ b.toPGame := by
   convert move_left_lf (to_left_moves_to_pgame ⟨a, h⟩); rw [to_pgame_move_left]
-#align ordinal.to_pgame_lf Ordinal.toPgame_lf
+#align ordinal.to_pgame_lf Ordinal.toPGame_lf
+-/
 
-theorem toPgame_le {a b : Ordinal} (h : a ≤ b) : a.toPgame ≤ b.toPgame :=
+#print Ordinal.toPGame_le /-
+theorem toPGame_le {a b : Ordinal} (h : a ≤ b) : a.toPGame ≤ b.toPGame :=
   by
   refine' le_iff_forall_lf.2 ⟨fun i => _, isEmptyElim⟩
   rw [to_pgame_move_left']
   exact to_pgame_lf ((to_left_moves_to_pgame_symm_lt i).trans_le h)
-#align ordinal.to_pgame_le Ordinal.toPgame_le
+#align ordinal.to_pgame_le Ordinal.toPGame_le
+-/
 
-theorem toPgame_lt {a b : Ordinal} (h : a < b) : a.toPgame < b.toPgame :=
-  ⟨toPgame_le h.le, toPgame_lf h⟩
-#align ordinal.to_pgame_lt Ordinal.toPgame_lt
+#print Ordinal.toPGame_lt /-
+theorem toPGame_lt {a b : Ordinal} (h : a < b) : a.toPGame < b.toPGame :=
+  ⟨toPGame_le h.le, toPGame_lf h⟩
+#align ordinal.to_pgame_lt Ordinal.toPGame_lt
+-/
 
-theorem toPgame_nonneg (a : Ordinal) : 0 ≤ a.toPgame :=
-  zeroToPgameRelabelling.ge.trans <| toPgame_le <| Ordinal.zero_le a
-#align ordinal.to_pgame_nonneg Ordinal.toPgame_nonneg
+#print Ordinal.toPGame_nonneg /-
+theorem toPGame_nonneg (a : Ordinal) : 0 ≤ a.toPGame :=
+  zeroToPgameRelabelling.ge.trans <| toPGame_le <| Ordinal.zero_le a
+#align ordinal.to_pgame_nonneg Ordinal.toPGame_nonneg
+-/
 
+#print Ordinal.toPGame_lf_iff /-
 @[simp]
-theorem toPgame_lf_iff {a b : Ordinal} : a.toPgame ⧏ b.toPgame ↔ a < b :=
-  ⟨by contrapose; rw [not_lt, not_lf]; exact to_pgame_le, toPgame_lf⟩
-#align ordinal.to_pgame_lf_iff Ordinal.toPgame_lf_iff
+theorem toPGame_lf_iff {a b : Ordinal} : a.toPGame ⧏ b.toPGame ↔ a < b :=
+  ⟨by contrapose; rw [not_lt, not_lf]; exact to_pgame_le, toPGame_lf⟩
+#align ordinal.to_pgame_lf_iff Ordinal.toPGame_lf_iff
+-/
 
+#print Ordinal.toPGame_le_iff /-
 @[simp]
-theorem toPgame_le_iff {a b : Ordinal} : a.toPgame ≤ b.toPgame ↔ a ≤ b :=
-  ⟨by contrapose; rw [not_le, PGame.not_le]; exact to_pgame_lf, toPgame_le⟩
-#align ordinal.to_pgame_le_iff Ordinal.toPgame_le_iff
+theorem toPGame_le_iff {a b : Ordinal} : a.toPGame ≤ b.toPGame ↔ a ≤ b :=
+  ⟨by contrapose; rw [not_le, PGame.not_le]; exact to_pgame_lf, toPGame_le⟩
+#align ordinal.to_pgame_le_iff Ordinal.toPGame_le_iff
+-/
 
+#print Ordinal.toPGame_lt_iff /-
 @[simp]
-theorem toPgame_lt_iff {a b : Ordinal} : a.toPgame < b.toPgame ↔ a < b :=
-  ⟨by contrapose; rw [not_lt]; exact fun h => not_lt_of_le (to_pgame_le h), toPgame_lt⟩
-#align ordinal.to_pgame_lt_iff Ordinal.toPgame_lt_iff
+theorem toPGame_lt_iff {a b : Ordinal} : a.toPGame < b.toPGame ↔ a < b :=
+  ⟨by contrapose; rw [not_lt]; exact fun h => not_lt_of_le (to_pgame_le h), toPGame_lt⟩
+#align ordinal.to_pgame_lt_iff Ordinal.toPGame_lt_iff
+-/
 
+#print Ordinal.toPGame_equiv_iff /-
 @[simp]
-theorem toPgame_equiv_iff {a b : Ordinal} : (a.toPgame ≈ b.toPgame) ↔ a = b := by
+theorem toPGame_equiv_iff {a b : Ordinal} : (a.toPGame ≈ b.toPGame) ↔ a = b := by
   rw [PGame.Equiv, le_antisymm_iff, to_pgame_le_iff, to_pgame_le_iff]
-#align ordinal.to_pgame_equiv_iff Ordinal.toPgame_equiv_iff
+#align ordinal.to_pgame_equiv_iff Ordinal.toPGame_equiv_iff
+-/
 
-theorem toPgame_injective : Function.Injective Ordinal.toPgame := fun a b h =>
-  toPgame_equiv_iff.1 <| equiv_of_eq h
-#align ordinal.to_pgame_injective Ordinal.toPgame_injective
+#print Ordinal.toPGame_injective /-
+theorem toPGame_injective : Function.Injective Ordinal.toPGame := fun a b h =>
+  toPGame_equiv_iff.1 <| equiv_of_eq h
+#align ordinal.to_pgame_injective Ordinal.toPGame_injective
+-/
 
+#print Ordinal.toPGame_eq_iff /-
 @[simp]
-theorem toPgame_eq_iff {a b : Ordinal} : a.toPgame = b.toPgame ↔ a = b :=
-  toPgame_injective.eq_iff
-#align ordinal.to_pgame_eq_iff Ordinal.toPgame_eq_iff
+theorem toPGame_eq_iff {a b : Ordinal} : a.toPGame = b.toPGame ↔ a = b :=
+  toPGame_injective.eq_iff
+#align ordinal.to_pgame_eq_iff Ordinal.toPGame_eq_iff
+-/
 
+#print Ordinal.toPGameEmbedding /-
 /-- The order embedding version of `to_pgame`. -/
 @[simps]
-noncomputable def toPgameEmbedding : Ordinal.{u} ↪o PGame.{u}
+noncomputable def toPGameEmbedding : Ordinal.{u} ↪o PGame.{u}
     where
-  toFun := Ordinal.toPgame
-  inj' := toPgame_injective
-  map_rel_iff' := @toPgame_le_iff
-#align ordinal.to_pgame_embedding Ordinal.toPgameEmbedding
+  toFun := Ordinal.toPGame
+  inj' := toPGame_injective
+  map_rel_iff' := @toPGame_le_iff
+#align ordinal.to_pgame_embedding Ordinal.toPGameEmbedding
+-/
 
+#print Ordinal.toPGame_add /-
 /-- The sum of ordinals as games corresponds to natural addition of ordinals. -/
-theorem toPgame_add : ∀ a b : Ordinal.{u}, a.toPgame + b.toPgame ≈ (a ♯ b).toPgame
+theorem toPGame_add : ∀ a b : Ordinal.{u}, a.toPGame + b.toPGame ≈ (a ♯ b).toPGame
   | a, b =>
     by
     refine' ⟨le_of_forall_lf (fun i => _) isEmptyElim, le_of_forall_lf (fun i => _) isEmptyElim⟩
@@ -197,12 +254,15 @@ theorem toPgame_add : ∀ a b : Ordinal.{u}, a.toPgame + b.toPgame ≈ (a ♯ b)
       · apply add_lf_add_left
         rwa [to_pgame_lf_iff]
 decreasing_by solve_by_elim [PSigma.Lex.left, PSigma.Lex.right]
-#align ordinal.to_pgame_add Ordinal.toPgame_add
+#align ordinal.to_pgame_add Ordinal.toPGame_add
+-/
 
+#print Ordinal.toPGame_add_mk' /-
 @[simp]
-theorem toPgame_add_mk' (a b : Ordinal) : ⟦a.toPgame⟧ + ⟦b.toPgame⟧ = ⟦(a ♯ b).toPgame⟧ :=
-  Quot.sound (toPgame_add a b)
-#align ordinal.to_pgame_add_mk Ordinal.toPgame_add_mk'
+theorem toPGame_add_mk' (a b : Ordinal) : ⟦a.toPGame⟧ + ⟦b.toPGame⟧ = ⟦(a ♯ b).toPGame⟧ :=
+  Quot.sound (toPGame_add a b)
+#align ordinal.to_pgame_add_mk Ordinal.toPGame_add_mk'
+-/
 
 end Ordinal

b90e72c7

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -190,12 +190,13 @@ theorem toPgame_add : ∀ a b : Ordinal.{u}, a.toPgame + b.toPgame ≈ (a ♯ b)
       · exact nadd_lt_nadd_left wf _
     · rw [to_pgame_move_left']
       rcases lt_nadd_iff.1 (to_left_moves_to_pgame_symm_lt i) with (⟨c, hc, hc'⟩ | ⟨c, hc, hc'⟩) <;>
-          rw [← to_pgame_le_iff, ← le_congr_right (to_pgame_add _ _)] at hc' <;>
+          rw [← to_pgame_le_iff, ← le_congr_right (to_pgame_add _ _)] at hc'  <;>
         apply lf_of_le_of_lf hc'
       · apply add_lf_add_right
         rwa [to_pgame_lf_iff]
       · apply add_lf_add_left
-        rwa [to_pgame_lf_iff]decreasing_by solve_by_elim [PSigma.Lex.left, PSigma.Lex.right]
+        rwa [to_pgame_lf_iff]
+decreasing_by solve_by_elim [PSigma.Lex.left, PSigma.Lex.right]
 #align ordinal.to_pgame_add Ordinal.toPgame_add
 
 @[simp]

b90e72c7

bump to nightly-2023-05-28-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

8d353152

Diff

@@ -30,7 +30,7 @@ universe u
 
 open PGame
 
-open NaturalOps PGame
+open scoped NaturalOps PGame
 
 namespace Ordinal

b90e72c7

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -58,16 +58,12 @@ theorem toPgame_rightMoves (o : Ordinal) : o.toPgame.RightMoves = PEmpty := by
   rw [to_pgame, right_moves]
 #align ordinal.to_pgame_right_moves Ordinal.toPgame_rightMoves
 
-instance isEmpty_zero_toPgame_leftMoves : IsEmpty (toPgame 0).LeftMoves :=
-  by
-  rw [to_pgame_left_moves]
-  infer_instance
+instance isEmpty_zero_toPgame_leftMoves : IsEmpty (toPgame 0).LeftMoves := by
+  rw [to_pgame_left_moves]; infer_instance
 #align ordinal.is_empty_zero_to_pgame_left_moves Ordinal.isEmpty_zero_toPgame_leftMoves
 
-instance isEmpty_toPgame_rightMoves (o : Ordinal) : IsEmpty o.toPgame.RightMoves :=
-  by
-  rw [to_pgame_right_moves]
-  infer_instance
+instance isEmpty_toPgame_rightMoves (o : Ordinal) : IsEmpty o.toPgame.RightMoves := by
+  rw [to_pgame_right_moves]; infer_instance
 #align ordinal.is_empty_to_pgame_right_moves Ordinal.isEmpty_toPgame_rightMoves
 
 /-- Converts an ordinal less than `o` into a move for the `pgame` corresponding to `o`, and vice
@@ -83,10 +79,7 @@ theorem toLeftMovesToPgame_symm_lt {o : Ordinal} (i : o.toPgame.LeftMoves) :
 #align ordinal.to_left_moves_to_pgame_symm_lt Ordinal.toLeftMovesToPgame_symm_lt
 
 theorem toPgame_moveLeft_hEq {o : Ordinal} :
-    HEq o.toPgame.moveLeft fun x : o.out.α => (typein (· < ·) x).toPgame :=
-  by
-  rw [to_pgame]
-  rfl
+    HEq o.toPgame.moveLeft fun x : o.out.α => (typein (· < ·) x).toPgame := by rw [to_pgame]; rfl
 #align ordinal.to_pgame_move_left_heq Ordinal.toPgame_moveLeft_hEq
 
 @[simp]
@@ -128,10 +121,8 @@ noncomputable def oneToPgameRelabelling : toPgame 1 ≡r 1 :=
     simpa using zero_to_pgame_relabelling, isEmptyElim⟩
 #align ordinal.one_to_pgame_relabelling Ordinal.oneToPgameRelabelling
 
-theorem toPgame_lf {a b : Ordinal} (h : a < b) : a.toPgame ⧏ b.toPgame :=
-  by
-  convert move_left_lf (to_left_moves_to_pgame ⟨a, h⟩)
-  rw [to_pgame_move_left]
+theorem toPgame_lf {a b : Ordinal} (h : a < b) : a.toPgame ⧏ b.toPgame := by
+  convert move_left_lf (to_left_moves_to_pgame ⟨a, h⟩); rw [to_pgame_move_left]
 #align ordinal.to_pgame_lf Ordinal.toPgame_lf
 
 theorem toPgame_le {a b : Ordinal} (h : a ≤ b) : a.toPgame ≤ b.toPgame :=
@@ -151,26 +142,17 @@ theorem toPgame_nonneg (a : Ordinal) : 0 ≤ a.toPgame :=
 
 @[simp]
 theorem toPgame_lf_iff {a b : Ordinal} : a.toPgame ⧏ b.toPgame ↔ a < b :=
-  ⟨by
-    contrapose
-    rw [not_lt, not_lf]
-    exact to_pgame_le, toPgame_lf⟩
+  ⟨by contrapose; rw [not_lt, not_lf]; exact to_pgame_le, toPgame_lf⟩
 #align ordinal.to_pgame_lf_iff Ordinal.toPgame_lf_iff
 
 @[simp]
 theorem toPgame_le_iff {a b : Ordinal} : a.toPgame ≤ b.toPgame ↔ a ≤ b :=
-  ⟨by
-    contrapose
-    rw [not_le, PGame.not_le]
-    exact to_pgame_lf, toPgame_le⟩
+  ⟨by contrapose; rw [not_le, PGame.not_le]; exact to_pgame_lf, toPgame_le⟩
 #align ordinal.to_pgame_le_iff Ordinal.toPgame_le_iff
 
 @[simp]
 theorem toPgame_lt_iff {a b : Ordinal} : a.toPgame < b.toPgame ↔ a < b :=
-  ⟨by
-    contrapose
-    rw [not_lt]
-    exact fun h => not_lt_of_le (to_pgame_le h), toPgame_lt⟩
+  ⟨by contrapose; rw [not_lt]; exact fun h => not_lt_of_le (to_pgame_le h), toPgame_lt⟩
 #align ordinal.to_pgame_lt_iff Ordinal.toPgame_lt_iff
 
 @[simp]

b90e72c7

bump to nightly-2023-05-19-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/95a87616d63b3cb49d3fe678d416fbe9c4217bf4

a31df521

Diff

@@ -28,14 +28,14 @@ The map to surreals is defined in `ordinal.to_surreal`.
 
 universe u
 
-open Pgame
+open PGame
 
-open NaturalOps Pgame
+open NaturalOps PGame
 
 namespace Ordinal
 
 /-- Converts an ordinal into the corresponding pre-game. -/
-noncomputable def toPgame : Ordinal.{u} → Pgame.{u}
+noncomputable def toPgame : Ordinal.{u} → PGame.{u}
   | o =>
     ⟨o.out.α, PEmpty, fun x =>
       let hwf := Ordinal.typein_lt_self x
@@ -161,7 +161,7 @@ theorem toPgame_lf_iff {a b : Ordinal} : a.toPgame ⧏ b.toPgame ↔ a < b :=
 theorem toPgame_le_iff {a b : Ordinal} : a.toPgame ≤ b.toPgame ↔ a ≤ b :=
   ⟨by
     contrapose
-    rw [not_le, Pgame.not_le]
+    rw [not_le, PGame.not_le]
     exact to_pgame_lf, toPgame_le⟩
 #align ordinal.to_pgame_le_iff Ordinal.toPgame_le_iff
 
@@ -175,7 +175,7 @@ theorem toPgame_lt_iff {a b : Ordinal} : a.toPgame < b.toPgame ↔ a < b :=
 
 @[simp]
 theorem toPgame_equiv_iff {a b : Ordinal} : (a.toPgame ≈ b.toPgame) ↔ a = b := by
-  rw [Pgame.Equiv, le_antisymm_iff, to_pgame_le_iff, to_pgame_le_iff]
+  rw [PGame.Equiv, le_antisymm_iff, to_pgame_le_iff, to_pgame_le_iff]
 #align ordinal.to_pgame_equiv_iff Ordinal.toPgame_equiv_iff
 
 theorem toPgame_injective : Function.Injective Ordinal.toPgame := fun a b h =>
@@ -189,7 +189,7 @@ theorem toPgame_eq_iff {a b : Ordinal} : a.toPgame = b.toPgame ↔ a = b :=
 
 /-- The order embedding version of `to_pgame`. -/
 @[simps]
-noncomputable def toPgameEmbedding : Ordinal.{u} ↪o Pgame.{u}
+noncomputable def toPgameEmbedding : Ordinal.{u} ↪o PGame.{u}
     where
   toFun := Ordinal.toPgame
   inj' := toPgame_injective

b90e72c7

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

b90e72c7

chore: move to v4.6.0-rc1, merging adaptations from bump/v4.6.0 (#10176)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Joachim Breitner <mail@joachim-breitner.de>

490d2d48

Diff

@@ -39,7 +39,7 @@ noncomputable def toPGame : Ordinal.{u} → PGame.{u}
       have := Ordinal.typein_lt_self x
       (typein (· < ·) x).toPGame,
       PEmpty.elim⟩
-termination_by toPGame x => x
+termination_by x => x
 #align ordinal.to_pgame Ordinal.toPGame
 
 @[nolint unusedHavesSuffices]
@@ -204,7 +204,7 @@ theorem toPGame_add : ∀ a b : Ordinal.{u}, a.toPGame + b.toPGame ≈ (a ♯ b)
         rwa [toPGame_lf_iff]
       · apply add_lf_add_left
         rwa [toPGame_lf_iff]
-termination_by toPGame_add a b => (a, b)
+termination_by a b => (a, b)
 #align ordinal.to_pgame_add Ordinal.toPGame_add
 
 @[simp]

b90e72c7

chore: Nsmul -> NSMul, Zpow -> ZPow, etc (#9067)

Normalising to naming convention rule number 6.

9b2f0dca

Diff

@@ -97,14 +97,14 @@ theorem toPGame_moveLeft {o : Ordinal} (i) :
     o.toPGame.moveLeft (toLeftMovesToPGame i) = i.val.toPGame := by simp
 #align ordinal.to_pgame_move_left Ordinal.toPGame_moveLeft
 
-/-- `0.to_pgame` has the same moves as `0`. -/
-noncomputable def zeroToPgameRelabelling : toPGame 0 ≡r 0 :=
+/-- `0.toPGame` has the same moves as `0`. -/
+noncomputable def zeroToPGameRelabelling : toPGame 0 ≡r 0 :=
   Relabelling.isEmpty _
-#align ordinal.zero_to_pgame_relabelling Ordinal.zeroToPgameRelabelling
+#align ordinal.zero_to_pgame_relabelling Ordinal.zeroToPGameRelabelling
 
-noncomputable instance uniqueOneToPgameLeftMoves : Unique (toPGame 1).LeftMoves :=
+noncomputable instance uniqueOneToPGameLeftMoves : Unique (toPGame 1).LeftMoves :=
   (Equiv.cast <| toPGame_leftMoves 1).unique
-#align ordinal.unique_one_to_pgame_left_moves Ordinal.uniqueOneToPgameLeftMoves
+#align ordinal.unique_one_to_pgame_left_moves Ordinal.uniqueOneToPGameLeftMoves
 
 @[simp]
 theorem one_toPGame_leftMoves_default_eq :
@@ -121,10 +121,10 @@ theorem to_leftMoves_one_toPGame_symm (i) :
 theorem one_toPGame_moveLeft (x) : (toPGame 1).moveLeft x = toPGame 0 := by simp
 #align ordinal.one_to_pgame_move_left Ordinal.one_toPGame_moveLeft
 
-/-- `1.to_pgame` has the same moves as `1`. -/
+/-- `1.toPGame` has the same moves as `1`. -/
 noncomputable def oneToPGameRelabelling : toPGame 1 ≡r 1 :=
   ⟨Equiv.equivOfUnique _ _, Equiv.equivOfIsEmpty _ _, fun i => by
-    simpa using zeroToPgameRelabelling, isEmptyElim⟩
+    simpa using zeroToPGameRelabelling, isEmptyElim⟩
 #align ordinal.one_to_pgame_relabelling Ordinal.oneToPGameRelabelling
 
 theorem toPGame_lf {a b : Ordinal} (h : a < b) : a.toPGame ⧏ b.toPGame := by
@@ -142,7 +142,7 @@ theorem toPGame_lt {a b : Ordinal} (h : a < b) : a.toPGame < b.toPGame :=
 #align ordinal.to_pgame_lt Ordinal.toPGame_lt
 
 theorem toPGame_nonneg (a : Ordinal) : 0 ≤ a.toPGame :=
-  zeroToPgameRelabelling.ge.trans <| toPGame_le <| Ordinal.zero_le a
+  zeroToPGameRelabelling.ge.trans <| toPGame_le <| Ordinal.zero_le a
 #align ordinal.to_pgame_nonneg Ordinal.toPGame_nonneg
 
 @[simp]

b90e72c7

fix: attribute [simp] ... in -> attribute [local simp] ... in (#7678)

Mathlib.Logic.Unique contains the line attribute [simp] eq_iff_true_of_subsingleton in ...:

https://github.com/leanprover-community/mathlib4/blob/96a11c7aac574c00370c2b3dab483cb676405c5d/Mathlib/Logic/Unique.lean#L255-L256

Despite what the in part may imply, this adds the lemma to the simp set "globally", including for downstream files; it is likely that attribute [local simp] eq_iff_true_of_subsingleton in ... was meant instead (or maybe scoped simp, but I think "scoped" refers to the current namespace). Indeed, the relevant lemma is not marked with @[simp] for possible slowness: https://github.com/leanprover/std4/blob/846e9e1d6bb534774d1acd2dc430e70987da3c18/Std/Logic.lean#L749. Adding it to the simp set causes the example at https://leanprover.zulipchat.com/#narrow/stream/287929-mathlib4/topic/Regression.20in.20simp to slow down.

This PR changes this and fixes the relevant downstream simps. There was also one ocurrence of attribute [simp] FullSubcategory.comp_def FullSubcategory.id_def in in Mathlib.CategoryTheory.Monoidal.Subcategory but that was much easier to fix.

https://github.com/leanprover-community/mathlib4/blob/bc49eb9ba756a233370b4b68bcdedd60402f71ed/Mathlib/CategoryTheory/Monoidal/Subcategory.lean#L118-L119

1fe87718

Diff

@@ -115,7 +115,7 @@ theorem one_toPGame_leftMoves_default_eq :
 @[simp]
 theorem to_leftMoves_one_toPGame_symm (i) :
     (@toLeftMovesToPGame 1).symm i = ⟨0, Set.mem_Iio.mpr zero_lt_one⟩ := by
-  simp
+  simp [eq_iff_true_of_subsingleton]
 #align ordinal.to_left_moves_one_to_pgame_symm Ordinal.to_leftMoves_one_toPGame_symm
 
 theorem one_toPGame_moveLeft (x) : (toPGame 1).moveLeft x = toPGame 0 := by simp

b90e72c7

chore: move Game to SetTheory.Game (#6365)

move Game and PGame into namespace SetTheory as _root_.Game might collide with other definitions (e.g. in projects depending on mathlib)

404fef6a

Diff

@@ -11,8 +11,8 @@ import Mathlib.SetTheory.Ordinal.NaturalOps
 /-!
 # Ordinals as games
 
-We define the canonical map `Ordinal → PGame`, where every ordinal is mapped to the game whose left
-set consists of all previous ordinals.
+We define the canonical map `Ordinal → SetTheory.PGame`, where every ordinal is mapped to the
+game whose left set consists of all previous ordinals.
 
 The map to surreals is defined in `Ordinal.toSurreal`.
 
@@ -25,7 +25,7 @@ The map to surreals is defined in `Ordinal.toSurreal`.
 
 universe u
 
-open PGame
+open SetTheory PGame
 
 open scoped NaturalOps PGame

b90e72c7

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -2,15 +2,12 @@
 Copyright (c) 2022 Violeta Hernández Palacios. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Violeta Hernández Palacios
-
-! This file was ported from Lean 3 source module set_theory.game.ordinal
-! leanprover-community/mathlib commit b90e72c7eebbe8de7c8293a80208ea2ba135c834
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathlib.SetTheory.Game.Basic
 import Mathlib.SetTheory.Ordinal.NaturalOps
 
+#align_import set_theory.game.ordinal from "leanprover-community/mathlib"@"b90e72c7eebbe8de7c8293a80208ea2ba135c834"
+
 /-!
 # Ordinals as games

b90e72c7

chore: cleanup whitespace (#5988)

Grepping for [^ .:{-] [^ :] and reviewing the results. Once I started I couldn't stop. :-)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

12343aa5

Diff

@@ -201,7 +201,7 @@ theorem toPGame_add : ∀ a b : Ordinal.{u}, a.toPGame + b.toPGame ≈ (a ♯ b)
       · exact nadd_lt_nadd_left wf _
     · rw [toPGame_moveLeft']
       rcases lt_nadd_iff.1 (toLeftMovesToPGame_symm_lt i) with (⟨c, hc, hc'⟩ | ⟨c, hc, hc'⟩) <;>
-      rw [← toPGame_le_iff, ← le_congr_right (toPGame_add _ _)] at hc'  <;>
+      rw [← toPGame_le_iff, ← le_congr_right (toPGame_add _ _)] at hc' <;>
       apply lf_of_le_of_lf hc'
       · apply add_lf_add_right
         rwa [toPGame_lf_iff]

b90e72c7

feat: port SetTheory.Game.Ordinal (#5480)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

d2f4ea7a

`set_theory.game.ordinal` ⟷ `Mathlib.SetTheory.Game.Ordinal`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 7 + 311

set_theory.game.ordinal ⟷ Mathlib.SetTheory.Game.Ordinal

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 7 + 311

`set_theory.game.ordinal` ⟷ `Mathlib.SetTheory.Game.Ordinal`