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 43461
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 3956 . 2 𝐴𝐴
2 unielss 43460 . 2 (𝐴𝐴 → ( 𝐴𝐴 ↔ ∃𝑥𝐴𝑦𝐴 𝑦𝑥))
31, 2ax-mp 5 1 ( 𝐴𝐴 ↔ ∃𝑥𝐴𝑦𝐴 𝑦𝑥)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wcel 2113  wral 3051  wrex 3060  wss 3901   cuni 4863
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-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1544  df-ex 1781  df-nf 1785  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-ss 3918  df-uni 4864
This theorem is referenced by:  onsupnmax  43470  onsupeqmax  43488  onsupeqnmax  43489
  Copyright terms: Public domain W3C validator