Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.demorganor

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

⇒ logic.propositional.notnot

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