MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  iununi Unicode version

Theorem iununi 3987
Description: A relationship involving union and indexed union. Exercise 25 of [Enderton] p. 33. (Contributed by NM, 25-Nov-2003.) (Proof shortened by Mario Carneiro, 17-Nov-2016.)
Assertion
Ref Expression
iununi  |-  ( ( B  =  (/)  ->  A  =  (/) )  <->  ( A  u.  U. B )  = 
U_ x  e.  B  ( A  u.  x
) )
Distinct variable groups:    x, A    x, B

Proof of Theorem iununi
StepHypRef Expression
1 df-ne 2449 . . . . . . 7  |-  ( B  =/=  (/)  <->  -.  B  =  (/) )
2 iunconst 3914 . . . . . . 7  |-  ( B  =/=  (/)  ->  U_ x  e.  B  A  =  A )
31, 2sylbir 204 . . . . . 6  |-  ( -.  B  =  (/)  ->  U_ x  e.  B  A  =  A )
4 iun0 3959 . . . . . . 7  |-  U_ x  e.  B  (/)  =  (/)
5 id 19 . . . . . . . 8  |-  ( A  =  (/)  ->  A  =  (/) )
65iuneq2d 3931 . . . . . . 7  |-  ( A  =  (/)  ->  U_ x  e.  B  A  =  U_ x  e.  B  (/) )
74, 6, 53eqtr4a 2342 . . . . . 6  |-  ( A  =  (/)  ->  U_ x  e.  B  A  =  A )
83, 7ja 153 . . . . 5  |-  ( ( B  =  (/)  ->  A  =  (/) )  ->  U_ x  e.  B  A  =  A )
98eqcomd 2289 . . . 4  |-  ( ( B  =  (/)  ->  A  =  (/) )  ->  A  =  U_ x  e.  B  A )
109uneq1d 3329 . . 3  |-  ( ( B  =  (/)  ->  A  =  (/) )  ->  ( A  u.  U_ x  e.  B  x )  =  ( U_ x  e.  B  A  u.  U_ x  e.  B  x
) )
11 uniiun 3956 . . . 4  |-  U. B  =  U_ x  e.  B  x
1211uneq2i 3327 . . 3  |-  ( A  u.  U. B )  =  ( A  u.  U_ x  e.  B  x )
13 iunun 3983 . . 3  |-  U_ x  e.  B  ( A  u.  x )  =  (
U_ x  e.  B  A  u.  U_ x  e.  B  x )
1410, 12, 133eqtr4g 2341 . 2  |-  ( ( B  =  (/)  ->  A  =  (/) )  ->  ( A  u.  U. B )  =  U_ x  e.  B  ( A  u.  x ) )
15 unieq 3837 . . . . . . 7  |-  ( B  =  (/)  ->  U. B  =  U. (/) )
16 uni0 3855 . . . . . . 7  |-  U. (/)  =  (/)
1715, 16syl6eq 2332 . . . . . 6  |-  ( B  =  (/)  ->  U. B  =  (/) )
1817uneq2d 3330 . . . . 5  |-  ( B  =  (/)  ->  ( A  u.  U. B )  =  ( A  u.  (/) ) )
19 un0 3480 . . . . 5  |-  ( A  u.  (/) )  =  A
2018, 19syl6eq 2332 . . . 4  |-  ( B  =  (/)  ->  ( A  u.  U. B )  =  A )
21 iuneq1 3919 . . . . 5  |-  ( B  =  (/)  ->  U_ x  e.  B  ( A  u.  x )  =  U_ x  e.  (/)  ( A  u.  x ) )
22 0iun 3960 . . . . 5  |-  U_ x  e.  (/)  ( A  u.  x )  =  (/)
2321, 22syl6eq 2332 . . . 4  |-  ( B  =  (/)  ->  U_ x  e.  B  ( A  u.  x )  =  (/) )
2420, 23eqeq12d 2298 . . 3  |-  ( B  =  (/)  ->  ( ( A  u.  U. B
)  =  U_ x  e.  B  ( A  u.  x )  <->  A  =  (/) ) )
2524biimpcd 215 . 2  |-  ( ( A  u.  U. B
)  =  U_ x  e.  B  ( A  u.  x )  ->  ( B  =  (/)  ->  A  =  (/) ) )
2614, 25impbii 180 1  |-  ( ( B  =  (/)  ->  A  =  (/) )  <->  ( A  u.  U. B )  = 
U_ x  e.  B  ( A  u.  x
) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 176    = wceq 1623    =/= wne 2447    u. cun 3151   (/)c0 3456   U.cuni 3828   U_ciun 3906
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1636  ax-8 1644  ax-6 1704  ax-7 1709  ax-11 1716  ax-12 1868  ax-ext 2265
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1631  df-clab 2271  df-cleq 2277  df-clel 2280  df-nfc 2409  df-ne 2449  df-ral 2549  df-rex 2550  df-v 2791  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3457  df-sn 3647  df-uni 3829  df-iun 3908
  Copyright terms: Public domain W3C validator