@lafinur I was referring more to the original problem. Suppose, for instance, that $\Gamma = \{x\to x\}$ where $x$ is a sentence symbol. Then $\Gamma' = \{\neg(x\to x)\}$. Is this consistent?
@lafinur Regarding your argument, it looks like you're misunderstanding what a valuation does. It doesn't assign a true/false value to every formula, but rather a true/false value to every sentence symbol (assuming we are talking about sentential logic here). Then the truth value of every formula is determined by that assignment. The $f$ you've defined is not a valuation at all.
For instance, consider $\Gamma = \{x\land y, \neg(x\lor y)\}$. By your reasoning, one might say "define $f$ such that $f(x\land y) = 1$ and $f(\neg(x\lor y)) = 1$, then $f(\gamma) = 1$ for all $\gamma\in\Gamma$ and therefore $\Gamma$ is consistent". But this $\Gamma$ certainly is not consistent. Really you should be assigning values for $f(x)$ and $f(y)$, and the truth value of each formula involving $x,y$ is determined by these truth assignments. You'll find that no assignment of $x,y$ makes both formulas of $\Gamma$ true.