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

Theorem iunconstm 3686
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 r19.9rmv 3333 . . 3  |-  ( E. x  x  e.  A  ->  ( y  e.  B  <->  E. x  e.  A  y  e.  B ) )
2 eliun 3682 . . 3  |-  ( y  e.  U_ x  e.  A  B  <->  E. x  e.  A  y  e.  B )
31, 2syl6rbbr 197 . 2  |-  ( E. x  x  e.  A  ->  ( y  e.  U_ x  e.  A  B  <->  y  e.  B ) )
43eqrdv 2079 1  |-  ( E. x  x  e.  A  ->  U_ x  e.  A  B  =  B )
Colors of variables: wff set class
Syntax hints:    -> wi 4    = wceq 1284   E.wex 1421    e. wcel 1433   E.wrex 2349   U_ciun 3678
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-v 2603  df-iun 3680
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator