Current location - Training Enrollment Network - Mathematics courses - Proof of discrete mathematical problems? (p∧? q)∧(? q∨r)∧? r→? P is a tautology.
Proof of discrete mathematical problems? (p∧? q)∧(? q∨r)∧? r→? P is a tautology.
(? (p∧? q)∧(? q∨r)∧? r)→? p

(? (p∧? q)∧(? q∨r)∧? r)∨? P becomes conjunctive disjunction

p∨? (? (p∧? q)∧(? q∨r)∧? R) permutation law ordering

p∨((p∧? q)∨? (? Q∨r)∨r) De Morgan's Law

p∨((p∧? q)∩(q∧? R)∞r) De Morgan's Law

p∨(p∧? q)∩(q∧? R)∞r associative law

p∨? q∨(q∧? R)∞r separation absorption rate

p∨? q∨? R∨r conjunctive disjunctive absorption rate

real