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