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