Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

(r ↔ r) → (¬(¬F ∨ F) ∨ ¬r)

⇒ logic.propositional.notfalse

(r ↔ r) → (¬(T ∨ F) ∨ ¬r)