-- Mathlib/CategoryTheory/Filtered/Small.lean
theorem small_fullSubcategory_filteredClosure :
    Small.{max v w} (FullSubcategory (FilteredClosure f))

Proof state:
case mk.base
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
x : α
⊢ ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := f x, property := ⋯ }.obj

Tactic:
exact ⟨⟨0, ⟨x⟩⟩, rfl⟩

Result:
no goals

Proof state:
case mk.coeq.intro.mk.intro.mk.refine_2
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
m : ℕ
y : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f m).fst
hj₂ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩)
g g' :
  CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩ ⟶
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩
⊢ m < n ⊔ m + 1

Tactic:
apply Nat.lt_succ_of_le

Result:
case mk.coeq.intro.mk.intro.mk.refine_2.a
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
m : ℕ
y : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f m).fst
hj₂ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩)
g g' :
  CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩ ⟶
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩
⊢ m ≤ n ⊔ m

Proof state:
case mk.max
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j j✝ j'✝ : C
hj₁ : FilteredClosure f j✝
hj₂ : FilteredClosure f j'✝
ih :
  ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := j✝, property := hj₁ }.obj
ih' :
  ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := j'✝, property := hj₂ }.obj
⊢ ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := max j✝ j'✝, property := ⋯ }.obj

Tactic:
rcases ih with ⟨⟨n, x⟩, rfl⟩

Result:
case mk.max.intro.mk
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j j'✝ : C
hj₂ : FilteredClosure f j'✝
ih' :
  ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := j'✝, property := hj₂ }.obj
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
⊢ ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := max (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩) j'✝,
          property := ⋯ }.obj

Proof state:
case mk.coeq.intro.mk.intro.mk.refine_1
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
m : ℕ
y : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f m).fst
hj₂ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩)
g g' :
  CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩ ⟶
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩
⊢ n < n ⊔ m + 1

case mk.coeq.intro.mk.intro.mk.refine_2
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
m : ℕ
y : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f m).fst
hj₂ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩)
g g' :
  CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩ ⟶
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩
⊢ m < n ⊔ m + 1

Tactic:
all_goals apply Nat.lt_succ_of_le

Result:
case mk.coeq.intro.mk.intro.mk.refine_1.a
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
m : ℕ
y : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f m).fst
hj₂ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩)
g g' :
  CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩ ⟶
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩
⊢ n ≤ n ⊔ m

case mk.coeq.intro.mk.intro.mk.refine_2.a
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
n : ℕ
x : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f n).fst
hj₁ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩)
m : ℕ
y : (CategoryTheory.IsFiltered.FilteredClosureSmall.bundledAbstractFilteredClosure f m).fst
hj₂ : FilteredClosure f (CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩)
g g' :
  CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨n, x⟩ ⟶
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f ⟨m, y⟩
⊢ m ≤ n ⊔ m

Proof state:
case mk
C : Type u
inst✝¹ : Category.{v, u} C
inst✝ : IsFilteredOrEmpty C
α : Type w
f : α → C
j : C
h : FilteredClosure f j
⊢ ∃ a,
    CategoryTheory.IsFiltered.FilteredClosureSmall.abstractFilteredClosureRealization f a =
      { obj := j, property := h }.obj

Tactic:
induction h with
| base x => exact ⟨⟨0, ⟨x⟩⟩, rfl⟩
| max hj₁ hj₂ ih ih' =>
  rcases ih with ⟨⟨n, x⟩, rfl⟩
  rcases ih' with ⟨⟨m, y⟩, rfl⟩
  refine ⟨⟨(Max.max n m).succ, FilteredClosureSmall.InductiveStep.max ?_ ?_ x y⟩, rfl⟩
  all_goals apply Nat.lt_succ_of_le
  exacts [Nat.le_max_left _ _, Nat.le_max_right _ _]
| coeq hj₁ hj₂ g g' ih ih' =>
  rcases ih with ⟨⟨n, x⟩, rfl⟩
  rcases ih' with ⟨⟨m, y⟩, rfl⟩
  refine ⟨⟨(Max.max n m).succ, FilteredClosureSmall.InductiveStep.coeq ?_ ?_ x y g g'⟩, rfl⟩
  all_goals apply Nat.lt_succ_of_le
  exacts [Nat.le_max_left _ _, Nat.le_max_right _ _]

Result:
no goals