assume F₄() <> F₅() ; :: thesis: contradiction
then consider x being set such that
A7: ( x in NAT & F₄() . x <> F₅() . x ) by A1, A4, FUNCT_1:9;
defpred S₁[ Nat] means F₄() . $1 <> F₅() . $1;
ex k being Element of NAT st S₁[k] by A7;
then A8: ex k being Nat st S₁[k] ;
consider m being Nat such that
A9: S₁[m] and
A10: for n being Nat st S₁[n] holds
m <= n from NAT_1:sch 5(A8);

now

set k = m -' 3;
assume ( m <> 0 & m <> 1 & m <> 2 ) ; :: thesis: contradiction
then 3 <= m by NAT_1:28;
then A11: m = (m -' 3) + 3 by XREAL_1:237;
then A12: (m -' 3) + 0 < m by XREAL_1:8;
(m -' 3) + 1 < m by A11, XREAL_1:8;
then A13: F₄() . ((m -' 3) + 1) = F₅() . ((m -' 3) + 1) by A10;
(m -' 3) + 2 < m by A11, XREAL_1:8;
then A14: F₄() . ((m -' 3) + 2) = F₅() . ((m -' 3) + 2) by A10;
( F₄() . ((m -' 3) + 3) = F₆((m -' 3),(F₄() . (m -' 3)),(F₄() . ((m -' 3) + 1)),(F₄() . ((m -' 3) + 2))) & F₅() . ((m -' 3) + 3) = F₆((m -' 3),(F₅() . (m -' 3)),(F₅() . ((m -' 3) + 1)),(F₅() . ((m -' 3) + 2))) ) by A3, A6;
hence contradiction by A9, A10, A11, A12, A13, A14; :: thesis: verum

end;

hence contradiction by A2, A5, A9; :: thesis: verum