Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
Final term is not finished
T ∧ ((¬(¬q ∨ p) ∨ ¬(¬q ∨ p)) ↔ ((r ↔ (s ∧ T)) ∨ ¬s))
⇒ logic.propositional.demorganorT ∧ (((¬¬q ∧ ¬p) ∨ ¬(¬q ∨ p)) ↔ ((r ↔ (s ∧ T)) ∨ ¬s))
⇒ logic.propositional.demorganorT ∧ (((¬¬q ∧ ¬p) ∨ (¬¬q ∧ ¬p)) ↔ ((r ↔ (s ∧ T)) ∨ ¬s))
⇒ logic.propositional.idemporT ∧ ((¬¬q ∧ ¬p) ↔ ((r ↔ (s ∧ T)) ∨ ¬s))
⇒ logic.propositional.notnotT ∧ ((q ∧ ¬p) ↔ ((r ↔ (s ∧ T)) ∨ ¬s))