| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > eliund | Structured version Visualization version GIF version | ||
| Description: Membership in indexed union. (Contributed by Glauco Siliprandi, 15-Feb-2025.) |
| Ref | Expression |
|---|---|
| eliund.1 | ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝐶) |
| Ref | Expression |
|---|---|
| eliund | ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eliund.1 | . 2 ⊢ (𝜑 → ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝐶) | |
| 2 | eliun 4954 | . 2 ⊢ (𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝐴 ∈ 𝐶) | |
| 3 | 1, 2 | sylibr 237 | 1 ⊢ (𝜑 → 𝐴 ∈ ∪ 𝑥 ∈ 𝐵 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∈ 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-rex 3087 df-v 3452 df-iun 4952 |
| This theorem is used by: ac6c4 10562 bdayiun 28306 gsumwrd2dccatlem 33684 hoicvr 47651 imaid 50363 |
| Copyright terms: Public domain | W3C validator |