Prove the following, using the semantic equivalences. In each step apply only one rule once and state the name of the rule.   a. (p ∧ q) → r ≡ (p → r ) ∨ (q → r )

How do i solve b

Let A={1,2,3,4,5,6} and consider the following 3 subsets of A. A, = {1,3,5}; A2 = %3D {2,4, 6}; A3 = {3, 6}. Define the relation R on set A as follows: x R y if and only if { x, y} C A or { x, y}C A, or { x,y}C A. That is, x R y if and only if x and y are both in A, or x and y are both in A2 or x and y are both in A3.

Please do the following questions with handwritten working out.