Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iunxsn | Structured version Visualization version GIF version |
Description: A singleton index picks out an instance of an indexed union's argument. (Contributed by NM, 26-Mar-2004.) (Proof shortened by Mario Carneiro, 25-Jun-2016.) |
Ref | Expression |
---|---|
iunxsn.1 | ⊢ 𝐴 ∈ V |
iunxsn.2 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
iunxsn | ⊢ ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iunxsn.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | iunxsn.2 | . . 3 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
3 | 2 | iunxsng 5014 | . 2 ⊢ (𝐴 ∈ V → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
4 | 1, 3 | ax-mp 5 | 1 ⊢ ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶 |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 Vcvv 3496 {csn 4569 ∪ ciun 4921 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-rex 3146 df-v 3498 df-sbc 3775 df-sn 4570 df-iun 4923 |
This theorem is referenced by: iunsuc 6275 funopsn 6912 fparlem3 7811 fparlem4 7812 iunfi 8814 kmlem11 9588 ackbij1lem8 9651 dfid6 14389 fsum2dlem 15127 fsumiun 15178 fprod2dlem 15336 prmreclem4 16257 fiuncmp 22014 ovolfiniun 24104 finiunmbl 24147 volfiniun 24150 voliunlem1 24153 iuninc 30314 cvmliftlem10 32543 mrsubvrs 32771 dfrcl4 40028 iunrelexp0 40054 corclrcl 40059 cotrcltrcl 40077 trclfvdecomr 40080 dfrtrcl4 40090 corcltrcl 40091 cotrclrcl 40094 |
Copyright terms: Public domain | W3C validator |