Let A := "f is injective" and B := "f(X∩Y)=f(X)∩f(Y)".
My first idea is to show B⟹A through contraposition, so ¬A⟹¬B. Would it then be enough if I say: f is not injective and then show an example where the equation in B is wrong? Would it be a proof then?
No comments:
Post a Comment