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

Theorem iunsn 5064
Description: Indexed union of a singleton. Compare dfiun2 5031 and rnmpt 5952. (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 4994 . 2 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}}
2 velsn 4641 . . . 4 (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
32rexbii 3090 . . 3 (∃𝑥𝐴 𝑦 ∈ {𝐵} ↔ ∃𝑥𝐴 𝑦 = 𝐵)
43abbii 2798 . 2 {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
51, 4eqtri 2756 1 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1534  wcel 2099  {cab 2705  wrex 3066  {csn 4625   ciun 4992
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-ext 2699
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1537  df-ex 1775  df-sb 2061  df-clab 2706  df-cleq 2720  df-clel 2806  df-rex 3067  df-v 3472  df-sn 4626  df-iun 4994
This theorem is referenced by:  pzriprnglem11  21411  dfqs3  41720  fsetabsnop  46423
  Copyright terms: Public domain W3C validator