HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Earth and Environmental Science
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Problems
  2. /Prove, using the laws of the algebra of statements and not a truth table, that ∼big(p vee (∼ p…
AdvancedMathematicsHigh School (11–12)Mathematical ReasoningproofNumerical

Prove, using the laws of the algebra of statements and not a truth table, that ∼big(p vee (∼ p…

StemPy LabContributed by StemPy Lab

Try it on paper first. A hint, the key idea and the worked solution are here when you need them.

Prove, using the laws of the algebra of statements and not a truth table, that ∼(p∨(∼p∧q))≡∼p∧∼q\sim\big(p \vee (\sim p \wedge q)\big) \equiv \sim p \wedge \sim q∼(p∨(∼p∧q))≡∼p∧∼q. Name each law. Then write the dual of the equivalence you proved, and say why the dual is also true without checking it. Finally, in how many of the four rows of the truth table is ∼p∧∼q\sim p \wedge \sim q∼p∧∼q true?

Check your answer

Work it out on paper, then type your number. The answer itself stays hidden.

Need a reminder? The key ideaShowHide

A tautology is always true and a contradiction always false. De Morgan: ∼(p∧q)≡∼p∨∼q\sim(p \wedge q) \equiv \sim p \vee \sim q∼(p∧q)≡∼p∨∼q and ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q. Distributive, complement, identity and absorption laws simplify a statement. Series is ∧\wedge∧, parallel is ∨\vee∨.

The worked solution

Check an answer or open a hint to unlock the worked solution.

Have you tried it?

Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.

Plan. Simplify the bracket, then apply De Morgan.

Step 1. Distributive law. p∨(∼p∧q)≡(p∨∼p)∧(p∨q)p \vee (\sim p \wedge q) \equiv (p \vee \sim p) \wedge (p \vee q)p∨(∼p∧q)≡(p∨∼p)∧(p∨q).

Step 2. Complement and identity. p∨∼p≡Tp \vee \sim p \equiv \mathrm{T}p∨∼p≡T, and T∧(p∨q)≡p∨q\mathrm{T} \wedge (p \vee q) \equiv p \vee qT∧(p∨q)≡p∨q.

Step 3. De Morgan. ∼(p∨q)≡∼p∧∼q\sim(p \vee q) \equiv \sim p \wedge \sim q∼(p∨q)≡∼p∧∼q. This proves the equivalence.

Step 4. The dual. Swap ∧\wedge∧ and ∨\vee∨: ∼(p∧(∼p∨q))≡∼p∨∼q\sim\big(p \wedge (\sim p \vee q)\big) \equiv \sim p \vee \sim q∼(p∧(∼p∨q))≡∼p∨∼q. By the principle of duality, the dual of a true equivalence is true. Each law used above has a dual law, so the same steps with the dual laws prove it.

Step 5. Count. ∼p∧∼q\sim p \wedge \sim q∼p∧∼q is true only when ppp and qqq are both false: 111 row.

Check. Row (F, F): the inside p∨(∼p∧q)p \vee (\sim p \wedge q)p∨(∼p∧q) is F∨F\mathrm{F} \vee \mathrm{F}F∨F, so its negation is T, as the right side says.

Answer: proof complete; the statement is true in 111 row.

Log in to save this for later
← All Problems
← An electrician finds a lamp wired through three branches in parallel…Decide the truth value of each statement… →
More onMathematical Reasoning

Discussion (0)

Log in to join the discussion.

Loading…

Learn it in

  1. Tautologies, equivalence and switching circuitsStatements, Connectives and Truth Tables

More on this topic

  1. Prove by cases that for every integer n, n² leaves remainder 0 or 1 when divided by 3…Advanced
  2. Prove by contradiction that there are no integers a and b with 6a + 9b = 100…Advanced
  3. Prove by contradiction that √3 is irrational…Hard
Prove by exhaustion that no perfect square ends in the digit 2, 3, 7 or 8…Advanced
  • The formula f(n) = n² + n + 41 gives a prime for n = 0, 1, 2, … for a long time…Advanced
  • All problems on this topic →