A graph \(G\) is called a fractional ID-\((g,f)\)-factor-critical covered graph if for any independent set \(I\) of \(G\) and for every edge \(e\in E(G-I)\), \(G-I\) has a fractional \((g,f)\)-factor \(h\) such that \(h(e)=1\). We give a sufficient condition using degree condition for a graph to be a fractional ID-\((g,f)\)-factor-critical covered graph. Our main result is an extension of Zhou, Bian and Wu’s previous result [S. Zhou, Q. Bian, J. Wu, A result on fractional ID-\(k\)-factor-critical graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 87(2013)229–236] and Yashima’s previous result [T. Yashima, A
degree condition for graphs to be fractional ID-\([a,b]\)-factor-critical, Australasian Journal of Combinatorics 65(2016)191–199].