let n be non zero Nat; :: thesis: for X being non empty set holds (Seg n) --> X is non-empty n -element FinSequence
let X be non empty set ; :: thesis: (Seg n) --> X is non-empty n -element FinSequence
set Xn = (Seg n) --> X;
A1: ( dom ((Seg n) --> X) = Seg n & rng ((Seg n) --> X) = {X} ) by FUNCOP_1:8;
reconsider Xn = (Seg n) --> X as FinSequence ;
n is Element of NAT by ORDINAL1:def 12;
then len Xn = n by A1, FINSEQ_1:def 3;
hence (Seg n) --> X is non-empty n -element FinSequence by CARD_1:def 7; :: thesis: verum