3. Without using the truth table prove the following equivalences. (a) \( p \rightarrow(q \vee r) \equiv(p \rightarrow q) \vee(p \rightarrow r) \). (b) \( (\neg p \rightarrow \neg q) \rightarrow(q \rightarrow p) \equiv T \) 4. Prove that if \( x \) is irrational, then \( 1 / x \) is irrational.
Added by James A.
Close
Step 1
- Use the definition of implication: \( p \rightarrow x \equiv \neg p \vee x \). Show more…
Show all steps
Your feedback will help us improve your experience
William Mead and 97 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Use a truth table to prove that the statement [(p ∨ q) ∧ (!p)] → q is always true, no matter what p and q are.
Sri K.
Show that the conditional statement [¬p ∧ (p ∨ q)] → q is a tautology without using truth tables.
Adi S.
Prove that (p -> q) ∧ (q -> r) -> (p -> r) is a tautology using a truth table.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Watch the video solution with this free unlock.
EMAIL
PASSWORD