| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elex22 | 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 2279 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐵)) | |
| 2 | eleq1a 2279 | . . . 4 ⊢ (𝐴 ∈ 𝐶 → (𝑥 = 𝐴 → 𝑥 ∈ 𝐶)) | |
| 3 | 1, 2 | anim12ii 343 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) |
| 4 | 3 | alrimiv 1898 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) |
| 5 | elisset 2791 | . . 3 ⊢ (𝐴 ∈ 𝐵 → ∃𝑥 𝑥 = 𝐴) | |
| 6 | 5 | adantr 276 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥 𝑥 = 𝐴) |
| 7 | exim 1623 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶))) | |
| 8 | 4, 6, 7 | sylc 62 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑥 ∈ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1371 = wceq 1373 ∃wex 1516 ∈ wcel 2178 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1471 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-ext 2189 |
| This theorem depends on definitions: df-bi 117 df-sb 1787 df-clab 2194 df-cleq 2200 df-clel 2203 df-v 2778 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |