![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > undifss | GIF version |
Description: Union of complementary parts into whole. (Contributed by Jim Kingdon, 4-Aug-2018.) |
Ref | Expression |
---|---|
undifss | ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) ⊆ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | difss 3276 | . . . 4 ⊢ (𝐵 ∖ 𝐴) ⊆ 𝐵 | |
2 | 1 | jctr 315 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ 𝐵 ∧ (𝐵 ∖ 𝐴) ⊆ 𝐵)) |
3 | unss 3324 | . . 3 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∖ 𝐴) ⊆ 𝐵) ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) ⊆ 𝐵) | |
4 | 2, 3 | sylib 122 | . 2 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∪ (𝐵 ∖ 𝐴)) ⊆ 𝐵) |
5 | ssun1 3313 | . . 3 ⊢ 𝐴 ⊆ (𝐴 ∪ (𝐵 ∖ 𝐴)) | |
6 | sstr 3178 | . . 3 ⊢ ((𝐴 ⊆ (𝐴 ∪ (𝐵 ∖ 𝐴)) ∧ (𝐴 ∪ (𝐵 ∖ 𝐴)) ⊆ 𝐵) → 𝐴 ⊆ 𝐵) | |
7 | 5, 6 | mpan 424 | . 2 ⊢ ((𝐴 ∪ (𝐵 ∖ 𝐴)) ⊆ 𝐵 → 𝐴 ⊆ 𝐵) |
8 | 4, 7 | impbii 126 | 1 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∪ (𝐵 ∖ 𝐴)) ⊆ 𝐵) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 ∖ cdif 3141 ∪ cun 3142 ⊆ wss 3144 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-ext 2171 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-v 2754 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 |
This theorem is referenced by: difsnss 3756 exmidundif 4227 exmidundifim 4228 undifdcss 6955 |
Copyright terms: Public domain | W3C validator |