| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunxsng | Structured version Visualization version GIF version | ||
| Description: A singleton index picks out an instance of an indexed union's argument. (Contributed by Mario Carneiro, 25-Jun-2016.) |
| Ref | Expression |
|---|---|
| iunxsng.1 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| iunxsng | ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eliun 4954 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ ∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵) | |
| 2 | iunxsng.1 | . . . . 5 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 3 | 2 | eleq2d 2849 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 4 | 3 | rexsng 4636 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 5 | 1, 4 | bitrid 285 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 6 | 5 | eqrdv 2761 | 1 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1561 ∈ wcel 2143 ∃wrex 3087 {csn 4583 ∪ ciun 4950 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-ext 2735 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1564 df-ex 1801 df-sb 2092 df-clab 2742 df-cleq 2755 df-clel 2838 df-ral 3078 df-rex 3088 df-v 3457 df-sn 4584 df-iun 4952 |
| This theorem is referenced by: iunxsn 5049 iunxprg 5054 iunxunsn 32772 ttcsng 36884 disjiun2 45629 carageniuncllem1 47086 caratheodorylem1 47091 |
| Copyright terms: Public domain | W3C validator |