English

Without using truth table, show that (p ∨ q) → r ≡ (p → r) ∧ (q → r)

Advertisements
Advertisements

Question

Without using truth table, show that

(p ∨ q) → r ≡ (p → r) ∧ (q → r)

Sum
Advertisements

Solution

L.H.S.

≡ (p ∨ q) → r

≡ ~ (p ∨ q) ∨ r          ....[p → q → ~ p ∨ q]

≡ (~ p ∧ ~ q) ∨ r       ....[De Morgan’s law] 

≡ (~ p ∨ r) ∧ (~ q ∨ r)       .....[Distributive law]

≡ (p → r) ∧ (q → r)             .....[p → q → ~ p ∨ q]

= R.H.S.

shaalaa.com
  Is there an error in this question or solution?
Chapter 1: Mathematical Logic - Exercise 1.9 [Page 22]

APPEARS IN

RELATED QUESTIONS

If A = {2, 3, 4, 5, 6}, then which of the following is not true?

(A) ∃ x ∈ A such that x + 3 = 8

(B) ∃ x ∈ A such that x + 2 < 5

(C) ∃ x ∈ A such that x + 2 < 9

(D) ∀ x ∈ A such that x + 6 ≥ 9


Using the rules of negation, write the negatlon of the following: 

(a) p ∧ (q → r)

(b)  ~P ∨ ~q


Rewrite the following statement without using if ...... then.

If a man is a judge then he is honest.


Rewrite the following statement without using if ...... then.

It 2 is a rational number then `sqrt2` is irrational number.


Rewrite the following statement without using if ...... then.

It f(2) = 0 then f(x) is divisible by (x – 2).


Using rules in logic, prove the following:

∼p ∧ q ≡ (p ∨ q) ∧ ∼p


Using the rules in logic, write the negation of the following:

(p ∨ q) ∧ (q ∨ ∼r)


Using the rules in logic, write the negation of the following:

(p → q) ∧ r


Without using truth table, show that

~r → ~ (p ∧ q) ≡ [~ (q → r)] → ~ p


Using the algebra of statement, prove that

(p ∧ q) ∨ (p ∧ ~ q) ∨ (~ p ∧ ~ q) ≡ (p ∨ ~ q)


The statement pattern p ∧ ( q v ~ p) is equivalent to ______.


For any two statements p and q, the negation of the expression (p ∧ ∼q) ∧ ∼p is ______ 


The logically equivalent statement of (p ∨ q) ∧ (p ∨ r) is ______ 


The negation of p → (~p ∨ q) is ______ 


The statement pattern p ∧ (∼p ∧ q) is ______.


If p ∨ q is true, then the truth value of ∼ p ∧ ∼ q is ______.


Which of the following is not a statement?


Negation of the Boolean expression `p Leftrightarrow (q \implies p)` is ______. 


Without using truth table, prove that:

[p ∧ (q ∨ r)] ∨ [∼r ∧ ∼q ∧ p] ≡ p


Show that the simplified form of (p ∧ q ∧ ∼ r) ∨ (r ∧ p ∧ q) ∨ (∼ p ∨ q) is q ∨ ∼ p.


The logically equivalent statement of \[\left(\sim p\wedge q\right)\vee\left(\sim p\wedge\sim q\right)\] \[\vee\left(\ p\wedge\sim q\right)\] is


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×