deffunc H1( Relation) -> set = R * R;
set A = permutations (dom R);
A1: permutations (dom R) is finite ;
set X = { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } ;
A2: { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } is finite from FRAENKEL:sch 21(A1);
Permutations R = { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) }
proof
thus Permutations R c= { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } :: according to XBOOLE_0:def 10 :: thesis: { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } c= Permutations R
proof
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in Permutations R or a in { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } )
assume a in Permutations R ; :: thesis: a in { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) }
then consider p being Permutation of (dom R) such that
A3: a = p * R ;
p in permutations (dom R) ;
hence a in { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } by A3; :: thesis: verum
end;
let a be object ; :: according to TARSKI:def 3 :: thesis: ( not a in { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } or a in Permutations R )
assume a in { H1(w) where w is Element of permutations (dom R) : w in permutations (dom R) } ; :: thesis: a in Permutations R
then consider w being Element of permutations (dom R) such that
A4: a = H1(w) and
A5: w in permutations (dom R) ;
ex p being Permutation of (dom R) st w = p by A5;
hence a in Permutations R by A4; :: thesis: verum
end;
hence Permutations R is finite by A2; :: thesis: verum