let X be set ; for f being X -defined Function
for perm being Permutation of X holds card (support (f * perm)) = card (support f)
let f be X -defined Function; for perm being Permutation of X holds card (support (f * perm)) = card (support f)
let perm be Permutation of X; card (support (f * perm)) = card (support f)
set P = perm " ;
A1:
( dom perm = X & X = rng perm & dom (perm ") = X & X = rng (perm ") )
by FUNCT_2:52, FUNCT_2:def 3;
( support f c= dom f & dom f c= X & X = dom (perm ") )
by FUNCT_2:52, PRE_POLY:37;
then A2:
support f c= dom (perm ")
;
A3:
(perm ") .: (support f) c= support (f * perm)
proof
let y be
object ;
TARSKI:def 3 ( not y in (perm ") .: (support f) or y in support (f * perm) )
assume
y in (perm ") .: (support f)
;
y in support (f * perm)
then consider x being
object such that A4:
(
x in dom (perm ") &
x in support f &
(perm ") . x = y )
by FUNCT_1:def 6;
A5:
x = perm . y
by A1, A4, FUNCT_1:32;
A6:
f . x <> 0
by A4, PRE_POLY:def 7;
then
(
x in dom f &
y in dom perm )
by A4, A1, FUNCT_1:def 2, FUNCT_1:def 3;
then
(
perm . y in dom f &
f . (perm . y) = (f * perm) . y )
by A1, A4, FUNCT_1:32, FUNCT_1:13;
hence
y in support (f * perm)
by A6, A5, PRE_POLY:def 7;
verum
end;
support (f * perm) c= (perm ") .: (support f)
then
support (f * perm) = (perm ") .: (support f)
by A3, XBOOLE_0:def 10;
hence
card (support (f * perm)) = card (support f)
by CARD_1:5, A2, CARD_1:33; verum