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