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

Theorem unidif 4903
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 4902 . . 3 (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵))
2 difss 4083 . . . 4 (𝐴 ∖ 𝐵) ⊆ 𝐴
32unissi 4876 . . 3 ∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴
41, 3jctil 529 . 2 (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → (∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵)))
5 eqss 3946 . 2 (∪ (𝐴 ∖ 𝐵) = ∪ 𝐴 ↔ (∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵)))
64, 5sylibr 237 1 (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∀wral 3077  ∃wrex 3087   ∖ cdif 3896   ⊆ wss 3899  ∪ cuni 4867
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-v 3453  df-dif 3902  df-ss 3916  df-uni 4868
This theorem is used by:  ordunidif  6406
  Copyright terms: Public domain W3C validator