| 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 2152, ax-ext 2734, df-clab 2741. (Revised by Wolf Lammen, 30-Nov-2024.) |
| Ref | Expression |
|---|---|
| elex2 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfclel 2838 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 2 | exsimpr 1889 | . 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵) → ∃𝑥 𝑥 ∈ 𝐵) | |
| 3 | 1, 2 | sylbi 219 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1560 ∃wex 1799 ∈ wcel 2142 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-ex 1800 df-clel 2837 |
| This theorem is referenced by: negn0 11616 axprALT2 35405 itg2addnclem2 38171 risci 38486 dvh1dimat 42065 |
| Copyright terms: Public domain | W3C validator |