Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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