| 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 2852 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ 𝐵 ↔ 𝐸 ∈ 𝐶)) |
| 3 | 2 | rspcev 3584 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) |
| 4 | eliun 4965 | . 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 2146 ∃wrex 3092 ∪ ciun 4961 |
| 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 2148 ax-9 2156 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2745 df-cleq 2758 df-clel 2841 df-ral 3083 df-rex 3093 df-v 3460 df-iun 4963 |
| This theorem is used by: oeordi 8582 fseqdom 10029 cfsmolem 10272 axdc3lem2 10453 prmreclem5 17005 efgs1b 19837 lbsextlem2 21320 pmatcoe1fsupp 22895 vitalilem2 25805 weiunse 37020 ttcid 37044 grpods 43002 oacl2g 44098 omcl2 44101 ofoafg 44122 cnrefiisplem 46584 |
| Copyright terms: Public domain | W3C validator |