let n be non zero Nat; :: thesis: for x being object holds
( x in CarProduct ((Seg n) --> RAT) iff ex px being n -element FinSequence of RAT st x = PtCarProduct px )

let x be object ; :: thesis: ( x in CarProduct ((Seg n) --> RAT) iff ex px being n -element FinSequence of RAT st x = PtCarProduct px )
hereby :: thesis: ( ex px being n -element FinSequence of RAT st x = PtCarProduct px implies x in CarProduct ((Seg n) --> RAT) )
assume A1: x in CarProduct ((Seg n) --> RAT) ; :: thesis: ex px being n -element FinSequence of RAT st x = PtCarProduct px
consider px being n -element FinSequence such that
A2: ( px in product ((Seg n) --> RAT) & x = PtCarProduct px ) by A1, Th6;
now :: thesis: for y being object st y in rng px holds
y in RAT
let y be object ; :: thesis: ( y in rng px implies y in RAT )
assume y in rng px ; :: thesis: y in RAT
then consider i being object such that
A3: ( i in dom px & y = px . i ) by FUNCT_1:def 3;
dom px = Seg (len px) by FINSEQ_1:def 3;
then A4: dom px = Seg n by CARD_1:def 7;
ex g being Function st
( px = g & dom g = dom ((Seg n) --> RAT) & ( for i being object st i in dom ((Seg n) --> RAT) holds
g . i in ((Seg n) --> RAT) . i ) ) by A2, CARD_3:def 5;
then px . i in ((Seg n) --> RAT) . i by A3;
hence y in RAT by A3, A4, FUNCOP_1:7; :: thesis: verum
end;
then rng px c= RAT ;
then reconsider px = px as n -element FinSequence of RAT by FINSEQ_1:def 4;
x = PtCarProduct px by A2;
hence ex px being n -element FinSequence of RAT st x = PtCarProduct px ; :: thesis: verum
end;
assume ex px being n -element FinSequence of RAT st x = PtCarProduct px ; :: thesis: x in CarProduct ((Seg n) --> RAT)
then consider px being n -element FinSequence of RAT such that
A5: x = PtCarProduct px ;
px in product ((Seg n) --> RAT) by Th44;
hence x in CarProduct ((Seg n) --> RAT) by A5, Th6; :: thesis: verum