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

Theorem iunconstm 3973
Description: Indexed union of a constant class, i.e. where  B does not depend on  x. (Contributed by Jim Kingdon, 15-Aug-2018.)
Assertion
Ref Expression
iunconstm  |-  ( E. x  x  e.  A  ->  U_ x  e.  A  B  =  B )
Distinct variable groups:    x, A    x, B

Proof of Theorem iunconstm
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 eliun 3969 . . 3  |-  ( y  e.  U_ x  e.  A  B  <->  E. x  e.  A  y  e.  B )
2 r19.9rmv 3583 . . 3  |-  ( E. x  x  e.  A  ->  ( y  e.  B  <->  E. x  e.  A  y  e.  B ) )
31, 2bitr4id 199 . 2  |-  ( E. x  x  e.  A  ->  ( y  e.  U_ x  e.  A  B  <->  y  e.  B ) )
43eqrdv 2227 1  |-  ( E. x  x  e.  A  ->  U_ x  e.  A  B  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1395   E.wex 1538    e. wcel 2200   E.wrex 2509   U_ciun 3965
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-ext 2211
This theorem depends on definitions:  df-bi 117  df-tru 1398  df-nf 1507  df-sb 1809  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ral 2513  df-rex 2514  df-v 2801  df-iun 3967
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator