Current location - Training Enrollment Network - Mathematics courses - Discrete mathematics solves (p→q)∧(q→p) equivalence (p∨q)→(q∧p), where p and q are propositional formulas.
Discrete mathematics solves (p→q)∧(q→p) equivalence (p∨q)→(q∧p), where p and q are propositional formulas.
(p→q)∧(q→p)

& lt=> (non-p∨q)∧ (non-q∨p) implication equivalence

& lt=> (not p∧ not q)∨ (not p∧p)∨(q∧ not q)∨(q∧p) distribution law.

& lt=> (non-p∧ non-q)∨(p∧q) Law of Contradiction, Law of Commutation of Identities

& lt=> Non -(p∨q)∨(p∧q) De Morgan's Law.

& lt= & gt(p∨q)→(p∧q) implication equivalence formula