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
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
A12:
for y being set st y in RAT_with_denominator (n + 1) holds
f " {y} <> {}
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; verum