- $E(x,y)$: $x$ can eat $y$
- $L(x,y)$: $x$ loves eating $y$
- $D$ is the domain of all dogs
- $S$ is the domain of all snakes
Predicate Logic to English:
$\forall a \in S,\sim \ \bigg[ \exists c \in S,\ a\ \ne c \ \wedge E(a,c)\bigg] \iff \forall b \in D, \ L(a,b)$:
All snakes, a, cannot eat any other snakes , if and only if, all snakes, a, loves eating all dogs.
Any thoughts on if this is accurate and/or a way to condense this statment?
Start with the part in the square braces:
Now negate it:
or more plainly,
Now, the right-hand side:
The statement then asserts that for every snake $a$, either both or neither of the two preceding statements hold, i.e.
Notice the big difference between my 'translation' and yours is that mine applies case by case: for each snake $a$ either both or neither are true, but results may differ across snakes.