I feel this is an important question for me to understand to get the whole hang of it.
Everyone except one student in your class has an internet connection
Given I(x) = x has an internet connection, domain: set of all students in my class.
My solution is:
∀x ∃y {(x ≠ y)⟶I(x) ⋀ ㄱI(y) ⋀ ∀k(ㄱI(k)⟶(y=k))}
Thought pattern:
For every student x,there is a student y for which if x is not y, then x has internet connection. The y guy(s) doesn't have internet connection, and to make y unique, add the later stuff ...⋀ ∀k(ㄱI(k)⟶(y=k))