let X be set ; for h being one-to-one Function holds (h | X) " = (h ") | (h .: X)
let h be one-to-one Function; (h | X) " = (h ") | (h .: X)
reconsider hX = h | X as one-to-one Function ;
then A10:
dom (hX ") = dom ((h ") | (h .: X))
by TARSKI:2;
now for r being object holds
( not r in dom ((h | X) ") or not ((h | X) ") . r <> ((h ") | (h .: X)) . r )given r being
object such that A11:
r in dom ((h | X) ")
and A12:
((h | X) ") . r <> ((h ") | (h .: X)) . r
;
contradiction
r in (dom (h ")) /\ (h .: X)
by A10, A11, RELAT_1:61;
then
r in h .: X
by XBOOLE_0:def 4;
then consider t being
object such that
t in dom h
and
t in X
and A13:
h . t = r
by FUNCT_1:def 6;
r in rng hX
by A11, FUNCT_1:33;
then consider g being
object such that A14:
g in dom (h | X)
and A15:
(h | X) . g = r
by FUNCT_1:def 3;
A16:
h . g = r
by A14, A15, FUNCT_1:47;
g in (dom h) /\ X
by A14, RELAT_1:61;
then A17:
g in dom h
by XBOOLE_0:def 4;
(hX ") . r <> (h ") . r
by A10, A11, A12, FUNCT_1:47;
then
g <> (h ") . (h . t)
by A14, A15, A13, FUNCT_1:34;
hence
contradiction
by A13, A17, A16, FUNCT_1:34;
verum end;
hence
(h | X) " = (h ") | (h .: X)
by A10; verum