| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iunxsngf | 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.) (Revised by Thierry Arnoux, 2-May-2020.) Avoid ax-13 2407. (Revised by GG, 19-May-2023.) |
| Ref | Expression |
|---|---|
| iunxsngf.1 | ⊢ Ⅎ𝑥𝐶 |
| iunxsngf.2 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| iunxsngf | ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eliun 4959 | . . 3 ⊢ (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ ∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵) | |
| 2 | iunxsngf.1 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
| 3 | 2 | nfcri 2921 | . . . 4 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐶 |
| 4 | iunxsngf.2 | . . . . 5 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 5 | 4 | eleq2d 2853 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 6 | 3, 5 | rexsngf 4633 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∃𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 7 | 1, 6 | bitrid 286 | . 2 ⊢ (𝐴 ∈ 𝑉 → (𝑦 ∈ ∪ 𝑥 ∈ {𝐴}𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 8 | 7 | eqrdv 2764 | 1 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1572 ∈ wcel 2150 Ⅎwnfc 2914 ∃wrex 3093 {csn 4587 ∪ ciun 4955 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-12 2219 ax-ext 2738 |
| This proof depends on definitions: df-bi 210 df-an 402 df-3an 1106 df-tru 1575 df-ex 1815 df-nf 1819 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-rex 3094 df-v 3455 df-sbc 3742 df-sn 4588 df-iun 4957 |
| This theorem is used by: esum2dlem 34836 fiunelros 34919 iunxsnf 46415 |
| Copyright terms: Public domain | W3C validator |