set A = regularAction G;
now :: thesis: for g being Element of G st ex x being Element of G st (regularAction G) . (g,x) = x holds
g = 1_ G
let g be Element of G; :: thesis: ( ex x being Element of G st (regularAction G) . (g,x) = x implies g = 1_ G )
assume ex x being Element of G st (regularAction G) . (g,x) = x ; :: thesis: g = 1_ G
then consider x being Element of G such that
B: (regularAction G) . (g,x) = x ;
g * x = x by B, dreg;
hence g = 1_ G by GROUP_1:7; :: thesis: verum
end;
hence regularAction G is free ; :: thesis: verum