| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunconst | Structured version Visualization version GIF version | ||
| Description: Indexed union of a constant class, i.e. where 𝐵 does not depend on 𝑥. (Contributed by NM, 5-Sep-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.) |
| Ref | Expression |
|---|---|
| iunconst | ⊢ (𝐴 ≠ ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eliun 4954 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 2 | r19.9rzv 4460 | . . 3 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 3 | 1, 2 | bitr4id 293 | . 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑦 ∈ 𝐵)) |
| 4 | 3 | eqrdv 2758 | 1 ⊢ (𝐴 ≠ ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 ∅c0 4278 ∪ 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-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ne 2956 df-ral 3077 df-rex 3087 df-v 3452 df-dif 4047 df-nul 4279 df-iun 4952 |
| This theorem is used by: iununi 5058 oe1m 8557 oarec 8574 oelim2 8608 scottrankd 9953 bnj1143 35467 poimirlem32 38664 mblfinlem2 38670 hoicvr 47652 ovnlecvr2 47714 iunhoiioo 47780 |
| Copyright terms: Public domain | W3C validator |