Kőnig's edge-coloring theorem for bipartite graphs and Vizing's edge-coloring theorem for general graphs are celebrated results in graph theory and combinatorial optimization. Schrijver generalized Kőnig's theorem to a framework defined with a pair of intersecting supermodular functions. The result is called the supermodular coloring theorem. This paper presents a common generalization of Vizing's theorem and a weaker version of the supermodular coloring theorem. To describe this theorem, we introduce strongly triple-intersecting supermodular functions, which are extensions of intersecting supermodular functions. The paper also provides an alternative proof of Gupta's edge-coloring theorem using a special case of this supermodular version of Vizing's theorem.