Sr Examen

Expresión A⇒(B∧(C∨D))∧¬A⇒(C∨D)

El profesor se sorprenderá mucho al ver tu solución correcta😉

    Solución

    Ha introducido [src]
    (a⇒(b∧(¬a)∧(c∨d)))⇒(c∨d)
    $$\left(a \Rightarrow \left(b \wedge \neg a \wedge \left(c \vee d\right)\right)\right) \Rightarrow \left(c \vee d\right)$$
    Solución detallada
    $$a \Rightarrow \left(b \wedge \neg a \wedge \left(c \vee d\right)\right) = \neg a$$
    $$\left(a \Rightarrow \left(b \wedge \neg a \wedge \left(c \vee d\right)\right)\right) \Rightarrow \left(c \vee d\right) = a \vee c \vee d$$
    Simplificación [src]
    $$a \vee c \vee d$$
    a∨c∨d
    Tabla de verdad
    +---+---+---+---+--------+
    | a | b | c | d | result |
    +===+===+===+===+========+
    | 0 | 0 | 0 | 0 | 0      |
    +---+---+---+---+--------+
    | 0 | 0 | 0 | 1 | 1      |
    +---+---+---+---+--------+
    | 0 | 0 | 1 | 0 | 1      |
    +---+---+---+---+--------+
    | 0 | 0 | 1 | 1 | 1      |
    +---+---+---+---+--------+
    | 0 | 1 | 0 | 0 | 0      |
    +---+---+---+---+--------+
    | 0 | 1 | 0 | 1 | 1      |
    +---+---+---+---+--------+
    | 0 | 1 | 1 | 0 | 1      |
    +---+---+---+---+--------+
    | 0 | 1 | 1 | 1 | 1      |
    +---+---+---+---+--------+
    | 1 | 0 | 0 | 0 | 1      |
    +---+---+---+---+--------+
    | 1 | 0 | 0 | 1 | 1      |
    +---+---+---+---+--------+
    | 1 | 0 | 1 | 0 | 1      |
    +---+---+---+---+--------+
    | 1 | 0 | 1 | 1 | 1      |
    +---+---+---+---+--------+
    | 1 | 1 | 0 | 0 | 1      |
    +---+---+---+---+--------+
    | 1 | 1 | 0 | 1 | 1      |
    +---+---+---+---+--------+
    | 1 | 1 | 1 | 0 | 1      |
    +---+---+---+---+--------+
    | 1 | 1 | 1 | 1 | 1      |
    +---+---+---+---+--------+
    FNC [src]
    Ya está reducido a FNC
    $$a \vee c \vee d$$
    a∨c∨d
    FNDP [src]
    $$a \vee c \vee d$$
    a∨c∨d
    FND [src]
    Ya está reducido a FND
    $$a \vee c \vee d$$
    a∨c∨d
    FNCD [src]
    $$a \vee c \vee d$$
    a∨c∨d