![]() |
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 4946 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵)) | |
2 | difss 4146 | . . . 4 ⊢ (𝐴 ∖ 𝐵) ⊆ 𝐴 | |
3 | 2 | unissi 4921 | . . 3 ⊢ ∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 |
4 | 1, 3 | jctil 519 | . 2 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → (∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵))) |
5 | eqss 4011 | . 2 ⊢ (∪ (𝐴 ∖ 𝐵) = ∪ 𝐴 ↔ (∪ (𝐴 ∖ 𝐵) ⊆ ∪ 𝐴 ∧ ∪ 𝐴 ⊆ ∪ (𝐴 ∖ 𝐵))) | |
6 | 4, 5 | sylibr 234 | 1 ⊢ (∀𝑥 ∈ 𝐴 ∃𝑦 ∈ (𝐴 ∖ 𝐵)𝑥 ⊆ 𝑦 → ∪ (𝐴 ∖ 𝐵) = ∪ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∀wral 3059 ∃wrex 3068 ∖ cdif 3960 ⊆ wss 3963 ∪ cuni 4912 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 |
This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1540 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-v 3480 df-dif 3966 df-ss 3980 df-uni 4913 |
This theorem is referenced by: ordunidif 6435 |
Copyright terms: Public domain | W3C validator |