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