Expresión dc∨bd⇒(db⇔dc)∨db⇒c
El profesor se sorprenderá mucho al ver tu solución correcta😉
Solución
Solución detallada
$$\left(b \wedge d\right) \vee \left(c \wedge d\right) = d \wedge \left(b \vee c\right)$$
$$\left(b \wedge d\right) ⇔ \left(c \wedge d\right) = \left(b \wedge c\right) \vee \left(\neg b \wedge \neg c\right) \vee \neg d$$
$$\left(b \wedge d\right) \vee \left(\left(b \wedge d\right) ⇔ \left(c \wedge d\right)\right) = b \vee \neg c \vee \neg d$$
$$\left(\left(b \wedge d\right) \vee \left(c \wedge d\right)\right) \Rightarrow \left(\left(b \wedge d\right) \vee \left(\left(b \wedge d\right) ⇔ \left(c \wedge d\right)\right)\right) = b \vee \neg c \vee \neg d$$
$$\left(\left(\left(b \wedge d\right) \vee \left(c \wedge d\right)\right) \Rightarrow \left(\left(b \wedge d\right) \vee \left(\left(b \wedge d\right) ⇔ \left(c \wedge d\right)\right)\right)\right) \Rightarrow c = c$$
Tabla de verdad
+---+---+---+--------+
| b | c | d | result |
+===+===+===+========+
| 0 | 0 | 0 | 0 |
+---+---+---+--------+
| 0 | 0 | 1 | 0 |
+---+---+---+--------+
| 0 | 1 | 0 | 1 |
+---+---+---+--------+
| 0 | 1 | 1 | 1 |
+---+---+---+--------+
| 1 | 0 | 0 | 0 |
+---+---+---+--------+
| 1 | 0 | 1 | 0 |
+---+---+---+--------+
| 1 | 1 | 0 | 1 |
+---+---+---+--------+
| 1 | 1 | 1 | 1 |
+---+---+---+--------+
Ya está reducido a FND
$$c$$
Ya está reducido a FNC
$$c$$