| 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 2159, ax-ext 2741, df-clab 2748. (Revised by Wolf Lammen, 30-Nov-2024.) |
| Ref | Expression |
|---|---|
| elex2 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfclel 2845 | . 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵)) | |
| 2 | exsimpr 1896 | . 2 ⊢ (∃𝑥(𝑥 = 𝐴 ∧ 𝑥 ∈ 𝐵) → ∃𝑥 𝑥 ∈ 𝐵) | |
| 3 | 1, 2 | sylbi 220 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∃wex 1806 ∈ wcel 2149 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 df-clel 2844 |
| This theorem is referenced by: negn0 11642 axprALT2 35444 itg2addnclem2 38210 risci 38525 dvh1dimat 42104 |
| Copyright terms: Public domain | W3C validator |