defpred S1[ non zero Nat] means CarProduct ((Seg $1) --> RAT) is countable ;
A1: S1[1]
proof end;
A3: for n being non zero Nat st S1[n] holds
S1[n + 1]
proof
let n be non zero Nat; :: thesis: ( S1[n] implies S1[n + 1] )
assume A4: S1[n] ; :: thesis: S1[n + 1]
set D = (Seg (n + 1)) --> RAT;
A5: n <= n + 1 by NAT_1:13;
then A6: ( SubFin (((Seg (n + 1)) --> RAT),n) = ((Seg (n + 1)) --> RAT) | n & ElmFin (((Seg (n + 1)) --> RAT),(n + 1)) = ((Seg (n + 1)) --> RAT) . (n + 1) ) by MEASUR13:def 1, MEASUR13:def 5;
CarProduct ((Seg (n + 1)) --> RAT) = [:(CarProduct (SubFin (((Seg (n + 1)) --> RAT),n))),(ElmFin (((Seg (n + 1)) --> RAT),(n + 1))):] by MEASUR13:6;
then A7: CarProduct ((Seg (n + 1)) --> RAT) = [:(CarProduct (SubFin (((Seg (n + 1)) --> RAT),n))),RAT:] by A6, FUNCOP_1:7, FINSEQ_1:3;
((Seg (n + 1)) --> RAT) | n = ((Seg (n + 1)) /\ (Seg n)) --> RAT by FUNCOP_1:12;
then ((Seg (n + 1)) --> RAT) | n = (Seg n) --> RAT by A5, FINSEQ_1:5, XBOOLE_1:28;
hence CarProduct ((Seg (n + 1)) --> RAT) is countable by A6, A4, A7, CARD_4:7; :: thesis: verum
end;
for n being non zero Nat holds S1[n] from NAT_1:sch 10(A1, A3);
hence for n being non zero Nat holds CarProduct ((Seg n) --> RAT) is countable ; :: thesis: verum