theorem Th49:
  S = C1 \/ C2 implies N-bound S = max(N-bound C1, N-bound C2)
proof
  assume
A1: S = C1 \/ C2;
A2: N-bound C1 = upper_bound(proj2.:C1) by Th45;
A3: N-bound C2 = upper_bound(proj2.:C2) by Th45;
  thus N-bound S = upper_bound(proj2.:S) by Th45
    .= upper_bound(proj2.:C1 \/ proj2.:C2) by A1,RELAT_1:120
    .= max(N-bound C1, N-bound C2) by A2,A3,SEQ_4:143;
end;
