set B = (dom f) -^ A;
per cases ( A c= dom f or not A c= dom f ) ;
suppose A c= dom f ; :: thesis: ex b1 being Sequence st
( dom b1 = (dom f) -^ A & f = (f | A) ^ b1 )

then dom f = A +^ ((dom f) -^ A) by ORDINAL3:def 5;
then consider S1, S2 being Sequence such that
A1: ( f = S1 ^ S2 & dom S1 = A & dom S2 = (dom f) -^ A ) by ORDINAL5:2;
take S2 ; :: thesis: ( dom S2 = (dom f) -^ A & f = (f | A) ^ S2 )
f | (dom S1) = S1 | (dom S1) by A1, Th2;
hence ( dom S2 = (dom f) -^ A & f = (f | A) ^ S2 ) by A1; :: thesis: verum
end;
suppose A2: not A c= dom f ; :: thesis: ex b1 being Sequence st
( dom b1 = (dom f) -^ A & f = (f | A) ^ b1 )

take g = {} ; :: thesis: ( dom g = (dom f) -^ A & f = (f | A) ^ g )
f ^ g = f by Th1;
hence ( dom g = (dom f) -^ A & f = (f | A) ^ g ) by RELAT_1:68, A2, ORDINAL3:def 5; :: thesis: verum
end;
end;