Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.notnot

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

⇒ logic.propositional.truezeroand

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