let D, C be non empty finite set ; :: thesis: for F being PartFunc of D,REAL
for A being RearrangmentGen of C st F is total & card C = card D holds
dom (Rland F,A) = C
let F be PartFunc of D,REAL ; :: thesis: for A being RearrangmentGen of C st F is total & card C = card D holds
dom (Rland F,A) = C
let A be RearrangmentGen of C; :: thesis: ( F is total & card C = card D implies dom (Rland F,A) = C )
assume A1: ( F is total & card C = card D ) ; :: thesis: dom (Rland F,A) = C
thus dom (Rland F,A) c= C ; :: according to XBOOLE_0:def 10 :: thesis: C c= dom (Rland F,A)
A2: ( len (MIM (FinS F,D)) = len (CHI A,C) & len (CHI A,C) = len A & len A <> 0 & len ((MIM (FinS F,D)) (#) (CHI A,C)) = min (len (MIM (FinS F,D))),(len (CHI A,C)) ) by A1, Th4, Th12, RFUNCT_3:def 6, RFUNCT_3:def 7;
let x be set ; :: according to TARSKI:def 3 :: thesis: ( not x in C or x in dom (Rland F,A) )
assume x in C ; :: thesis: x in dom (Rland F,A)
then reconsider c = x as Element of C ;
c is_common_for_dom (MIM (FinS F,D)) (#) (CHI A,C) by RFUNCT_3:35;
hence x in dom (Rland F,A) by A2, RFUNCT_3:31; :: thesis: verum