let n be non zero Nat; :: thesis: for D being non-empty n -element FinSequence st ( for i being Nat st i in Seg n holds
D . i c= REAL ) holds
CarProduct D c= CarProduct ((Seg n) --> REAL)

let D be non-empty n -element FinSequence; :: thesis: ( ( for i being Nat st i in Seg n holds
D . i c= REAL ) implies CarProduct D c= CarProduct ((Seg n) --> REAL) )

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