MHB Proving ((p->~q)∧q)->~p as a Tautology - Abdullah's FB Question

  • Thread starter Thread starter alyafey22
  • Start date Start date
AI Thread Summary
Abdullah's question focuses on proving that the expression ((p→¬q)∧q)→¬p is a tautology. The proof begins by applying the commutative law to rewrite the expression. It utilizes the equivalence p→q ≡ ¬p∨q to transform the expression into a more manageable form. By applying the distributive law and recognizing that q∧¬q is false, the expression simplifies to (q∧¬p)→¬p. Ultimately, the proof concludes that the expression is always true, confirming it as a tautology.
alyafey22
Gold Member
MHB
Messages
1,556
Reaction score
2
Abdullah asked the following question

prove that $$((p\to \neg q) \land q) \to \neg p$$

is a Tautology .
 
Mathematics news on Phys.org
By the commutative law we can rewrite as

$$(q \land (p\to \neg q) ) \to \neg p$$

First we need to know that

$$\tag{1}p\to q \equiv \, \neg p \lor q$$

Using this we get

$$q \land (\neg p \lor \neg q)\to \neg p $$

By distributive law

$$ (q \land \neg p) \lor (q \land \neg q)\to \neg p $$

Since

$$q \land \neg q \equiv F \,\,\, , \,\,\, q \lor F \equiv q$$

So we have

$$ (q \land \neg p)\to \neg p $$

Using (1) again

$$ \neg (q \land \neg p) \lor \neg p \equiv \neg q \lor p \lor \neg p\equiv T$$

Using De Morgan law .
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top