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

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

Proof of Theorem rspn0
StepHypRef Expression
1 n0 4307 . 2 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
2 df-ral 3080 . . 3 (∀𝑥𝐴 𝜑 ↔ ∀𝑥(𝑥𝐴𝜑))
3 exim 1864 . . . 4 (∀𝑥(𝑥𝐴𝜑) → (∃𝑥 𝑥𝐴 → ∃𝑥𝜑))
4 ax5e 1942 . . . 4 (∃𝑥𝜑𝜑)
53, 4syl6com 38 . . 3 (∃𝑥 𝑥𝐴 → (∀𝑥(𝑥𝐴𝜑) → 𝜑))
62, 5biimtrid 245 . 2 (∃𝑥 𝑥𝐴 → (∀𝑥𝐴 𝜑𝜑))
71, 6sylbi 220 1 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1568  wex 1809  wcel 2143  wne 2958  wral 3079  c0 4286
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-9 2153  ax-ext 2735
This theorem depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-ne 2959  df-ral 3080  df-dif 3908  df-nul 4287
This theorem is referenced by:  r19.3rzv  4464  hashge2el2dif  14513  rmodislmodlem  21050  rmodislmod  21051  scmatf1  22688  fusgrregdegfi  29919  rusgr1vtxlem  29937  upgrewlkle2  29956  zarclsiin  34261  ralralimp  48015
  Copyright terms: Public domain W3C validator