I have trouble with fitch proofs. Con rules cannot be used.
First question:
Premises:
1.(¬P → (Q ∨ ¬R)) ∧ (¬R → ¬Q)
Q
Q → ¬P
Goal: R → ((Q ∨ ¬R) ∧ ¬P)
Second Question is without premise: the goal is
¬ (∃x Cube(x) ∧ ¬∃x Cube(x))
Third question:
Premises:
∃x ((Pink(a) ∧ ∀y (Pink(y) → y = x)) ∧ Orange(x))
Pink(b) ∧ ∀y (Pink(y) → y = b)
Goal: Orange(b)
Any help would be greatly appreciated, thank you.
For the first question, I was thinking of starting with changing the goal into ¬R ∨ ((Q ∨ ¬R) ∧ ¬P) and for the second one, rephrasing the goal to ¬∃x Cube(x) ∨ ¬¬∃x Cube(x). For the third one I honestly have no idea...
Hint for the 3rd one
From 1st premise, instantiating it with $c$ new, we get:
from which: $\text P(a)$, $∀y (\text P(y) → y = c)$ and $\text O(c)$.
From 2nd premise we have $\text P(b)$ and using in with $∀y (\text P(y) → y = c)$, after instantiating it with $b$ we get:
Finally, from $b=c$ and $\text O(c)$, using substitution axiom for equality we conclude with: