Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notfalse

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