let n be non zero Nat; :: thesis: for px being n -element FinSequence of RAT holds px in product ((Seg n) --> RAT)
let px be n -element FinSequence of RAT ; :: thesis: px in product ((Seg n) --> RAT)
set f = (Seg n) --> RAT;
dom px = Seg (len px) by FINSEQ_1:def 3;
then A1: dom px = Seg n by CARD_1:def 7;
for y being object st y in dom ((Seg n) --> RAT) holds
px . y in ((Seg n) --> RAT) . y
proof
let y be object ; :: thesis: ( y in dom ((Seg n) --> RAT) implies px . y in ((Seg n) --> RAT) . y )
assume A2: y in dom ((Seg n) --> RAT) ; :: thesis: px . y in ((Seg n) --> RAT) . y
then A3: ((Seg n) --> RAT) . y = RAT by FUNCOP_1:7;
rng px c= RAT by FINSEQ_1:def 4;
hence px . y in ((Seg n) --> RAT) . y by A3, A1, A2, FUNCT_1:3; :: thesis: verum
end;
hence px in product ((Seg n) --> RAT) by A1, CARD_3:def 5; :: thesis: verum