MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iunsn Structured version   Visualization version   GIF version

Theorem iunsn 5021
Description: Indexed union of a singleton. Compare dfiun2 4987 and rnmpt 5906. (Contributed by Steven Nguyen, 7-Jun-2023.)
Assertion
Ref Expression
iunsn 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑦,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem iunsn
StepHypRef Expression
1 df-iun 4948 . 2 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}}
2 velsn 4596 . . . 4 (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
32rexbii 3083 . . 3 (∃𝑥𝐴 𝑦 ∈ {𝐵} ↔ ∃𝑥𝐴 𝑦 = 𝐵)
43abbii 2803 . 2 {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
51, 4eqtri 2759 1 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wcel 2113  {cab 2714  wrex 3060  {csn 4580   ciun 4946
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-rex 3061  df-v 3442  df-sn 4581  df-iun 4948
This theorem is referenced by:  pzriprnglem11  21446  dfqs3  42494  fsetabsnop  47296
  Copyright terms: Public domain W3C validator