| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > unidif | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| unidif | ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uniss2 4892 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵)) | |
| 2 | difss 4086 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
| 3 | 2 | unissi 4868 | . . 3 ⊢ ∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 |
| 4 | 1, 3 | jctil 519 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → (∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵))) |
| 5 | eqss 3950 | . 2 ⊢ (∪ (𝐴 ∖ 𝐵) = ∪ 𝐴 ↔ (∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵))) | |
| 6 | 4, 5 | sylibr 234 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∀wral 3047 ∃wrex 3056 ∖ cdif 3899 ⊆ wss 3902 ∪ cuni 4859 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1544 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-v 3438 df-dif 3905 df-ss 3919 df-uni 4860 |
| This theorem is referenced by: ordunidif 6356 |
| Copyright terms: Public domain | W3C validator |