let X be set ; for fs, fs1, fs2 being FinSequence of X
for fss, fss2 being Subset of fs
for fss1 being Subset of fs1 st Seq fss = fs1 & Seq fss1 = fs2 & fss2 = fss | (rng ((Sgm (dom fss)) | (dom fss1))) holds
Seq fss2 = fs2
let fs, fs1, fs2 be FinSequence of X; for fss, fss2 being Subset of fs
for fss1 being Subset of fs1 st Seq fss = fs1 & Seq fss1 = fs2 & fss2 = fss | (rng ((Sgm (dom fss)) | (dom fss1))) holds
Seq fss2 = fs2
let fss, fss2 be Subset of fs; for fss1 being Subset of fs1 st Seq fss = fs1 & Seq fss1 = fs2 & fss2 = fss | (rng ((Sgm (dom fss)) | (dom fss1))) holds
Seq fss2 = fs2
let fss1 be Subset of fs1; ( Seq fss = fs1 & Seq fss1 = fs2 & fss2 = fss | (rng ((Sgm (dom fss)) | (dom fss1))) implies Seq fss2 = fs2 )
assume that
A1:
Seq fss = fs1
and
A2:
Seq fss1 = fs2
and
A3:
fss2 = fss | (rng ((Sgm (dom fss)) | (dom fss1)))
; Seq fss2 = fs2
consider k being Nat such that
A4:
dom fs = Seg k
by FINSEQ_1:def 2;
reconsider d2 = dom fss2 as finite set ;
reconsider d1 = dom fss1 as finite set ;
A6:
dom (Sgm d1) = Seg (card d1)
by FINSEQ_3:40;
reconsider k = k as Element of NAT by ORDINAL1:def 12;
A7:
dom fss c= Seg k
by A4, RELAT_1:11;
rng (Sgm (dom fss)) c= dom fss
by FINSEQ_1:def 14;
then A8:
dom fs1 = dom (Sgm (dom fss))
by A1, RELAT_1:27;
A9:
rng (Sgm (dom fss2)) = dom fss2
by FINSEQ_1:def 14;
A10:
(Sgm (dom fss)) | (dom fss1) c= Sgm (dom fss)
by RELAT_1:59;
then A11:
dom ((Sgm (dom fss)) | (dom fss1)) c= dom (Sgm (dom fss))
by RELAT_1:11;
rng ((Sgm (dom fss)) | (dom fss1)) c= rng (Sgm (dom fss))
by A10, RELAT_1:11;
then
rng ((Sgm (dom fss)) | (dom fss1)) c= dom fss
by FINSEQ_1:def 14;
then A12:
dom fss2 = rng ((Sgm (dom fss)) | (dom fss1))
by A3, RELAT_1:62;
A13:
dom fss1 c= dom fs1
by RELAT_1:11;
now ex Z being Element of bool [:omega,omega:] st
( ( for x being object st x in d1 holds
ex y being object st
( y in d2 & [x,y] in Z ) ) & ( for y being object st y in d2 holds
ex x being object st
( x in d1 & [x,y] in Z ) ) & ( for x, y, z, u being object st [x,y] in Z & [z,u] in Z holds
( ( x = z implies y = u ) & ( y = u implies not x <> z ) ) ) )take Z =
(Sgm (dom fss)) | (dom fss1);
( ( for x being object st x in d1 holds
ex y being object st
( y in d2 & [x,y] in Z ) ) & ( for y being object st y in d2 holds
ex x being object st
( x in d1 & [x,y] in Z ) ) & ( for x, y, z, u being object st [x,y] in Z & [z,u] in Z holds
( ( x = z implies y = u ) & ( y = u implies not x <> z ) ) ) )A14:
dom Z = dom fss1
by A8, RELAT_1:11, RELAT_1:62;
hereby ( ( for y being object st y in d2 holds
ex x being object st
( x in d1 & [x,y] in Z ) ) & ( for x, y, z, u being object st [x,y] in Z & [z,u] in Z holds
( ( x = z implies y = u ) & ( y = u implies not x <> z ) ) ) )
let x be
object ;
( x in d1 implies ex y being object st
( y in d2 & [x,y] in Z ) )assume A15:
x in d1
;
ex y being object st
( y in d2 & [x,y] in Z )reconsider y =
Z . x as
object ;
take y =
y;
( y in d2 & [x,y] in Z )thus
y in d2
by A12, A14, A15, FUNCT_1:def 3;
[x,y] in Zthus
[x,y] in Z
by A14, A15, FUNCT_1:1;
verum
end; hereby for x, y, z, u being object st [x,y] in Z & [z,u] in Z holds
( ( x = z implies y = u ) & ( y = u implies not x <> z ) )
let y be
object ;
( y in d2 implies ex x being object st
( x in d1 & [x,y] in Z ) )assume
y in d2
;
ex x being object st
( x in d1 & [x,y] in Z )then consider x being
object such that A16:
x in dom Z
and A17:
y = Z . x
by A12, FUNCT_1:def 3;
reconsider x =
x as
object ;
take x =
x;
( x in d1 & [x,y] in Z )thus
(
x in d1 &
[x,y] in Z )
by A13, A8, A16, A17, FUNCT_1:1, RELAT_1:62;
verum
end; let x,
y,
z,
u be
object ;
( [x,y] in Z & [z,u] in Z implies ( ( x = z implies y = u ) & ( y = u implies not x <> z ) ) )assume that A18:
[x,y] in Z
and A19:
[z,u] in Z
;
( ( x = z implies y = u ) & ( y = u implies not x <> z ) )A20:
z in dom Z
by A19, FUNCT_1:1;
A21:
u = Z . z
by A19, FUNCT_1:1;
A22:
u = (Sgm (dom fss)) . z
by A20, A21, FUNCT_1:47;
A23:
y = Z . x
by A18, FUNCT_1:1;
hence
(
x = z implies
y = u )
by A19, FUNCT_1:1;
( y = u implies not x <> z )A24:
x in dom Z
by A18, FUNCT_1:1;
then A25:
y = (Sgm (dom fss)) . x
by A23, FUNCT_1:47;
assume A26:
y = u
;
not x <> zassume A27:
x <> z
;
contradictionreconsider x =
x,
z =
z as
Element of
NAT by A24, A20;
A28:
x <= len (Sgm (dom fss))
by A11, A24, FINSEQ_3:25;
A29:
z <= len (Sgm (dom fss))
by A11, A20, FINSEQ_3:25;
A30:
1
<= z
by A11, A20, FINSEQ_3:25;
A31:
1
<= x
by A11, A24, FINSEQ_3:25;
end;
then
d1,d2 are_equipotent
;
then
card d1 = card d2
by CARD_1:5;
then A32:
dom (Sgm d2) = Seg (card d1)
by FINSEQ_3:40;
A33:
rng (Sgm (dom fss1)) = dom fss1
by FINSEQ_1:def 14;
now ( dom fs2 = dom (Seq fss2) & dom fs2 = dom fs2 & ( for k being Nat st k in dom fs2 holds
(Seq fss2) . k = fs2 . k ) )hence A36:
dom fs2 = dom (Seq fss2)
by TARSKI:2;
( dom fs2 = dom fs2 & ( for k being Nat st k in dom fs2 holds
(Seq fss2) . k = fs2 . k ) )thus
dom fs2 = dom fs2
;
for k being Nat st k in dom fs2 holds
(Seq fss2) . k = fs2 . klet k be
Nat;
( k in dom fs2 implies (Seq fss2) . k = fs2 . k )assume A37:
k in dom fs2
;
(Seq fss2) . k = fs2 . kthen A38:
(Sgm (dom fss1)) . k in dom fss1
by A2, FUNCT_1:11;
A39:
(Sgm (dom fss2)) . k in dom fss2
by A36, A37, FUNCT_1:11;
A40:
(Sgm (dom fss1)) . k in dom fss1
by A2, A37, FUNCT_1:11;
then A41:
fss1 . ((Sgm (dom fss1)) . k) = (Seq fss) . ((Sgm (dom fss1)) . k)
by A1, GRFUNC_1:2;
A42:
(Sgm (dom fss2)) . k = ((Sgm (dom fss)) * (Sgm (dom fss1))) . k
by A7, A12, A8, Th3, RELAT_1:11;
k in dom (Sgm (dom fss1))
by A2, A37, FUNCT_1:11;
then
k in dom ((Sgm (dom fss)) * (Sgm (dom fss1)))
by A13, A8, A38, FUNCT_1:11;
then A43:
(Sgm (dom fss2)) . k = (Sgm (dom fss)) . ((Sgm (dom fss1)) . k)
by A42, FUNCT_1:12;
A44:
fss2 c= fss
by A3, RELAT_1:59;
dom fss1 c= dom (Seq fss)
by A1, RELAT_1:11;
then A45:
(Sgm (dom fss1)) . k in dom (Sgm (dom fss))
by A40, FUNCT_1:11;
thus (Seq fss2) . k =
fss2 . ((Sgm (dom fss2)) . k)
by A36, A37, FUNCT_1:12
.=
fss . ((Sgm (dom fss)) . ((Sgm (dom fss1)) . k))
by A43, A44, A39, GRFUNC_1:2
.=
fss1 . ((Sgm (dom fss1)) . k)
by A45, A41, FUNCT_1:13
.=
fs2 . k
by A2, A37, FUNCT_1:12
;
verum end;
hence
Seq fss2 = fs2
by FINSEQ_1:13; verum