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