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