| 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 2850 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐸 ∈ 𝐵 ↔ 𝐸 ∈ 𝐶)) |
| 3 | 2 | rspcev 3580 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐸 ∈ 𝐶) → ∃𝑥 ∈ 𝐷 𝐸 ∈ 𝐵) |
| 4 | eliun 4958 | . 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 2147 ∃wrex 3090 ∪ ciun 4954 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-v 3456 df-iun 4956 |
| This theorem is used by: oeordi 8627 fseqdom 10135 cfsmolem 10378 axdc3lem2 10559 prmreclem5 17130 efgs1b 19983 lbsextlem2 21470 pmatcoe1fsupp 23052 vitalilem2 25963 weiunse 37447 ttcid 37471 grpods 43447 oacl2g 44535 omcl2 44538 ofoafg 44559 cnrefiisplem 47054 |
| Copyright terms: Public domain | W3C validator |