| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > elex2 | Structured version Visualization version GIF version | ||
| Description: If a class contains another class, then it contains some set. (Contributed by Alan Sare, 25-Sep-2011.) Avoid ax-9 2121, ax-ext 2703, df-clab 2710. (Revised by Wolf Lammen, 30-Nov-2024.) |
| Ref | Expression |
|---|---|
| elex2 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfclel 2807 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 2 | exsimpr 1870 | . 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵) → ∃𝑥 𝑥 ∈ 𝐵) | |
| 3 | 1, 2 | sylbi 217 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∃wex 1780 ∈ wcel 2111 |
| 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-8 2113 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1781 df-clel 2806 |
| This theorem is referenced by: negn0 11541 itg2addnclem2 37712 risci 38027 dvh1dimat 41480 |
| Copyright terms: Public domain | W3C validator |