| 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 4960 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵) | |
| 2 | r19.9rzv 4464 | . . 3 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐴 𝑦 ∈ 𝐵)) | |
| 3 | 1, 2 | bitr4id 293 | . 2 ⊢ (𝐴 ≠ ∅ → (𝑦 ∈ ∪ 𝑥 ∈ 𝐴 𝐵 ↔ 𝑦 ∈ 𝐵)) |
| 4 | 3 | eqrdv 2761 | 1 ⊢ (𝐴 ≠ ∅ → ∪ 𝑥 ∈ 𝐴 𝐵 = 𝐵) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∃wrex 3090 ∅c0 4281 ∪ ciun 4956 |
| 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-fal 1583 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ne 2960 df-ral 3081 df-rex 3091 df-v 3456 df-dif 4050 df-nul 4282 df-iun 4958 |
| This theorem is used by: iununi 5064 oe1m 8591 oarec 8608 oelim2 8642 scottrankd 9986 bnj1143 35531 poimirlem32 38838 mblfinlem2 38844 hoicvr 47831 ovnlecvr2 47893 iunhoiioo 47959 |
| Copyright terms: Public domain | W3C validator |