Apply Farkas' lemma to $Ad\le0$, $d\ge0$, $c^Td\ge1$. An infeasibility certificate has a strictly positive multiplier $t$ on the final row. Dividing the other multipliers by $t$ gives a dual feasible vector for the original program. Weak duality then supplies a finite objective bound, a contradiction.