Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

¬(((F ∨ q) → p) ∨ (((F ∧ T) ∨ q) → p)) ↔ (¬s ∨ (r ↔ s))

⇒ logic.propositional.falsezeroand

¬(((F ∨ q) → p) ∨ ((F ∨ q) → p)) ↔ (¬s ∨ (r ↔ s))