Unbreak build (#1478)

Looks like #1473 got merged before passing the CI.

Author: lowasser

src/univalent-combinatorics/finitely-enumerable-types.lagda.md

@@ -51,7 +51,7 @@ open import univalent-combinatorics.surjective-maps
 ## Idea
 
 A type `X` is
-{{#concept "finitely enumerable" disambiguation="type" Agda=finitely-enumerable-type}}
+{{#concept "finitely enumerable" disambiguation="type" Agda=is-finitely-enumerable}}
 if there [exists](foundation.existential-quantification.md) an `n : ℕ` and a
 [surjection](foundation.surjective-maps.md) from `Fin n → X`.