Exercise logic.propositional.consequence
Description
Prove that formula is a logical consequence of a set of formulas
![](http://ideas.cs.uu.nl/images/external.png)
~q => (~p || p) /\ (~q || p)
ready: no
Feedback
Environment
initial=TList [TCon logic1.not [TVar "q"]]
Path 1
path | [0, 0, 4, 0, 0, 3, 0, 0, 0, 0, 1, 3, 0, 0, 1, 4, 4, 1, 0, 0, 1, 1, 0, 0] |
steps | 24 |
major rules | 3 |
active labels | - consequence
- specialdistrnot
|
enter consequence,
initial,
navigator.down,
navigator.down,
enter cnf,
exit cnf,
navigator.up,
navigator.up,
navigator.downlast,
enter cnf,
check,
enter eliminateimplequiv,
logic.propositional.defimpl,
exit eliminateimplequiv,
check,
enter demorgan,
navigator.down,
logic.propositional.demorganor,
navigator.up,
exit demorgan,
check,
enter specialdistrnot,
check,
logic.propositional.oroverand