let G be Group; :: thesis: for X being non empty set
for A being Action of G,X holds
( A is faithful iff canHom A is one-to-one )

let X be non empty set ; :: thesis: for A being Action of G,X holds
( A is faithful iff canHom A is one-to-one )

let A be Action of G,X; :: thesis: ( A is faithful iff canHom A is one-to-one )
set f = canHom A;
B: now :: thesis: ( A is faithful implies canHom A is one-to-one )
assume C: A is faithful ; :: thesis: canHom A is one-to-one
now :: thesis: for x1, x2 being object st x1 in the carrier of G & x2 in the carrier of G & (canHom A) . x1 = (canHom A) . x2 holds
x1 = x2
let x1, x2 be object ; :: thesis: ( x1 in the carrier of G & x2 in the carrier of G & (canHom A) . x1 = (canHom A) . x2 implies x1 = x2 )
assume D: ( x1 in the carrier of G & x2 in the carrier of G & (canHom A) . x1 = (canHom A) . x2 ) ; :: thesis: x1 = x2
then reconsider g1 = x1, g2 = x2 as Element of G ;
E: apply (A,g1) = (canHom A) . g2 by D, defHom
.= apply (A,g2) by defHom ;
now :: thesis: for x being Element of X holds A . (g1,x) = A . (g2,x)
let x be Element of X; :: thesis: A . (g1,x) = A . (g2,x)
thus A . (g1,x) = (apply (A,g2)) . x by E, defApp
.= A . (g2,x) by defApp ; :: thesis: verum
end;
hence x1 = x2 by C; :: thesis: verum
end;
hence canHom A is one-to-one ; :: thesis: verum
end;
now :: thesis: ( canHom A is one-to-one implies A is faithful )
assume C: canHom A is one-to-one ; :: thesis: A is faithful
now :: thesis: for g1, g2 being Element of G st ( for x being Element of X holds A . (g1,x) = A . (g2,x) ) holds
g1 = g2
let g1, g2 be Element of G; :: thesis: ( ( for x being Element of X holds A . (g1,x) = A . (g2,x) ) implies g1 = g2 )
assume D: for x being Element of X holds A . (g1,x) = A . (g2,x) ; :: thesis: g1 = g2
now :: thesis: for o being object st o in X holds
(apply (A,g1)) . o = (apply (A,g2)) . o
let o be object ; :: thesis: ( o in X implies (apply (A,g1)) . o = (apply (A,g2)) . o )
assume o in X ; :: thesis: (apply (A,g1)) . o = (apply (A,g2)) . o
then reconsider x = o as Element of X ;
thus (apply (A,g1)) . o = A . (g1,x) by defApp
.= A . (g2,x) by D
.= (apply (A,g2)) . o by defApp ; :: thesis: verum
end;
then apply (A,g1) = apply (A,g2) ;
then (canHom A) . g1 = apply (A,g2) by defHom
.= (canHom A) . g2 by defHom ;
hence g1 = g2 by C; :: thesis: verum
end;
hence A is faithful ; :: thesis: verum
end;
hence ( A is faithful iff canHom A is one-to-one ) by B; :: thesis: verum