let X be set ; :: thesis: .: (id X) = id (bool X)
A1: dom (id X) = X ;
then A2: dom (.: (id X)) = bool X by FUNCT_3:def 1;
for A being object st A in bool X holds
(.: (id X)) . A = A
proof
let A be object ; :: thesis: ( A in bool X implies (.: (id X)) . A = A )
assume A in bool X ; :: thesis: (.: (id X)) . A = A
then reconsider A = A as Subset of X ;
(.: (id X)) . A = (id X) .: A by A1, FUNCT_3:def 1
.= A by FUNCT_1:92 ;
hence (.: (id X)) . A = A ; :: thesis: verum
end;
hence .: (id X) = id (bool X) by A2, FUNCT_1:17; :: thesis: verum