Exercise logic.propositional.consequence

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

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

Feedback

Environment

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

Path 1

path[0, 0, 4, 0, 0, 1, 3, 3, 0, 1, 0, 5, 6, 5, 4, 0, 0, 0, 1, 5, 2]
steps21
major rules3
active labels
  • consequence
  • cnf
  • distror

enter consequence, initial, navigator.down, navigator.down, enter cnf, check, enter eliminateimplequiv, logic.propositional.defequiv, exit eliminateimplequiv, check, enter simplify, navigator.down, navigator.right, navigator.down, logic.propositional.notnot, navigator.up, navigator.up, exit simplify, check, enter distror, logic.propositional.oroverand