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