Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defequiv

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

⇒ logic.propositional.absorpor

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

⇒ logic.propositional.falsezeroor

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