let n be Nat; :: thesis: for s1, s2 being FinSequence st len s1 = n & len s2 = n holds
<*s1,s2*> is tabular
let s1, s2 be FinSequence; :: thesis: ( len s1 = n & len s2 = n implies <*s1,s2*> is tabular )
assume A1: ( len s1 = n & len s2 = n ) ; :: thesis: <*s1,s2*> is tabular

now

take n = n; :: thesis: for x being set st x in rng <*s1,s2*> holds
ex r being FinSequence st
( x = r & len r = n )
let x be set ; :: thesis: ( x in rng <*s1,s2*> implies ex r being FinSequence st
( x = r & len r = n ) )
assume x in rng <*s1,s2*> ; :: thesis: ex r being FinSequence st
( x = r & len r = n )
then A2: x in {s1,s2} by FINSEQ_2:127;
then reconsider r = x as FinSequence by TARSKI:def 2;
take r = r; :: thesis: ( x = r & len r = n )
thus ( x = r & len r = n ) by A1, A2, TARSKI:def 2; :: thesis: verum

end;

hence <*s1,s2*> is tabular by Def1; :: thesis: verum