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