| 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 2847 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ 𝐵 ↔ 𝐸 ∈ 𝐶)) |
| 3 | 2 | rspcev 3577 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) |
| 4 | eliun 4955 | . 2 ⊢ (𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵 ↔ ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) | |
| 5 | 3, 4 | sylibr 237 | 1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → 𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 ∪ ciun 4951 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 df-v 3453 df-iun 4953 |
| This theorem is used by: oeordi 8580 fseqdom 10086 cfsmolem 10329 axdc3lem2 10510 prmreclem5 17078 efgs1b 19930 lbsextlem2 21417 pmatcoe1fsupp 22999 vitalilem2 25910 weiunse 37226 ttcid 37250 grpods 43212 oacl2g 44290 omcl2 44293 ofoafg 44314 cnrefiisplem 46783 |
| Copyright terms: Public domain | W3C validator |