OK fair point a truism, that is close enough for me.
Consistency alone is impossible, assume you have 2 machines connected over a distance and they are both synchronized. Lets call them A & B.
Some event happens to A, and it wants to inform B of the change. Even if B accepts the change immediately, consistency in the literal sense can never be achieved due to the speed of light and the limit it places on information delivery. It always takes some amount of time for the information to travel from A -> B, so A and B can never be in the same state 100% of the time.
Thus, there are always periods of time, no matter how short, where A and B are not consistent with each other. An attacker can take advantage of this window of time and cause disruption.
I thought the point was A goes "Hangon, need to talk to B"; which sure, that depends on A trusting B, and being able to know that B is gone? This doesn't work for a peer to peer network as you don't inherently know all of the network, so a major netsplit is hard to detect and impossible to be certain of, but is presumably what organisations such as Visa do?
In a trusted or centralized network it is easier to provide high levels of consistency (and the other 2) because there is a governed control over the network, the connections between them can be faster, etc etc
You don't have that control over a P2P network, so the latency is generally longer, and consistency is further compromised. The same applies though with P2P networks, synchronous or asynchronous, you don't need to know or trust any of the network.
A creates a transaction and broadcasts to all connected nodes, it still takes time for those nodes to receive that communication and apply it (if they agree with it and are honest) so that they are in the same state as A. In the mean time another node C can create a transaction that conflicts with A's at the exact same time (measured in planck time) and broadcast it too, then you have an issue. Even if C is honest, it is impossible for it to be in the same state as A at the same time if as state has changed. As far as C is concerned A is still in the same state it was before A made that transaction for a duration of time after the event.
Thus, there are always periods of time, no matter how short, where A and B are not consistent with each other. An attacker can take advantage of this window of time and cause disruption.
Then why are people not exploiting that and double spending?
Please prove by doing a double spend.
Because it isn't easy to do even with a moderate duration of attack window, and so is not worth the time and effort to prove something is false that can not be true in the first place due to accepted laws of physics.