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