# Can one show NP-completeness by showing a reduction to 3SAT?

The standard technique to show NP-completeness of $$L$$ seems to be to show that $$L$$ is in NP, and then to show that some NP-complete language can be reduced to it. What if one tried to show it the other way, i.e., if L $$\leq$$ 3SAT?

Wouldn't that be one one step way of showing that the language $$L$$ is in NP-complete?

If you reduce $$L$$ to 3SAT, then you can conclude that $$L$$ is in NP, that's it.