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