set X = {0 ,1} * ;
A5:
now let p be
FinSequence of
NAT ;
for k, n being Element of NAT st p ^ <*k*> in {0 ,1} * & n <= k holds
p ^ <*n*> in {0 ,1} * let k,
n be
Element of
NAT ;
( p ^ <*k*> in {0 ,1} * & n <= k implies p ^ <*n*> in {0 ,1} * )assume that A6:
p ^ <*k*> in {0 ,1} *
and A7:
n <= k
;
p ^ <*n*> in {0 ,1} * A8:
p ^ <*k*> is
FinSequence of
{0 ,1}
by A6, FINSEQ_1:def 11;
then reconsider kk =
<*k*> as
FinSequence of
{0 ,1} by FINSEQ_1:50;
1
in Seg 1
by FINSEQ_1:5;
then
1
in dom <*k*>
by FINSEQ_1:55;
then
kk . 1
in {0 ,1}
by FINSEQ_2:13;
then A9:
k in {0 ,1}
by FINSEQ_1:57;
then
n in {0 ,1}
by TARSKI:def 2;
then A11:
<*n*> is
FinSequence of
{0 ,1}
by Lm2;
p is
FinSequence of
{0 ,1}
by A8, FINSEQ_1:50;
then
p ^ <*n*> is
FinSequence of
{0 ,1}
by A11, Lm1;
hence
p ^ <*n*> in {0 ,1} *
by FINSEQ_1:def 11;
verum end;
{0 ,1} * c= NAT *
by FINSEQ_1:83;
hence
{0 ,1} * is Tree
by A1, A5, TREES_1:def 5; verum