Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.truezeroand

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

⇒ logic.propositional.falsezeroor

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