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