Let $G=(V, E)$ be a connected, simple, undirected graph. We say that $B\subseteq V$ is a *bridging set* if $B\neq V$ and removing $B$ makes the graph disconnected, or more formally: $$G \setminus B := (V\setminus B\;, \; \{e\in E: e\cap B = \varnothing\})$$ is not connected any more.

Is there an infinite connected graph $G=(V,E)$ such that for every bridging set $B\subseteq V$ there is a bridging set $B_1$ with $B_1\subseteq B$ and $B_1\neq B$?