Question

What is replacement process in discrete mathematics?

Answer 1

Answer:

Step-by-step explanation: [(P→Q)∧P)]→Q is a tautology using rules of replacement

discrete-mathematics predicate-logic

Just for proof see this [(P→Q)∧P)]→Q is a tautology using rules of replacement

from [(P→Q)∧P)]→Q to [( P∧Q)∧P)]→Q by Mat. Imp.

to [P∧( P∧Q))]→Q by Commutation.

Hope it helps you.....