Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
(¬(q → p) ∧ T) ↔ ((r ↔ s) ∨ (T ∧ ¬(F ∨ (s ∧ s))))
⇒ logic.propositional.truezeroand¬(q → p) ↔ ((r ↔ s) ∨ (T ∧ ¬(F ∨ (s ∧ s))))
⇒ logic.propositional.defimpl¬(¬q ∨ p) ↔ ((r ↔ s) ∨ (T ∧ ¬(F ∨ (s ∧ s))))
⇒ logic.propositional.demorganor(¬¬q ∧ ¬p) ↔ ((r ↔ s) ∨ (T ∧ ¬(F ∨ (s ∧ s))))
⇒ logic.propositional.notnot(q ∧ ¬p) ↔ ((r ↔ s) ∨ (T ∧ ¬(F ∨ (s ∧ s))))