Typo

Author: FnControlOption

content/sets-functions-relations/size-of-sets/enumerability.tex

@@ -210,7 +210,7 @@
 !!a{surjective} function $f\colon \Nat \to A$.
 \end{cor}
 
-We discussed above than an list of !!{element}s of a set~$A$ can be
+We discussed above that a list of !!{element}s of a set~$A$ can be
 turned into a list without repetitions. This is also true for
 enumerations, but a bit harder to formulate and prove rigorously. Any
 function $f\colon \PosInt \to A$ must be defined for all $n \in