Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
¬((¬q ∨ p) ∧ (¬q ∨ p ∨ F)) ↔ (T ∧ ((r ↔ s) ∨ ¬s))
⇒ logic.propositional.truezeroand¬((¬q ∨ p) ∧ (¬q ∨ p ∨ F)) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.defequiv¬((¬q ∨ p) ∧ (¬q ∨ p ∨ F)) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)
⇒ logic.propositional.absorpor¬((¬q ∨ p) ∧ (¬q ∨ p ∨ F)) ↔ ((r ∧ s) ∨ ¬s)