| 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 2846 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ 𝐵 ↔ 𝐸 ∈ 𝐶)) |
| 3 | 2 | rspcev 3576 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) |
| 4 | eliun 4954 | . 2 ⊢ (𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵 ↔ ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) | |
| 5 | 3, 4 | sylibr 237 | 1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → 𝐸 ∈ ∪ 𝑥 ∈ 𝐷 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 ∪ ciun 4950 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1572 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-v 3452 df-iun 4952 |
| This theorem is used by: oeordi 8599 fseqdom 10108 cfsmolem 10351 axdc3lem2 10532 prmreclem5 17103 efgs1b 19955 lbsextlem2 21442 pmatcoe1fsupp 23024 vitalilem2 25935 weiunse 37348 ttcid 37372 grpods 43337 oacl2g 44425 omcl2 44428 ofoafg 44449 cnrefiisplem 46932 |
| Copyright terms: Public domain | W3C validator |