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