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