let n be Nat; 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]
consider f being Function of INT,(RAT_with_denominator (n + 1)) such that
A2:
for x being Element of INT holds S1[x,f . x]
from FUNCT_2:sch 3(A1);
A3:
f in Funcs (INT,(RAT_with_denominator (n + 1)))
by FUNCT_2:8;
then A4:
dom f = INT
by FUNCT_2:92;
A5:
for x1, x2 being object st x1 in dom f & x2 in dom f & f . x1 = f . x2 holds
x1 = x2
A9:
for y being object st y in RAT_with_denominator (n + 1) holds
f " {y} <> {}
A12:
f is one-to-one
by A5, FUNCT_1:def 4;
rng f = RAT_with_denominator (n + 1)
by A9, FUNCT_2:41;
hence
INT , RAT_with_denominator (n + 1) are_equipotent
by A4, A12, WELLORD2:def 4; verum