Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.defimpl

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.notnot

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