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