theorem Th27:
  square-uparrow n = [:NAT \ Segm n, NAT \ Segm n:]
  proof
    reconsider no = n as Element of OrderedNAT by ORDINAL1:def 12;
    uparrow no = NAT \Segm n by Th13;
    hence thesis by Th26;
  end;
