Exercise logic.propositional.dnf.unicode

Description
Proposition to DNF (unicode support)

(F ∨ ¬(¬q ∨ p)) ↔ ((r ↔ s) ∨ ¬s)

ready: no

Feedback

• onefirst
• allfirsts (2)
• allapplications
• derivation
• microsteps

Path 1

path	[0, 2, 0, 2, 0, 3, 1, 0]
steps	8
major rules	1
active labels	dnf eliminateimplequiv