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