let X be set ; for R being Relation st R c= [:X,X:] holds
( R \ (id (dom R)) = R \ (id X) & R \ (id (rng R)) = R \ (id X) )
let R be Relation; ( R c= [:X,X:] implies ( R \ (id (dom R)) = R \ (id X) & R \ (id (rng R)) = R \ (id X) ) )
A1:
R \ (id (dom R)) c= R \ (id X)
proof
let x be
set ;
RELAT_1:def 3 for b1 being set holds
( not [x,b1] in R \ (id (dom R)) or [x,b1] in R \ (id X) )let y be
set ;
( not [x,y] in R \ (id (dom R)) or [x,y] in R \ (id X) )
assume A2:
[x,y] in R \ (id (dom R))
;
[x,y] in R \ (id X)
then A3:
not
[x,y] in id (dom R)
by XBOOLE_0:def 5;
not
[x,y] in id X
hence
[x,y] in R \ (id X)
by A2, XBOOLE_0:def 5;
verum
end;
A5:
R \ (id (rng R)) c= R \ (id X)
proof
let x be
set ;
RELAT_1:def 3 for b1 being set holds
( not [x,b1] in R \ (id (rng R)) or [x,b1] in R \ (id X) )let y be
set ;
( not [x,y] in R \ (id (rng R)) or [x,y] in R \ (id X) )
assume A6:
[x,y] in R \ (id (rng R))
;
[x,y] in R \ (id X)
then A7:
not
[x,y] in id (rng R)
by XBOOLE_0:def 5;
not
[x,y] in id X
hence
[x,y] in R \ (id X)
by A6, XBOOLE_0:def 5;
verum
end;
assume A9:
R c= [:X,X:]
; ( R \ (id (dom R)) = R \ (id X) & R \ (id (rng R)) = R \ (id X) )
then
id (dom R) c= id X
by Th15, Th33;
then
R \ (id X) c= R \ (id (dom R))
by XBOOLE_1:34;
hence
R \ (id (dom R)) = R \ (id X)
by A1, XBOOLE_0:def 10; R \ (id (rng R)) = R \ (id X)
id (rng R) c= id X
by A9, Th15, Th33;
then
R \ (id X) c= R \ (id (rng R))
by XBOOLE_1:34;
hence
R \ (id (rng R)) = R \ (id X)
by A5, XBOOLE_0:def 10; verum