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