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