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