set N = { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) } ;
inversions R = { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) }
proof
thus
inversions R c= { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) }
XBOOLE_0:def 10 { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) } c= inversions R
let x be
object ;
TARSKI:def 3 ( not x in { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) } or x in inversions R )
assume
x in { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) }
;
x in inversions R
then consider a,
b being
Element of
dom R such that A2:
(
x = [a,b] &
a in b &
R /. a > R /. b )
;
not
R /. a <= R /. b
by A2, Th45;
hence
x in inversions R
by A2;
verum
end;
hence
for b1 being set holds
( b1 = inversions R iff b1 = { [a,b] where a, b is Element of dom R : ( a in b & R /. a > R /. b ) } )
; verum