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 2696 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) | |
2 | eleq1a 2696 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐶)) | |
3 | 1, 2 | anim12ii 594 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) |
4 | 3 | alrimiv 1855 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) |
5 | elisset 3215 | . . 3 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴) | |
6 | 5 | adantr 481 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥 𝑥 = 𝐴) |
7 | exim 1761 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) | |
8 | 4, 6, 7 | sylc 65 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 ∀wal 1481 = wceq 1483 ∃wex 1704 ∈ wcel 1990 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-12 2047 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-an 386 df-tru 1486 df-ex 1705 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-v 3202 |
This theorem is referenced by: en3lplem1VD 39078 |
Copyright terms: Public domain | W3C validator |