let R be with_finite_stability# RelStr ; for A being StableSet of R
for C being Clique-partition of R st card C = card A holds
ex f being Function of A,C st
( f is bijective & ( for x being set st x in A holds
x in f . x ) )
let A be StableSet of R; for C being Clique-partition of R st card C = card A holds
ex f being Function of A,C st
( f is bijective & ( for x being set st x in A holds
x in f . x ) )
let C be Clique-partition of R; ( card C = card A implies ex f being Function of A,C st
( f is bijective & ( for x being set st x in A holds
x in f . x ) ) )
assume A:
card C = card A
; ex f being Function of A,C st
( f is bijective & ( for x being set st x in A holds
x in f . x ) )
set cR = the carrier of R;
per cases
( R is empty or not R is empty )
;
suppose S1:
not
R is
empty
;
ex f being Function of A,C st
( f is bijective & ( for x being set st x in A holds
x in f . x ) )defpred S1[
set ,
set ]
means ( $1
in A & $2
in C & $1
in $2 );
P:
for
x being
set st
x in A holds
ex
y being
set st
(
y in C &
S1[
x,
y] )
consider f being
Function of
A,
C such that Q:
for
x being
set st
x in A holds
S1[
x,
f . x]
from FUNCT_2:sch 1(P);
take
f
;
( f is bijective & ( for x being set st x in A holds
x in f . x ) )R:
f is
one-to-one
proof
let x1,
x2 be
set ;
FUNCT_1:def 8 ( not x1 in proj1 f or not x2 in proj1 f or not f . x1 = f . x2 or x1 = x2 )
assume that A1:
x1 in dom f
and B1:
x2 in dom f
and C1:
f . x1 = f . x2
;
x1 = x2
F1:
x1 in f . x1
by A1, Q;
G1:
x2 in f . x2
by B1, Q;
f . x1 in C
by S1, A1, FUNCT_2:7;
then
f . x1 is
Clique of
R
by LCpart;
hence
x1 = x2
by A1, B1, F1, G1, C1, ACClique;
verum
end;
C is
finite
by A;
then
rng f = C
by A, R, FINSEQ_4:78;
then
f is
onto
by FUNCT_2:def 3;
hence
f is
bijective
by R;
for x being set st x in A holds
x in f . xlet x be
set ;
( x in A implies x in f . x )assume
x in A
;
x in f . xhence
x in f . x
by Q;
verum end; end;