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