Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > eliuni | Structured version Visualization version GIF version |
Description: Membership in an indexed union, one way. (Contributed by JJ, 27-Jul-2021.) |
Ref | Expression |
---|---|
eliuni.1 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
eliuni | ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → 𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eliuni.1 | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
2 | 1 | eleq2d 2687 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ 𝐵 ↔ 𝐸 ∈ 𝐶)) |
3 | 2 | rspcev 3309 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) |
4 | eliun 4524 | . 2 ⊢ (𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵 ↔ ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) | |
5 | 3, 4 | sylibr 224 | 1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → 𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 ∪ ciun 4520 |
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-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-v 3202 df-iun 4522 |
This theorem is referenced by: oeordi 7667 fseqdom 8849 cfsmolem 9092 axdc3lem2 9273 prmreclem5 15624 efgs1b 18149 lbsextlem2 19159 pmatcoe1fsupp 20506 vitalilem2 23378 cnrefiisplem 40055 |
Copyright terms: Public domain | W3C validator |