![]() |
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.) |
Ref | Expression |
---|---|
elex2 | ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1a 2844 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) | |
2 | 1 | alrimiv 2006 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) |
3 | elisset 3364 | . 2 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴) | |
4 | exim 1908 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → 𝑥 ∈ 𝐵) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥 𝑥 ∈ 𝐵)) | |
5 | 2, 3, 4 | sylc 65 | 1 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1628 = wceq 1630 ∃wex 1851 ∈ wcel 2144 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1869 ax-4 1884 ax-5 1990 ax-6 2056 ax-7 2092 ax-9 2153 ax-12 2202 ax-ext 2750 |
This theorem depends on definitions: df-bi 197 df-an 383 df-tru 1633 df-ex 1852 df-sb 2049 df-clab 2757 df-cleq 2763 df-clel 2766 df-v 3351 |
This theorem is referenced by: negn0 10660 nocvxmin 32225 itg2addnclem2 33787 risci 34111 dvh1dimat 37244 |
Copyright terms: Public domain | W3C validator |