Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.defequiv

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