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