A -edge-connected component is a maximal subgraph with no bridges. Any two vertices in the component have at least two edge-disjoint paths between them. If you remove any single edge from a -edge-connected component, it stays connected because there is always a backup path.
The entire graph can be partitioned into -edge-connected components separated by bridges. Each component is internally resilient to single edge failures.