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