How to do this problem for discrete math.

Use the rules of inference to show that if V x (Ax) v and V xcAx) where the domains of all quantifiers are the same. Construct your argument by rearranging the following building blocks. ) Rx)) are true, then V x("A(x) A is also tr 1. We will show that if the premises are true, then (1A(a) Pla) for every a. 2. Suppose -R(a) is true for some a. 3. For such an a, universal modus tollens applied to the second premise gives us -(P(a)Q(a Drag the text blocks below into their correct order. Applying the rules of De Morgan's law on P(a) v Qa). By resolution, we conclude P(a) v P(a). This is logically equivalent to P(a By universal generalization, we get, By universal instantiation on vx (P(x) v Q(x)). we conclude We have therefore shown -R(a)P(a) for every a