Defective Goldberg-Seymour conjecture

Let $d\in\mathbb N^*$ and let $G$ be a graph. Define

$$\Gamma_d(G)=\max\left\{\left\lceil \frac{|E(G[X])|}{\left\lfloor d|X|/2\right\rfloor}\right\rceil\mathrel{:}X\subseteq V(G)\right\}.$$

Defective Goldberg-Seymour conjecture. Every graph $G$ satisfies

$$\chi'_d(G)\leq \max\left\{\Gamma_d(G),\left\lceil \frac{\Delta(G)+1}{d}\right\rceil\right\}.$$

This is proposed as a generalization of the Goldberg-Seymour bound to defective edge colouring; no proof or counterexample is supplied in the source.