let n be Nat; :: thesis: INT , RAT_with_denominator (n + 1) are_equipotent
defpred S1[ Element of INT , set ] means $2 = $1 / (n + 1);
A1: for x being Element of INT ex y being Element of RAT_with_denominator (n + 1) st S1[x,y]
proof
let x be Element of INT ; :: thesis: ex y being Element of RAT_with_denominator (n + 1) st S1[x,y]
reconsider x = x as Integer ;
reconsider i1 = n + 1 as Integer ;
set y = x / i1;
x / i1 in RAT by RAT_1:def 1;
then reconsider y = x / i1 as Rational ;
y in RAT_with_denominator (n + 1) by Def2;
hence ex y being Element of RAT_with_denominator (n + 1) st S1[x,y] ; :: thesis: verum
end;
consider f being Function of INT ,(RAT_with_denominator (n + 1)) such that
A4: for x being Element of INT holds S1[x,f . x] from FUNCT_2:sch 3(A1);
A5: f in Funcs INT ,(RAT_with_denominator (n + 1)) by FUNCT_2:11;
then A6: dom f = INT by FUNCT_2:169;
A7: for x1, x2 being set st x1 in dom f & x2 in dom f & f . x1 = f . x2 holds
x1 = x2
proof
let x1, x2 be set ; :: thesis: ( x1 in dom f & x2 in dom f & f . x1 = f . x2 implies x1 = x2 )
assume that
A8: x1 in dom f and
A9: x2 in dom f and
A10: f . x1 = f . x2 ; :: thesis: x1 = x2
reconsider x1 = x1 as Element of INT by A5, A8, FUNCT_2:169;
reconsider x2 = x2 as Element of INT by A5, A9, FUNCT_2:169;
( f . x1 = x1 / (n + 1) & f . x2 = x2 / (n + 1) ) by A4;
hence x1 = x2 by A10, XCMPLX_1:53; :: thesis: verum
end;
A12: for y being set st y in RAT_with_denominator (n + 1) holds
f " {y} <> {}
proof
let y be set ; :: thesis: ( y in RAT_with_denominator (n + 1) implies f " {y} <> {} )
assume A13: y in RAT_with_denominator (n + 1) ; :: thesis: f " {y} <> {}
then reconsider y = y as Rational ;
consider i being Integer such that
A14: y = i / (n + 1) by A13, Def2;
reconsider i = i as Element of INT by INT_1:def 2;
f . i = i / (n + 1) by A4;
then f . i in {y} by A14, TARSKI:def 1;
hence f " {y} <> {} by A6, FUNCT_1:def 13; :: thesis: verum
end;
A17: f is one-to-one by A7, FUNCT_1:def 8;
rng f = RAT_with_denominator (n + 1) by A12, FUNCT_2:49;
hence INT , RAT_with_denominator (n + 1) are_equipotent by A6, A17, WELLORD2:def 4; :: thesis: verum