Minor-minimal non-projective planar graphs with an internal 3-separation

Archdeacon proved that a graph is projective planar if and only if it has no minor isomorphic to a graph from a list of 35 specific graphs. We describe a 2-step strategy to obtain a more modern and hopefully shorter proof of the theorem, and execute the first step.