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