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