let I be Interval; :: thesis: ( ].(inf I),(sup I).[ is open Subset of REAL & ].(inf I),(sup I).[ c= I )
now :: thesis: ].(inf I),(sup I).[ is open Subset of REAL
per cases ( ( inf I in REAL & sup I in REAL ) or not inf I in REAL or not sup I in REAL ) ;
suppose ( inf I in REAL & sup I in REAL ) ; :: thesis: ].(inf I),(sup I).[ is open Subset of REAL
then reconsider a = inf I, b = sup I as Real ;
].(inf I),(sup I).[ = ].a,b.[ ;
hence ].(inf I),(sup I).[ is open Subset of REAL ; :: thesis: verum
end;
suppose A1: not inf I in REAL ; :: thesis: ].(inf I),(sup I).[ is open Subset of REAL
end;
suppose not sup I in REAL ; :: thesis: ].(inf I),(sup I).[ is open Subset of REAL
end;
end;
end;
hence ].(inf I),(sup I).[ is open Subset of REAL ; :: thesis: ].(inf I),(sup I).[ c= I
now :: thesis: for a being set st a in ].(inf I),(sup I).[ holds
a in I
let a be set ; :: thesis: ( a in ].(inf I),(sup I).[ implies a in I )
assume A9: a in ].(inf I),(sup I).[ ; :: thesis: a in I
then reconsider a1 = a as Real ;
( inf I < a1 & a1 < sup I ) by A9, XXREAL_1:4;
hence a in I by XXREAL_2:83; :: thesis: verum
end;
hence ].(inf I),(sup I).[ c= I ; :: thesis: verum