let G be Group; :: thesis: for a being Element of G
for H being Subgroup of G holds Index H = Index (H |^ a)

let a be Element of G; :: thesis: for H being Subgroup of G holds Index H = Index (H |^ a)
let H be Subgroup of G; :: thesis: Index H = Index (H |^ a)
defpred S1[ set , set ] means ex b being Element of G st
( $1 = b * H & $2 = (b |^ a) * (H |^ a) );
A1: for x being set st x in Left_Cosets H holds
ex y being set st S1[x,y]
proof
let x be set ; :: thesis: ( x in Left_Cosets H implies ex y being set st S1[x,y] )
assume x in Left_Cosets H ; :: thesis: ex y being set st S1[x,y]
then consider b being Element of G such that
A2: x = b * H by GROUP_2:def 15;
reconsider y = (b |^ a) * (H |^ a) as set ;
take y ; :: thesis: S1[x,y]
take b ; :: thesis: ( x = b * H & y = (b |^ a) * (H |^ a) )
thus ( x = b * H & y = (b |^ a) * (H |^ a) ) by A2; :: thesis: verum
end;
consider f being Function such that
A3: dom f = Left_Cosets H and
A4: for x being set st x in Left_Cosets H holds
S1[x,f . x] from CLASSES1:sch 1(A1);
A5: for x, y1, y2 being set st x in Left_Cosets H & S1[x,y1] & S1[x,y2] holds
y1 = y2
proof
set A = carr H;
let x, y1, y2 be set ; :: thesis: ( x in Left_Cosets H & S1[x,y1] & S1[x,y2] implies y1 = y2 )
assume x in Left_Cosets H ; :: thesis: ( not S1[x,y1] or not S1[x,y2] or y1 = y2 )
given b being Element of G such that A6: x = b * H and
A7: y1 = (b |^ a) * (H |^ a) ; :: thesis: ( not S1[x,y2] or y1 = y2 )
given c being Element of G such that A8: x = c * H and
A9: y2 = (c |^ a) * (H |^ a) ; :: thesis: y1 = y2
thus y1 = (((a " ) * b) * a) * (((a " ) * H) * a) by A7, Th71
.= ((((a " ) * b) * a) * ((a " ) * (carr H))) * a by GROUP_2:39
.= (((a " ) * b) * (a * ((a " ) * (carr H)))) * a by GROUP_2:38
.= (((a " ) * b) * ((a * (a " )) * (carr H))) * a by GROUP_2:38
.= (((a " ) * b) * ((1_ G) * (carr H))) * a by GROUP_1:def 6
.= (((a " ) * b) * (carr H)) * a by GROUP_2:43
.= ((a " ) * (c * H)) * a by A6, A8, GROUP_2:38
.= (((a " ) * c) * (carr H)) * a by GROUP_2:38
.= (((a " ) * c) * ((1_ G) * (carr H))) * a by GROUP_2:43
.= (((a " ) * c) * ((a * (a " )) * (carr H))) * a by GROUP_1:def 6
.= (((a " ) * c) * (a * ((a " ) * (carr H)))) * a by GROUP_2:38
.= ((((a " ) * c) * a) * ((a " ) * (carr H))) * a by GROUP_2:38
.= (((a " ) * c) * a) * (((a " ) * H) * a) by GROUP_2:39
.= y2 by A9, Th71 ; :: thesis: verum
end;
A10: rng f = Left_Cosets (H |^ a)
proof
thus rng f c= Left_Cosets (H |^ a) :: according to XBOOLE_0:def 10 :: thesis: Left_Cosets (H |^ a) c= rng f
proof
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in rng f or x in Left_Cosets (H |^ a) )
assume x in rng f ; :: thesis: x in Left_Cosets (H |^ a)
then consider y being set such that
A11: ( y in dom f & f . y = x ) by FUNCT_1:def 5;
ex b being Element of G st
( y = b * H & x = (b |^ a) * (H |^ a) ) by A3, A4, A11;
hence x in Left_Cosets (H |^ a) by GROUP_2:def 15; :: thesis: verum
end;
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in Left_Cosets (H |^ a) or x in rng f )
assume x in Left_Cosets (H |^ a) ; :: thesis: x in rng f
then consider b being Element of G such that
A12: x = b * (H |^ a) by GROUP_2:def 15;
set c = b |^ (a " );
A13: x = ((b |^ (a " )) |^ a) * (H |^ a) by A12, Th30;
A14: (b |^ (a " )) * H in Left_Cosets H by GROUP_2:def 15;
then consider d being Element of G such that
A15: (b |^ (a " )) * H = d * H and
A16: f . ((b |^ (a " )) * H) = (d |^ a) * (H |^ a) by A4;
((b |^ (a " )) |^ a) * (H |^ a) = (d |^ a) * (H |^ a) by A5, A14, A15;
hence x in rng f by A3, A13, A14, A16, FUNCT_1:def 5; :: thesis: verum
end;
f is one-to-one
proof
let x be set ; :: according to FUNCT_1:def 8 :: thesis: for b1 being set holds
( not x in proj1 f or not b1 in proj1 f or not f . x = f . b1 or x = b1 )

let y be set ; :: thesis: ( not x in proj1 f or not y in proj1 f or not f . x = f . y or x = y )
assume that
A17: x in dom f and
A18: y in dom f and
A19: f . x = f . y ; :: thesis: x = y
consider c being Element of G such that
A20: y = c * H and
A21: f . y = (c |^ a) * (H |^ a) by A3, A4, A18;
consider b being Element of G such that
A22: x = b * H and
A23: f . x = (b |^ a) * (H |^ a) by A3, A4, A17;
A24: ((c |^ a) " ) * (b |^ a) = ((c " ) |^ a) * (b |^ a) by Th32
.= ((c " ) * b) |^ a by Th28 ;
((c |^ a) " ) * (b |^ a) in H |^ a by A19, A23, A21, GROUP_2:137;
then consider d being Element of G such that
A25: ((c " ) * b) |^ a = d |^ a and
A26: d in H by A24, Th70;
(c " ) * b = d by A25, Th21;
hence x = y by A22, A20, A26, GROUP_2:137; :: thesis: verum
end;
then Left_Cosets H, Left_Cosets (H |^ a) are_equipotent by A3, A10, WELLORD2:def 4;
hence Index H = Index (H |^ a) by CARD_1:21; :: thesis: verum