Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unielid Structured version   Visualization version   GIF version

Theorem unielid 43837
Description: Two ways to say the union of a class is an element of that class. (Contributed by RP, 27-Jan-2025.)
Assertion
Ref Expression
unielid ( 𝐴𝐴 ↔ ∃𝑥𝐴𝑦𝐴 𝑦𝑥)
Distinct variable group:   𝑥,𝐴,𝑦

Proof of Theorem unielid
StepHypRef Expression
1 ssid 3967 . 2 𝐴𝐴
2 unielss 43836 . 2 (𝐴𝐴 → ( 𝐴𝐴 ↔ ∃𝑥𝐴𝑦𝐴 𝑦𝑥))
31, 2ax-mp 5 1 ( 𝐴𝐴 ↔ ∃𝑥𝐴𝑦𝐴 𝑦𝑥)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wcel 2149  wral 3085  wrex 3095  wss 3913   cuni 4876
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-tru 1570  df-ex 1807  df-nf 1811  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-ss 3930  df-uni 4877
This theorem is referenced by:  onsupnmax  43846  onsupeqmax  43864  onsupeqnmax  43865
  Copyright terms: Public domain W3C validator