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