let G be finite Group; for a being Element of G holds card G = (card (con_class a)) * (card (Centralizer a))
let a be Element of G; card G = (card (con_class a)) * (card (Centralizer a))
reconsider X = { ((a -con_map) " {x}) where x is Element of con_class a : verum } as a_partition of the carrier of G by Th11;
A1:
for A being set st A in X holds
( A is finite & card A = card (Centralizer a) & ( for B being set st B in X & A <> B holds
A misses B ) )
reconsider k = card (Centralizer a) as Element of NAT ;
for Y being set st Y in X holds
ex B being finite set st
( B = Y & card B = k & ( for Z being set st Z in X & Y <> Z holds
( Y,Z are_equipotent & Y misses Z ) ) )
proof
let Y be
set ;
( Y in X implies ex B being finite set st
( B = Y & card B = k & ( for Z being set st Z in X & Y <> Z holds
( Y,Z are_equipotent & Y misses Z ) ) ) )
assume A3:
Y in X
;
ex B being finite set st
( B = Y & card B = k & ( for Z being set st Z in X & Y <> Z holds
( Y,Z are_equipotent & Y misses Z ) ) )
reconsider Y =
Y as
finite set by A3;
A4:
card Y = card (Centralizer a)
by A1, A3;
for
Z being
set st
Z in X &
Y <> Z holds
(
Y,
Z are_equipotent &
Y misses Z )
proof
let Z be
set ;
( Z in X & Y <> Z implies ( Y,Z are_equipotent & Y misses Z ) )
assume that A5:
Z in X
and A6:
Y <> Z
;
( Y,Z are_equipotent & Y misses Z )
A7:
card Y = card (Centralizer a)
by A1, A3;
card Z = card (Centralizer a)
by A1, A5;
hence
(
Y,
Z are_equipotent &
Y misses Z )
by A1, A3, A5, A6, A7, CARD_1:5;
verum
end;
hence
ex
B being
finite set st
(
B = Y &
card B = k & ( for
Z being
set st
Z in X &
Y <> Z holds
(
Y,
Z are_equipotent &
Y misses Z ) ) )
by A4;
verum
end;
then consider C being finite set such that
A8:
C = union X
and
A9:
card C = (card X) * k
by GROUP_2:156;
card G =
card C
by A8, EQREL_1:def 4
.=
(card (con_class a)) * (card (Centralizer a))
by A9, Th12
;
hence
card G = (card (con_class a)) * (card (Centralizer a))
; verum