Exercise logic.propositional.consequence

Description
Prove that formula is a logical consequence of a set of formulas

((p /\ r) || (~p /\ ~r)) /\ ((q /\ s) || (~q /\ ~s)) => (p || q) <-> (r || s)
ready: no

Feedback

Environment

initial=TList [TCon logic1.equivalent [TVar "p",TVar "r"],TCon logic1.equivalent [TVar "q",TVar "s"]]

Path 1

path[0, 0, 0, 3, 0, 0, 2, 0, 0, 3, 3, 0, 0, 2, 0, 2, 0, 3, 3]
steps19
major rules3
active labels
  • consequence
  • cnf

enter consequence, initial, conj-intro, navigator.down, navigator.down, enter cnf, check, navigator.down, check, enter eliminateimplequiv, logic.propositional.defequiv, exit eliminateimplequiv, navigator.up, check, navigator.down, navigator.right, check, enter eliminateimplequiv, logic.propositional.defequiv