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

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

Proof of Theorem rspn0
StepHypRef Expression
1 n0 4303 . 2 (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥𝐴)
2 df-ral 3050 . . 3 (∀𝑥𝐴 𝜑 ↔ ∀𝑥(𝑥𝐴𝜑))
3 exim 1835 . . . 4 (∀𝑥(𝑥𝐴𝜑) → (∃𝑥 𝑥𝐴 → ∃𝑥𝜑))
4 ax5e 1913 . . . 4 (∃𝑥𝜑𝜑)
53, 4syl6com 37 . . 3 (∃𝑥 𝑥𝐴 → (∀𝑥(𝑥𝐴𝜑) → 𝜑))
62, 5biimtrid 242 . 2 (∃𝑥 𝑥𝐴 → (∀𝑥𝐴 𝜑𝜑))
71, 6sylbi 217 1 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝜑𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wal 1539  wex 1780  wcel 2113  wne 2930  wral 3049  c0 4283
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-9 2123  ax-ext 2706
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2713  df-cleq 2726  df-ne 2931  df-ral 3050  df-dif 3902  df-nul 4284
This theorem is referenced by:  r19.3rzv  4454  hashge2el2dif  14401  rmodislmodlem  20878  rmodislmod  20879  scmatf1  22473  fusgrregdegfi  29592  rusgr1vtxlem  29610  upgrewlkle2  29629  zarclsiin  33977  ralralimp  47466
  Copyright terms: Public domain W3C validator