Library UniMath.Bicategories.RezkCompletions.StructuredCats.FiniteColimits

In this file, we conclude that the Rezk completion for categories lifts to finitely cocomplete categories.
Contents: 1. CategoriesWithFiniteColimitsAdmitRezkCompletions proves the existence of a displayed universal arrow for the inclusion of univalent finitely cocomplete categories into all finitely cocomplete categories.

1. Rezk completion for finitely cocomplete categories

Section CategoriesWithFiniteColimitsAdmitRezkCompletions.

  Context (LUR : left_universal_arrow univ_cats_to_cats)
    (η_weak_equiv : C : category, is_weak_equiv (pr12 LUR C)).

  Lemma disp_bicat_initial_has_RC
    : cat_with_struct_has_RC η_weak_equiv disp_bicat_initial.
  Show proof.
    simple refine (_ ,, _ ,, _).
    - intros C1 C2 C2_univ F Fw [T1 _].
      exact (make_Initial _ (weak_equiv_preserves_initial _ Fw _ (pr2 T1)) ,, tt).
    - intros C [T1 ?].
      refine (tt ,, _).
      use weak_equiv_preserves_initial.
      apply η_weak_equiv.
    - simpl ; intros C1 C2 C3 F G H α [T1 _] [T2 _] [T3 _] Gw.
      intros [t Fpinit].
      exists tt.
      exact (weak_equiv_lifts_preserves_initial α Gw Fpinit).

  Corollary disp_bicat_initial_has_Rezk_completions
    : cat_with_structure_has_RezkCompletion disp_bicat_initial.
  Show proof.

  Lemma disp_bicat_bincoproducts_has_RC
    : cat_with_struct_has_RC η_weak_equiv disp_bicat_bincoproducts.
  Show proof.
    simple refine (_ ,, _ ,, _).
    - intros C1 C2 C2_univ F Fw [P1 _].
      exact (weak_equiv_creates_bincoproducts Fw P1 C2_univ ,, tt).
    - intros C [P1 ?].
      refine (tt ,, _).
      use weak_equiv_preserves_bincoproducts.
      apply η_weak_equiv.
    - simpl ; intros C1 C2 C3 F G H α [T1 _] [T2 _] [T3 _] Gw.
      intros [t Fp].
      exists tt.
      exact (weak_equiv_lifts_preserves_bincoproducts C2 C3 α Gw Fp).

  Corollary disp_bicat_bincoproducts_has_Rezk_completions
    : cat_with_structure_has_RezkCompletion disp_bicat_bincoproducts.
  Show proof.

  Lemma disp_bicat_coequalizers_has_RC
    : cat_with_struct_has_RC η_weak_equiv disp_bicat_coequalizers.
  Show proof.
    simple refine (_ ,, _ ,, _).
    - intros C1 C2 C2_univ F Fw [P1 _].
      exact (weak_equiv_creates_coequalizers Fw C2_univ P1 ,, tt).
    - intros C [P1 ?].
      refine (tt ,, _).
      use weak_equiv_preserves_coequalizers.
      apply η_weak_equiv.
    - simpl ; intros C1 C2 C3 F G H α [T1 _] [T2 _] [T3 _] Gw.
      intros [t Fp].
      exists tt.
      exact (weak_equiv_lifts_preserves_coequalizers C2 C3 α Gw Fp).

  Corollary disp_bicat_coequalizers_has_Rezk_completions
    : cat_with_structure_has_RezkCompletion disp_bicat_coequalizers.
  Show proof.

  Lemma disp_bicat_colimits_has_RC
    : cat_with_struct_has_RC η_weak_equiv disp_bicat_colimits.
  Show proof.

  Theorem disp_bicat_colimits_has_RezkCompletion
    : cat_with_structure_has_RezkCompletion disp_bicat_colimits.
  Show proof.

End CategoriesWithFiniteColimitsAdmitRezkCompletions.