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