Skip to content
Closed
Changes from all commits
Commits
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
6 changes: 6 additions & 0 deletions Mathlib/CategoryTheory/Category/Preorder.lean
Original file line number Diff line number Diff line change
Expand Up @@ -92,6 +92,12 @@ lemma homOfLE_isIso_of_eq {x y : X} (h : x ≤ y) (heq : x = y) :
IsIso (homOfLE h) :=
⟨homOfLE (le_of_eq heq.symm), by simp⟩

lemma isIso_homOfLE {x y : X} (h : x = y) :
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This can be weakened to AntisymmRel (· ≤ ·) x y, right?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

This would require an extra import. Anyway, the more useful basic lemma would still be the one using an equality as an assumption.

Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

If AntisymmRel is a heavy import by any measure, then we should refactor the file!

IsIso (homOfLE (by rw [h]) : x ⟶ y) := by
subst h
change IsIso (𝟙 _)
infer_instance

@[simp, reassoc]
lemma homOfLE_comp_eqToHom {a b c : X} (hab : a ≤ b) (hbc : b = c) :
homOfLE hab ≫ eqToHom hbc = homOfLE (hab.trans (le_of_eq hbc)) :=
Expand Down