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)) ∧ (F ∨ ¬(q → p)))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.idempand(F ∨ ¬(q → p) ∨ ((F ∨ ¬(q → p)) ∧ (F ∨ ¬(q → p)))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.absorpor(F ∨ ¬(q → p)) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.defimpl(F ∨ ¬(¬q ∨ p)) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.demorganor(F ∨ (¬¬q ∧ ¬p)) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.falsezeroor(¬¬q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.notnot(q ∧ ¬p) ↔ ((r ↔ s) ∨ ¬s)