2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/74303Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, can both be interpreted in Zermelo-Fraenkel Set Theory, ZF; and that if ZF is consistent, then PA+PRA is consistent. We show that PA+PRA is inconsistent; it follows that ZF, too, is inconsistent.rev1; typos corrected in formulas; 5 pages; an HTML version is available at http://alixcomsi.com/An_arguable_inconsistency_in_ZF.htmGeneral Mathematics03B10text