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

Theorem iunsn 4995
Description: Indexed union of a singleton. Compare dfiun2 4961 and rnmpt 5899. (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 4923 . 2 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}}
2 velsn 4571 . . . 4 (𝑦 ∈ {𝐵} ↔ 𝑦 = 𝐵)
32rexbii 3086 . . 3 (∃𝑥𝐴 𝑦 ∈ {𝐵} ↔ ∃𝑥𝐴 𝑦 = 𝐵)
43abbii 2806 . 2 {𝑦 ∣ ∃𝑥𝐴 𝑦 ∈ {𝐵}} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
51, 4eqtri 2762 1 𝑥𝐴 {𝐵} = {𝑦 ∣ ∃𝑥𝐴 𝑦 = 𝐵}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1547  wcel 2119  {cab 2717  wrex 3063  {csn 4555   ciun 4921
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-rex 3064  df-v 3433  df-sn 4556  df-iun 4923
This theorem is referenced by:  pzriprnglem11  21466  dfqs3  42723  fsetabsnop  47513
  Copyright terms: Public domain W3C validator