Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.falsezeroand

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

⇒ logic.propositional.falsezeroor

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