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