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