Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > elex22 | Structured version Visualization version GIF version |
Description: If two classes each contain another class, then both contain some set. (Contributed by Alan Sare, 24-Oct-2011.) |
Ref | Expression |
---|---|
elex22 | ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1a 2683 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) | |
2 | eleq1a 2683 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐶)) | |
3 | 1, 2 | anim12ii 592 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) |
4 | 3 | alrimiv 1842 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) |
5 | elisset 3188 | . . 3 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴) | |
6 | 5 | adantr 480 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥 𝑥 = 𝐴) |
7 | exim 1751 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) | |
8 | 4, 6, 7 | sylc 63 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∀wal 1473 = wceq 1475 ∃wex 1695 ∈ wcel 1977 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-12 2034 ax-ext 2590 |
This theorem depends on definitions: df-bi 196 df-an 385 df-tru 1478 df-ex 1696 df-sb 1868 df-clab 2597 df-cleq 2603 df-clel 2606 df-v 3175 |
This theorem is referenced by: en3lplem1VD 38100 |
Copyright terms: Public domain | W3C validator |