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

Theorem ssn0rex 4305
Description: There is an element in a class with a nonempty subclass which is an element of the subclass. (Contributed by AV, 17-Dec-2020.)
Assertion
Ref Expression
ssn0rex ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐵 𝑥 ∈ 𝐴)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem ssn0rex
StepHypRef Expression
1 ssrexv 4000 . 2 (𝐴 ⊆ 𝐵 → (∃𝑥 ∈ 𝐴 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐵 𝑥 ∈ 𝐴))
2 n0rex 4304 . 2 (𝐴 ≠ ∅ → ∃𝑥 ∈ 𝐴 𝑥 ∈ 𝐴)
31, 2impel 515 1 ((𝐴 ⊆ 𝐵 ∧ 𝐴 ≠ ∅) → ∃𝑥 ∈ 𝐵 𝑥 ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2145   ≠ wne 2955  ∃wrex 3086   ⊆ wss 3898  ∅c0 4278
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-ne 2956  df-rex 3087  df-dif 3901  df-ss 3915  df-nul 4279
This theorem is used by:  uhgrvd00  30048
  Copyright terms: Public domain W3C validator