Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.idempor

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