let G be finite Group; :: thesis: for a being Element of G holds ord a = card (gr {a})
let a be Element of G; :: thesis: ord a = card (gr {a})
deffunc H1( Nat) -> Element of the carrier of G = a |^ $1;
consider F being FinSequence such that
A1: len F = ord a and
A2: for p being Nat st p in dom F holds
F . p = H1(p) from FINSEQ_1:sch 2();
A3: dom F = Seg (ord a) by A1, FINSEQ_1:def 3;
not a is being_of_order_0 by Th26;
then A4: ord a <> 0 by GROUP_1:def 12;
then A5: ord a > 0 ;
A6: a in rng F
proof
ex x being set st
( x in dom F & F . x = a )
proof
set x' = 1;
A7: 1 in dom F
proof
(ord a) + 1 > 0 + 1 by A5, XREAL_1:8;
then ord a >= 1 by NAT_1:13;
hence 1 in dom F by A3; :: thesis: verum
end;
then F . 1 = a |^ 1 by A2
.= a by GROUP_1:44 ;
hence ex x being set st
( x in dom F & F . x = a ) by A7; :: thesis: verum
end;
hence a in rng F by FUNCT_1:def 5; :: thesis: verum
end;
A8: rng F = the carrier of (gr {a})
proof
A9: for y being set st y in rng F holds
ex n being Element of NAT st y = a |^ n
proof
let y be set ; :: thesis: ( y in rng F implies ex n being Element of NAT st y = a |^ n )
assume y in rng F ; :: thesis: ex n being Element of NAT st y = a |^ n
then consider x being set such that
A10: x in dom F and
A11: F . x = y by FUNCT_1:def 5;
reconsider n = x as Element of NAT by A10;
take n ; :: thesis: y = a |^ n
thus y = a |^ n by A2, A10, A11; :: thesis: verum
end;
A12: rng F c= the carrier of (gr {a})
proof
for x being set st x in rng F holds
x in the carrier of (gr {a})
proof
let y be set ; :: thesis: ( y in rng F implies y in the carrier of (gr {a}) )
assume y in rng F ; :: thesis: y in the carrier of (gr {a})
then consider n being Element of NAT such that
A13: y = a |^ n by A9;
y in gr {a} by A13, Th25;
hence y in the carrier of (gr {a}) by STRUCT_0:def 5; :: thesis: verum
end;
hence rng F c= the carrier of (gr {a}) by TARSKI:def 3; :: thesis: verum
end;
the carrier of (gr {a}) c= rng F
proof
ex H being strict Subgroup of G st the carrier of H = rng F
proof
reconsider car = rng F as non empty set by A6;
A14: dom the multF of G = [:the carrier of G,the carrier of G:] by FUNCT_2:def 1;
the carrier of (gr {a}) c= the carrier of G by GROUP_2:def 5;
then A15: car c= the carrier of G by A12, XBOOLE_1:1;
then A16: dom (the multF of G || car) = [:car,car:] by A14, RELAT_1:91, ZFMISC_1:119;
rng (the multF of G || car) c= car
proof
for y being set st y in rng (the multF of G || car) holds
y in car
proof
set f = the multF of G || car;
let y be set ; :: thesis: ( y in rng (the multF of G || car) implies y in car )
assume y in rng (the multF of G || car) ; :: thesis: y in car
then consider x being set such that
A17: x in dom (the multF of G || car) and
A18: (the multF of G || car) . x = y by FUNCT_1:def 5;
consider xp, yp being set such that
A19: [xp,yp] = x by A16, A17, RELAT_1:def 1;
xp in car by A16, A17, A19, ZFMISC_1:106;
then consider p being Element of NAT such that
A20: xp = a |^ p by A9;
yp in car by A16, A17, A19, ZFMISC_1:106;
then consider s being Element of NAT such that
A21: yp = a |^ s by A9;
A22: y = (a |^ p) * (a |^ s) by A17, A18, A19, A20, A21, FUNCT_1:70
.= a |^ (p + s) by GROUP_1:63 ;
a |^ (p + s) in car
proof
ex x being set st
( x in dom F & F . x = a |^ (p + s) )
proof
set t = (p + s) mod (ord a);
A23: (p + s) mod (ord a) < ord a by A5, NAT_D:1;
per cases ( (p + s) mod (ord a) = 0 or (p + s) mod (ord a) > 0 ) ;
suppose A24: (p + s) mod (ord a) = 0 ; :: thesis: ex x being set st
( x in dom F & F . x = a |^ (p + s) )

A25: a |^ (p + s) = a |^ (((ord a) * ((p + s) div (ord a))) + ((p + s) mod (ord a))) by A5, NAT_D:2
.= (a |^ ((ord a) * ((p + s) div (ord a)))) * (a |^ ((p + s) mod (ord a))) by GROUP_1:63
.= ((a |^ (ord a)) |^ ((p + s) div (ord a))) * (a |^ ((p + s) mod (ord a))) by GROUP_1:67
.= ((1_ G) |^ ((p + s) div (ord a))) * (a |^ ((p + s) mod (ord a))) by GROUP_1:82
.= (1_ G) * (a |^ ((p + s) mod (ord a))) by GROUP_1:61
.= a |^ 0 by A24, GROUP_1:def 5
.= 1_ G by GROUP_1:43
.= a |^ (ord a) by GROUP_1:82
.= F . (ord a) by A2, A3, A4, FINSEQ_1:5 ;
take x = ord a; :: thesis: ( x in dom F & F . x = a |^ (p + s) )
thus ( x in dom F & F . x = a |^ (p + s) ) by A3, A4, A25, FINSEQ_1:5; :: thesis: verum
end;
suppose (p + s) mod (ord a) > 0 ; :: thesis: ex x being set st
( x in dom F & F . x = a |^ (p + s) )

then ((p + s) mod (ord a)) + 1 > 0 + 1 by XREAL_1:8;
then A26: (p + s) mod (ord a) >= 1 by NAT_1:13;
take x = (p + s) mod (ord a); :: thesis: ( x in dom F & F . x = a |^ (p + s) )
A27: (p + s) mod (ord a) in dom F by A3, A23, A26;
a |^ (p + s) = a |^ (((ord a) * ((p + s) div (ord a))) + ((p + s) mod (ord a))) by A5, NAT_D:2
.= (a |^ ((ord a) * ((p + s) div (ord a)))) * (a |^ ((p + s) mod (ord a))) by GROUP_1:63
.= ((a |^ (ord a)) |^ ((p + s) div (ord a))) * (a |^ ((p + s) mod (ord a))) by GROUP_1:67
.= ((1_ G) |^ ((p + s) div (ord a))) * (a |^ ((p + s) mod (ord a))) by GROUP_1:82
.= (1_ G) * (a |^ ((p + s) mod (ord a))) by GROUP_1:61
.= a |^ ((p + s) mod (ord a)) by GROUP_1:def 5 ;
hence ( x in dom F & F . x = a |^ (p + s) ) by A2, A27; :: thesis: verum
end;
end;
end;
hence a |^ (p + s) in car by FUNCT_1:def 5; :: thesis: verum
end;
hence y in car by A22; :: thesis: verum
end;
hence rng (the multF of G || car) c= car by TARSKI:def 3; :: thesis: verum
end;
then reconsider op = the multF of G || car as BinOp of car by A16, FUNCT_2:def 1, RELSET_1:11;
set H = multMagma(# car,op #);
multMagma(# car,op #) is Group
proof
A28: for f, g being Element of multMagma(# car,op #)
for f', g' being Element of G st f = f' & g = g' holds
f' * g' = f * g
proof
let f, g be Element of multMagma(# car,op #); :: thesis: for f', g' being Element of G st f = f' & g = g' holds
f' * g' = f * g

let f', g' be Element of G; :: thesis: ( f = f' & g = g' implies f' * g' = f * g )
assume A29: ( f = f' & g = g' ) ; :: thesis: f' * g' = f * g
f * g = (the multF of G || car) . [f,g] ;
hence f' * g' = f * g by A29, FUNCT_1:72; :: thesis: verum
end;
A30: for f, g, h being Element of multMagma(# car,op #) holds (f * g) * h = f * (g * h)
proof
let f, g, h be Element of multMagma(# car,op #); :: thesis: (f * g) * h = f * (g * h)
reconsider f' = f, g' = g, h' = h as Element of G by A15, TARSKI:def 3;
A31: f' * g' = f * g by A28;
A32: g * h = g' * h' by A28;
(f * g) * h = (f' * g') * h' by A28, A31
.= f' * (g' * h') by GROUP_1:def 4
.= f * (g * h) by A28, A32 ;
hence (f * g) * h = f * (g * h) ; :: thesis: verum
end;
ex e being Element of multMagma(# car,op #) st
for h being Element of multMagma(# car,op #) holds
( h * e = h & e * h = h & ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) )
proof
a |^ (ord a) in car
proof
ex x being set st
( x in dom F & F . x = a |^ (ord a) )
proof
set x' = ord a;
F . (ord a) = a |^ (ord a) by A2, A3, A4, FINSEQ_1:5;
hence ex x being set st
( x in dom F & F . x = a |^ (ord a) ) by A3, A4, FINSEQ_1:5; :: thesis: verum
end;
hence a |^ (ord a) in car by FUNCT_1:def 5; :: thesis: verum
end;
then reconsider e = 1_ G as Element of multMagma(# car,op #) by GROUP_1:82;
take e ; :: thesis: for h being Element of multMagma(# car,op #) holds
( h * e = h & e * h = h & ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) )

for h being Element of multMagma(# car,op #) holds
( h * e = h & e * h = h & ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) )
proof
let h be Element of multMagma(# car,op #); :: thesis: ( h * e = h & e * h = h & ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) )

reconsider h' = h as Element of G by A15, TARSKI:def 3;
thus h * e = h :: thesis: ( e * h = h & ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) )
proof
h * e = h' * (1_ G) by A28
.= h' by GROUP_1:def 5 ;
hence h * e = h ; :: thesis: verum
end;
thus e * h = h :: thesis: ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e )
proof
e * h = (1_ G) * h' by A28
.= h' by GROUP_1:def 5 ;
hence e * h = h ; :: thesis: verum
end;
thus ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) :: thesis: verum
proof
ex n being Element of NAT st
( h = a |^ n & 1 <= n & ord a >= n )
proof
consider x being set such that
A33: x in dom F and
A34: F . x = h by FUNCT_1:def 5;
reconsider n = x as Element of NAT by A33;
take n ; :: thesis: ( h = a |^ n & 1 <= n & ord a >= n )
thus ( h = a |^ n & 1 <= n & ord a >= n ) by A2, A3, A33, A34, FINSEQ_1:3; :: thesis: verum
end;
then consider n being Element of NAT such that
A35: h = a |^ n and
A36: ord a >= n ;
a |^ ((ord a) - n) in car
proof
ex x being set st
( x in dom F & F . x = a |^ ((ord a) - n) )
proof
per cases ( ord a = n or ord a > n ) by A36, XXREAL_0:1;
suppose A37: ord a = n ; :: thesis: ex x being set st
( x in dom F & F . x = a |^ ((ord a) - n) )

set x = ord a;
F . (ord a) = a |^ (ord a) by A2, A3, A4, FINSEQ_1:5
.= 1_ G by GROUP_1:82
.= a |^ ((ord a) - n) by A37, GROUP_1:43 ;
hence ex x being set st
( x in dom F & F . x = a |^ ((ord a) - n) ) by A3, A4, FINSEQ_1:5; :: thesis: verum
end;
suppose A38: ord a > n ; :: thesis: ex x being set st
( x in dom F & F . x = a |^ ((ord a) - n) )

then reconsider x = (ord a) - n as Element of NAT by INT_1:18;
take x ; :: thesis: ( x in dom F & F . x = a |^ ((ord a) - n) )
x in Seg (ord a)
proof
reconsider r1 = ord a, r2 = n as Real ;
A39: x >= 1
proof
r1 - r2 > r2 - r2 by A38, XREAL_1:11;
then x >= 0 + 1 by NAT_1:13;
hence x >= 1 ; :: thesis: verum
end;
x <= ord a
proof
r1 <= r1 + r2 by NAT_1:11;
hence x <= ord a by XREAL_1:22; :: thesis: verum
end;
hence x in Seg (ord a) by A39; :: thesis: verum
end;
hence ( x in dom F & F . x = a |^ ((ord a) - n) ) by A2, A3; :: thesis: verum
end;
end;
end;
hence a |^ ((ord a) - n) in car by FUNCT_1:def 5; :: thesis: verum
end;
then reconsider g = a |^ ((ord a) - n) as Element of multMagma(# car,op #) ;
A40: n + ((ord a) - n) = ord a ;
A41: h * g = e
proof
h * g = (a |^ n) * (a |^ ((ord a) - n)) by A28, A35
.= a |^ (ord a) by A40, GROUP_1:63
.= e by GROUP_1:82 ;
hence h * g = e ; :: thesis: verum
end;
g * h = e
proof
g * h = (a |^ ((ord a) - n)) * (a |^ n) by A28, A35
.= a |^ (ord a) by A40, GROUP_1:63
.= e by GROUP_1:82 ;
hence g * h = e ; :: thesis: verum
end;
hence ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) by A41; :: thesis: verum
end;
end;
hence for h being Element of multMagma(# car,op #) holds
( h * e = h & e * h = h & ex g being Element of multMagma(# car,op #) st
( h * g = e & g * h = e ) ) ; :: thesis: verum
end;
hence multMagma(# car,op #) is Group by A30, GROUP_1:5; :: thesis: verum
end;
then reconsider H1 = multMagma(# car,op #) as Group ;
the carrier of (gr {a}) c= the carrier of G by GROUP_2:def 5;
then the carrier of H1 c= the carrier of G by A12, XBOOLE_1:1;
then H1 is Subgroup of G by GROUP_2:def 5;
hence ex H being strict Subgroup of G st the carrier of H = rng F ; :: thesis: verum
end;
then consider H being strict Subgroup of G such that
A42: the carrier of H = rng F ;
{a} c= the carrier of H by A6, A42, ZFMISC_1:37;
then gr {a} is Subgroup of H by GROUP_4:def 5;
hence the carrier of (gr {a}) c= rng F by A42, GROUP_2:def 5; :: thesis: verum
end;
hence rng F = the carrier of (gr {a}) by A12, XBOOLE_0:def 10; :: 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 dom F or not b1 in dom F or not F . x = F . b1 or x = b1 )

let y be set ; :: thesis: ( not x in dom F or not y in dom F or not F . x = F . y or x = y )
assume that
A43: x in dom F and
A44: y in dom F and
A45: F . x = F . y and
A46: x <> y ; :: thesis: contradiction
reconsider p = x as Element of NAT by A43;
reconsider s = y as Element of NAT by A44;
reconsider s' = s, p' = p, z = ord a as Real ;
A47: F . p = a |^ p by A2, A43;
A48: F . s = a |^ s by A2, A44;
per cases ( p <= s or s <= p ) ;
suppose p <= s ; :: thesis: contradiction
then reconsider r1 = s - p as Element of NAT by INT_1:18;
1_ G = (a |^ s) * ((a |^ p) " ) by A45, A47, A48, GROUP_1:def 6;
then a |^ 0 = (a |^ s) * ((a |^ p) " ) by GROUP_1:43;
then a |^ 0 = (a |^ s) * (a |^ (- p)) by GROUP_1:70;
then a |^ 0 = a |^ (s + (- p)) by GROUP_1:63;
then A49: 1_ G = a |^ r1 by GROUP_1:43;
A50: r1 <> 0 by A46;
A51: p > 0 by A3, A43, FINSEQ_1:3;
A52: r1 < ord a
proof
A53: s' <= z by A3, A44, FINSEQ_1:3;
z < z + p' by A51, XREAL_1:31;
then s' < z + p' by A53, XXREAL_0:2;
then s' - p' < (z + p') - p' by XREAL_1:11;
hence r1 < ord a ; :: thesis: verum
end;
not a is being_of_order_0 by Th26;
hence contradiction by A49, A50, A52, GROUP_1:def 12; :: thesis: verum
end;
suppose s <= p ; :: thesis: contradiction
then reconsider r2 = p - s as Element of NAT by INT_1:18;
1_ G = (a |^ p) * ((a |^ s) " ) by A45, A47, A48, GROUP_1:def 6;
then a |^ 0 = (a |^ p) * ((a |^ s) " ) by GROUP_1:43;
then a |^ 0 = (a |^ p) * (a |^ (- s)) by GROUP_1:70;
then a |^ 0 = a |^ (p + (- s)) by GROUP_1:63;
then A54: 1_ G = a |^ r2 by GROUP_1:43;
A55: r2 <> 0 by A46;
A56: s > 0 by A3, A44, FINSEQ_1:3;
A57: r2 < ord a
proof
A58: p' <= z by A3, A43, FINSEQ_1:3;
z < z + s' by A56, XREAL_1:31;
then p' < z + s' by A58, XXREAL_0:2;
then p' - s' < (z + s') - s' by XREAL_1:11;
hence r2 < ord a ; :: thesis: verum
end;
not a is being_of_order_0 by Th26;
hence contradiction by A54, A55, A57, GROUP_1:def 12; :: thesis: verum
end;
end;
end;
then A59: Seg (ord a),the carrier of (gr {a}) are_equipotent by A3, A8, WELLORD2:def 4;
set ca = the carrier of (gr {a});
reconsider So = Seg (ord a) as finite set ;
card So = card the carrier of (gr {a}) by A59, CARD_1:21;
hence ord a = card (gr {a}) by FINSEQ_1:78; :: thesis: verum