676 views
2 votes
2 votes
~ $\forall$ x [  P(x) -> (Q(x) v P(x) )  ]

1 Answer

1 votes
1 votes

$\sim ∀ x$ $[P(x) \rightarrow (Q(x) \vee P(x))]$

this can also be written as

$\sim$ ∀x$[(P(x) \rightarrow (Q(x) )\vee (P(x)\rightarrow P(x) )]$

$P(x)\rightarrow P(x)$ will alwaysb be true,

$\sim$ ∀x$[(P(x) \rightarrow (Q(x) )\vee True]$ 

$\sim$ ∀x[True]

"This is not the case that for all "x" the expression is True"

We know that, $\sim$∀$x P(x)$ $\equiv ∃x \sim P(x)$

$∃x \sim[True]$

$∃x [False]$

Value of predicate which is false does not depends on what is the value of x. Hence the expression is a Contradiction.

Related questions

1 votes
1 votes
2 answers
1
0 votes
0 votes
0 answers
2
2 votes
2 votes
2 answers
3
One asked May 3, 2016
3,915 views
1.$ [(p\to q)\wedge (q\to r)]\to (p\to r)$2. $[(p \vee q) \wedge (p \to r) \wedge (q \to r)] \to r$
1 votes
1 votes
1 answer
4