Question: What Ls wrong with the following proof ? (Non)Theorem: If binary relation R Ls symmetric and transitive, then R is reflexive. (Non)Proof: Let x be

What Ls wrong with the following "proof ? (Non)Theorem: If binary relation R Ls symmetric and transitive, then R is reflexive. (Non)Proof: Let x be some member of the domain of R. Pick y such that xRy. By symmetry. yRx. By transitivity. xRy and yRx imply xRx. Since x is an arbitrary member of R's domain, we have shown that xRx for every element in the domain of R. which "proves" that R Ls reflexive
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
