let Q be multLoop; for N being SubLoop of Q
for f being Function of Q,Q st f in Mlt (@ ([#] N)) holds
for x being Element of Q holds
( x in @ ([#] N) iff f . x in @ ([#] N) )
let N be SubLoop of Q; for f being Function of Q,Q st f in Mlt (@ ([#] N)) holds
for x being Element of Q holds
( x in @ ([#] N) iff f . x in @ ([#] N) )
reconsider H = @ ([#] N) as Subset of Q ;
defpred S3[ Function of Q,Q] means for x being Element of Q holds
( x in H iff $1 . x in H );
A1:
for u being Element of Q st u in H holds
for f being Function of Q,Q st ( for x being Element of Q holds f . x = x * u ) holds
S3[f]
proof
let u be
Element of
Q;
( u in H implies for f being Function of Q,Q st ( for x being Element of Q holds f . x = x * u ) holds
S3[f] )
assume A2:
u in H
;
for f being Function of Q,Q st ( for x being Element of Q holds f . x = x * u ) holds
S3[f]
let f be
Function of
Q,
Q;
( ( for x being Element of Q holds f . x = x * u ) implies S3[f] )
assume A3:
for
x being
Element of
Q holds
f . x = x * u
;
S3[f]
S3[
f]
hence
S3[
f]
;
verum
end;
A5:
for u being Element of Q st u in H holds
for f being Function of Q,Q st ( for x being Element of Q holds f . x = u * x ) holds
S3[f]
proof
let u be
Element of
Q;
( u in H implies for f being Function of Q,Q st ( for x being Element of Q holds f . x = u * x ) holds
S3[f] )
assume A6:
u in H
;
for f being Function of Q,Q st ( for x being Element of Q holds f . x = u * x ) holds
S3[f]
let f be
Function of
Q,
Q;
( ( for x being Element of Q holds f . x = u * x ) implies S3[f] )
assume A7:
for
x being
Element of
Q holds
f . x = u * x
;
S3[f]
S3[
f]
hence
S3[
f]
;
verum
end;
A8:
for g, h being Permutation of Q st S3[g] & S3[h] holds
S3[g * h]
A10:
for g being Permutation of Q st S3[g] holds
S3[g " ]
for f being Function of Q,Q st f in Mlt H holds
S3[f]
from AIMLOOP:sch 1(A1, A5, A8, A10);
hence
for f being Function of Q,Q st f in Mlt (@ ([#] N)) holds
for x being Element of Q holds
( x in @ ([#] N) iff f . x in @ ([#] N) )
; verum