let m, n be Element of NAT ; :: thesis: ( m <> n implies x. m <> x. n )
assume A1: m <> n ; :: thesis: x. m <> x. n
( (x. m) . 2 = m & (x. n) . 2 = n ) ;
hence x. m <> x. n by A1; :: thesis: verum