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