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