MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rspn0 Structured version   Visualization version   GIF version

Theorem rspn0 4353
Description: Specialization for restricted generalization with a nonempty class. (Contributed by Alexander van der Vekens, 6-Sep-2018.) Avoid ax-10 2138, ax-12 2172. (Revised by Gino Giotto, 28-Jun-2024.)
Assertion
Ref Expression
rspn0 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝜑𝜑))
Distinct variable groups:   𝑥,𝐴   𝜑,𝑥

Proof of Theorem rspn0
StepHypRef Expression
1 n0 4347 . 2 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
2 df-ral 3063 . . 3 (∀𝑥𝐴 𝜑 ↔ ∀𝑥(𝑥𝐴𝜑))
3 exim 1837 . . . 4 (∀𝑥(𝑥𝐴𝜑) → (∃𝑥 𝑥𝐴 → ∃𝑥𝜑))
4 ax5e 1916 . . . 4 (∃𝑥𝜑𝜑)
53, 4syl6com 37 . . 3 (∃𝑥 𝑥𝐴 → (∀𝑥(𝑥𝐴𝜑) → 𝜑))
62, 5biimtrid 241 . 2 (∃𝑥 𝑥𝐴 → (∀𝑥𝐴 𝜑𝜑))
71, 6sylbi 216 1 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1540  wex 1782  wcel 2107  wne 2941  wral 3062  c0 4323
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-9 2117  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-tru 1545  df-fal 1555  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-ne 2942  df-ral 3063  df-dif 3952  df-nul 4324
This theorem is referenced by:  hashge2el2dif  14441  rmodislmodlem  20539  rmodislmod  20540  rmodislmodOLD  20541  scmatf1  22033  fusgrregdegfi  28826  rusgr1vtxlem  28844  upgrewlkle2  28863  zarclsiin  32851  ralralimp  45986
  Copyright terms: Public domain W3C validator