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

Theorem unidif 3982
Description: If the difference  A  \  B contains the largest members of  A, then the union of the difference is the union of  A. (Contributed by NM, 22-Mar-2004.)
Assertion
Ref Expression
unidif  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) x  C_  y  ->  U. ( A  \  B )  =  U. A )
Distinct variable groups:    x, y, A    x, B, y

Proof of Theorem unidif
StepHypRef Expression
1 uniss2 3981 . . 3  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) x  C_  y  ->  U. A  C_  U. ( A  \  B ) )
2 difss 3410 . . . 4  |-  ( A 
\  B )  C_  A
32unissi 3973 . . 3  |-  U. ( A  \  B )  C_  U. A
41, 3jctil 524 . 2  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) x  C_  y  ->  ( U. ( A  \  B )  C_  U. A  /\  U. A  C_ 
U. ( A  \  B ) ) )
5 eqss 3299 . 2  |-  ( U. ( A  \  B )  =  U. A  <->  ( U. ( A  \  B ) 
C_  U. A  /\  U. A  C_  U. ( A 
\  B ) ) )
64, 5sylibr 204 1  |-  ( A. x  e.  A  E. y  e.  ( A  \  B ) x  C_  y  ->  U. ( A  \  B )  =  U. A )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 359    = wceq 1649   A.wral 2642   E.wrex 2643    \ cdif 3253    C_ wss 3256   U.cuni 3950
This theorem is referenced by:  ordunidif  4563
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1661  ax-8 1682  ax-6 1736  ax-7 1741  ax-11 1753  ax-12 1939  ax-ext 2361
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-clab 2367  df-cleq 2373  df-clel 2376  df-nfc 2505  df-ral 2647  df-rex 2648  df-v 2894  df-dif 3259  df-in 3263  df-ss 3270  df-uni 3951
  Copyright terms: Public domain W3C validator