let n be Element of NAT ; :: thesis: for P being connected Subset of (TOP-REAL n)
for Q being Subset of (TOP-REAL n) holds
( not P misses Q or P c= UBD Q or P c= BDD Q )

let P be connected Subset of (TOP-REAL n); :: thesis: for Q being Subset of (TOP-REAL n) holds
( not P misses Q or P c= UBD Q or P c= BDD Q )

let Q be Subset of (TOP-REAL n); :: thesis: ( not P misses Q or P c= UBD Q or P c= BDD Q )
assume A1: P misses Q ; :: thesis: ( P c= UBD Q or P c= BDD Q )
per cases ( P is empty or Q = [#] (TOP-REAL n) or ( not P is empty & Q <> [#] (TOP-REAL n) ) ) ;
end;