![]() |
Mathbox for ML |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > inunissunidif | Structured version Visualization version GIF version |
Description: Theorem about subsets of the difference of unions. (Contributed by ML, 29-Mar-2021.) |
Ref | Expression |
---|---|
inunissunidif | ⊢ ((𝐴 ∩ ∪ 𝐶) = ∅ → (𝐴 ⊆ ∪ 𝐵 ↔ 𝐴 ⊆ ∪ (𝐵 ∖ 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | reldisj 4359 | . . . 4 ⊢ (𝐴 ⊆ ∪ 𝐵 → ((𝐴 ∩ ∪ 𝐶) = ∅ ↔ 𝐴 ⊆ (∪ 𝐵 ∖ ∪ 𝐶))) | |
2 | difunieq 34791 | . . . . 5 ⊢ (∪ 𝐵 ∖ ∪ 𝐶) ⊆ ∪ (𝐵 ∖ 𝐶) | |
3 | sstr 3923 | . . . . 5 ⊢ ((𝐴 ⊆ (∪ 𝐵 ∖ ∪ 𝐶) ∧ (∪ 𝐵 ∖ ∪ 𝐶) ⊆ ∪ (𝐵 ∖ 𝐶)) → 𝐴 ⊆ ∪ (𝐵 ∖ 𝐶)) | |
4 | 2, 3 | mpan2 690 | . . . 4 ⊢ (𝐴 ⊆ (∪ 𝐵 ∖ ∪ 𝐶) → 𝐴 ⊆ ∪ (𝐵 ∖ 𝐶)) |
5 | 1, 4 | syl6bi 256 | . . 3 ⊢ (𝐴 ⊆ ∪ 𝐵 → ((𝐴 ∩ ∪ 𝐶) = ∅ → 𝐴 ⊆ ∪ (𝐵 ∖ 𝐶))) |
6 | 5 | com12 32 | . 2 ⊢ ((𝐴 ∩ ∪ 𝐶) = ∅ → (𝐴 ⊆ ∪ 𝐵 → 𝐴 ⊆ ∪ (𝐵 ∖ 𝐶))) |
7 | difss 4059 | . . . 4 ⊢ (𝐵 ∖ 𝐶) ⊆ 𝐵 | |
8 | 7 | unissi 4809 | . . 3 ⊢ ∪ (𝐵 ∖ 𝐶) ⊆ ∪ 𝐵 |
9 | sstr 3923 | . . 3 ⊢ ((𝐴 ⊆ ∪ (𝐵 ∖ 𝐶) ∧ ∪ (𝐵 ∖ 𝐶) ⊆ ∪ 𝐵) → 𝐴 ⊆ ∪ 𝐵) | |
10 | 8, 9 | mpan2 690 | . 2 ⊢ (𝐴 ⊆ ∪ (𝐵 ∖ 𝐶) → 𝐴 ⊆ ∪ 𝐵) |
11 | 6, 10 | impbid1 228 | 1 ⊢ ((𝐴 ∩ ∪ 𝐶) = ∅ → (𝐴 ⊆ ∪ 𝐵 ↔ 𝐴 ⊆ ∪ (𝐵 ∖ 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 = wceq 1538 ∖ cdif 3878 ∩ cin 3880 ⊆ wss 3881 ∅c0 4243 ∪ cuni 4800 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-ral 3111 df-v 3443 df-dif 3884 df-in 3888 df-ss 3898 df-nul 4244 df-uni 4801 |
This theorem is referenced by: pibt2 34834 |
Copyright terms: Public domain | W3C validator |