An edge set of a graph is a set of doubletons, pairing edges. For example:

has an edge set of $\{\{6,4\},\{4,5\},\{4,3\},\{5,2\},\{5,1\},\{3,2\},\{1,2\}\}$. A set, by definition, cannot have duplicate elements, else it is not a set.

is a multigraph. All graphs have edge sets, yet the edge set of the multigraph would have to contain duplicate sets in its edge set to properly represent its edges, but then it wouldn't have an edge set, because a set cannot possibly have duplicate elements. I suppose its edge set would be $\{\{1,3\},\{1,2\},\{2,4\},\{2,4\},\{2,4\}\}$, but then it wouldn't be a set, having three instances of the same member.
Question
How do I represent the edge set of a multigraph, which have multiple edges along the same vertices?
I believe the term multiset is used to refer to a set that may have duplicate elements. This term makes sense here, especially since it is cohesive with the term multigraph. If you really want to keep the edgeset as a set you could let each element of the egdeset be a pair that consists of the edge itself and the mutliplicity of the edge. So the edgeset of the multigraph you posted would be $$ \{(\{1,2\},1),(\{1,3\},1),(\{2,4\},3)\} $$ If we go with the multiset term, the question then becomes this: should we call it a multiedgeset or an edgemultiset?