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

Theorem iunsn 5024
Description: Indexed union of a singleton. Compare dfiun2 4990 and rnmpt 5941. (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 4953 . 2 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}}
2 velsn 4600 . . . 4 (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
32rexbii 3109 . . 3 (∃𝑥𝐴 𝑦 ∈ {𝐵} ↔ ∃𝑥𝐴 𝑦 = 𝐵)
43abbii 2827 . 2 {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
51, 4eqtri 2783 1 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  wcel 2145  {cab 2738  wrex 3086  {csn 4584   ciun 4951
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2732
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-rex 3087  df-v 3452  df-sn 4585  df-iun 4953
This theorem is used by:  pzriprnglem11  21704  dfqs3  43106  fsetabsnop  47938
  Copyright terms: Public domain W3C validator