let a, b be Real; ( b - a <= 1 implies IntIntervals (a,b) is mutually-disjoint )
assume A1:
b - a <= 1
; IntIntervals (a,b) is mutually-disjoint
let x, y be set ; TAXONOM2:def 5 ( not x in IntIntervals (a,b) or not y in IntIntervals (a,b) or x = y or x misses y )
assume
x in IntIntervals (a,b)
; ( not y in IntIntervals (a,b) or x = y or x misses y )
then consider nx being Element of INT such that
A4:
x = ].(a + nx),(b + nx).[
;
assume
y in IntIntervals (a,b)
; ( x = y or x misses y )
then consider ny being Element of INT such that
A5:
y = ].(a + ny),(b + ny).[
;
assume A6:
x <> y
; x misses y
assume
x meets y
; contradiction
then consider z being object such that
A7:
z in x
and
A8:
z in y
by XBOOLE_0:3;
reconsider z = z as Real by A4, A7;
A9:
a + nx < z
by A4, A7, XXREAL_1:4;
A10:
z < b + ny
by A5, A8, XXREAL_1:4;
A11:
a + ny < z
by A5, A8, XXREAL_1:4;
A12:
z < b + nx
by A4, A7, XXREAL_1:4;