If you consider this problem trivial today, this is in part due to the fact that Euler created the language of graph theory that makes it easy to formulate this kinds of reasoning. Indeed the general fact that a connected graph admits an Eulerian path (if and) only if at most two vertices have odd degree is a very simple theorem of graph theory. But in Euler's time, mathematics simply did not have much language to discuss or solve this kinds of problems, so it is to the credit of Euler that he put in place the abstractions necessary to do these things cleanly. This was a more fundamental step than developing more involved theorems once the language is in place.
You may object that you did not need the language of graph theory to formulate an obstruction showing that the problem is unsolvable. Well, you may not have used the same language, but the argument is based exactly on the same abstractions that lead to graph theory. The very fact of formulating the problem in terms of landmasses (vertices) linked by bridges (edges), and reducing the route followed to a sequence of bridges crossed, is precisely the abstraction that makes the problem tractable, and indeed quite easy. You need not know about graph theory, or even be aware that you are doing this abstraction when formulating the obstruction, but if you try to analyse carefully what makes your argument work, you will find that in the end this abstraction is the crucial factor.
It seems unlikely many people cared about the seven bridges problem at all before Euler dealt with it. Or maybe some did, but after a bit of reflection concluded that there is (probably) no solution, and stopped worrying about it; history would certainly have forgotten them. The great insight of Euler is that a powerful abstraction is involved that can be applied very effectively to a wide range of more difficult problems.
Of course if Euler hadn't invented graph theory someone else would have; it is a fairly natural thing to do. But it happened to be Euler who did it first.