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