Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬((q → (p ∧ p)) ∧ (F ∨ (q → p))) ↔ ((r ↔ s) ∨ ¬s)

⇒ logic.propositional.defimpl

¬((q → (p ∧ p)) ∧ (F ∨ ¬q ∨ p)) ↔ ((r ↔ s) ∨ ¬s)

⇒ logic.propositional.falsezeroor

¬((q → (p ∧ p)) ∧ (¬q ∨ p)) ↔ ((r ↔ s) ∨ ¬s)