Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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