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