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