Exercise logic.propositional.consequence
Description
Prove that formula is a logical consequence of a set of formulas
Derivation
![](http://ideas.cs.uu.nl/images/external.png)
~q => ((p || q) /\ (p || (~(p || q) /\ ~p))) || (~(p || q) /\ ~p /\ (p || (~(p || q) /\ ~p)))
⇒ logic.propositional.absorpand, initial=TList [TCon logic1.not [TVar "q"]]~q => ((p || q) /\ (p || (~(p || q) /\ ~p))) || (~(p || q) /\ ~p)
⇒ logic.propositional.demorganor~q => ((p || q) /\ (p || (~(p || q) /\ ~p))) || (~p /\ ~q /\ ~p)
⇒ absorpand-subset~q => ((p || q) /\ (p || (~(p || q) /\ ~p))) || (~p /\ ~q)