Skip to content
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 by Bors] - chore: robustify proof in CategoryTheory.Limit.VanKampen #14635

Closed
wants to merge 2 commits into from
Closed

[Merged by Bors] - chore: robustify proof in CategoryTheory.Limit.VanKampen #14635

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
1dddf0b
chore: robustify proof in CategoryTheory.Limit.VanKampen
kim-em Jul 11, 2024
0bc479a
Update Mathlib/CategoryTheory/Limits/VanKampen.lean
kim-em Jul 11, 2024
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
5 changes: 2 additions & 3 deletions Mathlib/CategoryTheory/Limits/VanKampen.lean
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -570,9 +570,8 @@ theorem BinaryCofan.isVanKampen_mk {X Y : C} (c : BinaryCofan X Y)
have he₁ : c'.inl = e₁.hom ≫ (cones f c.inl).fst := by simp [e₁]
have he₂ : c'.inr = e₂.hom ≫ (cones f c.inr).fst := by simp [e₂]
rw [he₁, he₂]
apply BinaryCofan.isColimitCompRightIso (BinaryCofan.mk _ _)
apply BinaryCofan.isColimitCompLeftIso (BinaryCofan.mk _ _)
exact h₂ f
exact (BinaryCofan.mk _ _).isColimitCompRightIso e₂.hom
((BinaryCofan.mk _ _).isColimitCompLeftIso e₁.hom (h₂ f))
#align category_theory.binary_cofan.is_van_kampen_mk CategoryTheory.BinaryCofan.isVanKampen_mk

theorem BinaryCofan.mono_inr_of_isVanKampen [HasInitial C] {X Y : C} {c : BinaryCofan X Y}
Expand Down
Loading