ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uniexd Unicode version

Theorem uniexd 4403
Description: Deduction version of the ZF Axiom of Union in class notation. (Contributed by Glauco Siliprandi, 26-Jun-2021.)
Hypothesis
Ref Expression
uniexd.1  |-  ( ph  ->  A  e.  V )
Assertion
Ref Expression
uniexd  |-  ( ph  ->  U. A  e.  _V )

Proof of Theorem uniexd
StepHypRef Expression
1 uniexd.1 . 2  |-  ( ph  ->  A  e.  V )
2 uniexg 4402 . 2  |-  ( A  e.  V  ->  U. A  e.  _V )
31, 2syl 14 1  |-  ( ph  ->  U. A  e.  _V )
Colors of variables: wff set class
Syntax hints:    -> wi 4    e. wcel 2128   _Vcvv 2712   U.cuni 3774
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-sep 4085  ax-un 4396
This theorem depends on definitions:  df-bi 116  df-tru 1338  df-nf 1441  df-sb 1743  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-rex 2441  df-v 2714  df-uni 3775
This theorem is referenced by:  supex2g  6980
  Copyright terms: Public domain W3C validator