Open EdAyers opened 4 years ago
limit.lift_self_id
pullback.lift_self_id
pullback.with_id_l
pullback.comp_l
For with_id_l, here's what the type could look like
with_id_l
lemma pullback.with_id_l' {X Y : C} (f : X ⟶ Y) : is_limit (pullback_cone.mk f (𝟙 X) (show f ≫ (𝟙 Y) = (𝟙 X) ≫ f, by simp)) :=
limit.lift_self_id
pullback.lift_self_id
pullback.with_id_l
pullback.comp_l
it's a corol of Bhavik's pasting lemma