We prove a conjecture of Seymour (1993) stating that for every apex-forest H-1 and outerplanar graph H-2 there is an integer p such that every 2-connected graph of pathwidth at least p contains H-1 or H-2 as a minor. An independent proof was recently obtained by Dang and Thomas [3].