Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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

⇒ logic.propositional.absorpand

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