To get the correct notion of surjection, it is very important that you use an existential quantifier / truncated dependent sum. Your definition means something, but it doesn't mean "surjection".
|
\func isEssentiallySurjective {A B : Precategory} (F : Functor A B) => \Pi (y : B) -> \Sigma (x : A) (F.F x ~= y) |
Passing to the correct definition of essential surjectivity will have some consequences; you will not be able to prove the "full/faithfull/ess.surj. <=> equivalence" theorem for precategories, but it will remain true for univalent categories.
To get the correct notion of surjection, it is very important that you use an existential quantifier / truncated dependent sum. Your definition means something, but it doesn't mean "surjection".
hStacks/src/S4_2_0013.ard
Line 128 in f589fa0
Passing to the correct definition of essential surjectivity will have some consequences; you will not be able to prove the "full/faithfull/ess.surj. <=> equivalence" theorem for precategories, but it will remain true for univalent categories.