frb
- 16
- 0
Suppose I want to show that two functions f and g are equal. A way to prove this could be to prove the statement:
f(x) = n \Leftrightarrow g(x) = n
Is it enough to show one side of the implication?
Prove the following statement:
f(x) = n \Rightarrow g(x) = n
and reason as follows, suppose f(x) \neq n,
\Rightarrow \exists m\neq n: f(x)=m
\Rightarrow g(x)=m\neq n
Which would mean that I have shown the converse implication, and thus I have equivalence.
f(x) = n \Leftrightarrow g(x) = n
Is it enough to show one side of the implication?
Prove the following statement:
f(x) = n \Rightarrow g(x) = n
and reason as follows, suppose f(x) \neq n,
\Rightarrow \exists m\neq n: f(x)=m
\Rightarrow g(x)=m\neq n
Which would mean that I have shown the converse implication, and thus I have equivalence.
Last edited: