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