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