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

Theorem unidif 4880
Description: If the difference 𝐴𝐵 contains the largest members of 𝐴, then the union of the difference is the union of 𝐴. (Contributed by NM, 22-Mar-2004.)
Assertion
Ref Expression
unidif (∀𝑥𝐴𝑦 ∈ (𝐴𝐵)𝑥𝑦 (𝐴𝐵) = 𝐴)
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦

Proof of Theorem unidif
StepHypRef Expression
1 uniss2 4879 . . 3 (∀𝑥𝐴𝑦 ∈ (𝐴𝐵)𝑥𝑦 𝐴 (𝐴𝐵))
2 difss 4073 . . . 4 (𝐴𝐵) ⊆ 𝐴
32unissi 4854 . . 3 (𝐴𝐵) ⊆ 𝐴
41, 3jctil 524 . 2 (∀𝑥𝐴𝑦 ∈ (𝐴𝐵)𝑥𝑦 → ( (𝐴𝐵) ⊆ 𝐴 𝐴 (𝐴𝐵)))
5 eqss 3937 . 2 ( (𝐴𝐵) = 𝐴 ↔ ( (𝐴𝐵) ⊆ 𝐴 𝐴 (𝐴𝐵)))
64, 5sylibr 235 1 (∀𝑥𝐴𝑦 ∈ (𝐴𝐵)𝑥𝑦 (𝐴𝐵) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wral 3054  wrex 3064  cdif 3887  wss 3890   cuni 4845
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712
This theorem depends on definitions:  df-bi 208  df-an 397  df-tru 1550  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-v 3434  df-dif 3893  df-ss 3907  df-uni 4846
This theorem is referenced by:  ordunidif  6367
  Copyright terms: Public domain W3C validator