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