It's known that every cubic bridgeless graph has 1-factor (Petersen). But Does anybody know, how to prove that for every edge in a cubic bridgeless graph there exists a 1-factor, which contains it?

Because I found articles, where this is stated, but no proof of it so far (for example this one - theorem 2.1.)

Thanks in advance