![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > iunidOLD | Structured version Visualization version GIF version |
Description: Obsolete version of iunid 5083 as of 15-Jan-2025. (Contributed by NM, 6-Sep-2005.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
iunidOLD | ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sn 4649 | . . . . 5 ⊢ {𝑥} = {𝑦 ∣ 𝑦 = 𝑥} | |
2 | equcom 2017 | . . . . . 6 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦) | |
3 | 2 | abbii 2812 | . . . . 5 ⊢ {𝑦 ∣ 𝑦 = 𝑥} = {𝑦 ∣ 𝑥 = 𝑦} |
4 | 1, 3 | eqtri 2768 | . . . 4 ⊢ {𝑥} = {𝑦 ∣ 𝑥 = 𝑦} |
5 | 4 | a1i 11 | . . 3 ⊢ (𝑥 ∈ 𝐴 → {𝑥} = {𝑦 ∣ 𝑥 = 𝑦}) |
6 | 5 | iuneq2i 5036 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝑥 = 𝑦} |
7 | iunab 5074 | . . 3 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝑥 = 𝑦} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦} | |
8 | risset 3239 | . . . 4 ⊢ (𝑦 ∈ 𝐴 ↔ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦) | |
9 | 8 | abbii 2812 | . . 3 ⊢ {𝑦 ∣ 𝑦 ∈ 𝐴} = {𝑦 ∣ ∃𝑥 ∈ 𝐴 𝑥 = 𝑦} |
10 | abid2 2882 | . . 3 ⊢ {𝑦 ∣ 𝑦 ∈ 𝐴} = 𝐴 | |
11 | 7, 9, 10 | 3eqtr2i 2774 | . 2 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑦 ∣ 𝑥 = 𝑦} = 𝐴 |
12 | 6, 11 | eqtri 2768 | 1 ⊢ ∪ 𝑥 ∈ 𝐴 {𝑥} = 𝐴 |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1537 ∈ wcel 2108 {cab 2717 ∃wrex 3076 {csn 4648 ∪ ciun 5015 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-tru 1540 df-ex 1778 df-nf 1782 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ral 3068 df-rex 3077 df-v 3490 df-ss 3993 df-sn 4649 df-iun 5017 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |