proposition: Lemma ff_es_homtype_weq (FFF : fully_faithful F) (FES : essentially_surjective F) : (∏ d d' : ob D, ∥ ∑ c c' : ob C, C⟦c, c'⟧ ≃ D⟦d, d'⟧ ∥).
proof: Proof. intros d d'. apply (squash_to_prop (FES d)); [apply isapropishinh|]; intros c. apply (squash_to_prop (FES d')); [apply isapropishinh|]; intros c'. apply hinhpr. exists (pr1 c), (pr1 c'). intermediate_weq (D ⟦ F (pr1 c), F (pr1 c') ⟧). - apply weq_from_fully_faithful; assumption. - intermediate_weq (D ⟦ F (pr1 c), d' ⟧). + eapply make_weq. apply z_iso_comp_left_isweq. Unshelve. exact (pr2 c'). + eapply make_weq. apply z_iso_comp_right_weq. Unshelve. exact (z_iso_inv_from_is_z_iso (pr1 (pr2 c)) (pr2 (pr2 c))). Defined.
imports: UniMath.Foundations.PartD UniMath.Foundations.Propositions UniMath.CategoryTheory.Core.Categories UniMath.CategoryTheory.Core.Isos UniMath.CategoryTheory.Core.NaturalTransformations UniMath.CategoryTheory.Core.Functors UniMath.CategoryTheory.Adjunctions.Core UniMath.CategoryTheory.Equivalences.Core