| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssdisj | GIF version | ||
| Description: Intersection with a subclass of a disjoint class. (Contributed by FL, 24-Jan-2007.) |
| Ref | Expression |
|---|---|
| ssdisj | ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ss0b 3534 | . . . 4 ⊢ ((𝐵 ∩ 𝐶) ⊆ ∅ ↔ (𝐵 ∩ 𝐶) = ∅) | |
| 2 | ssrin 3432 | . . . . 5 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶)) | |
| 3 | sstr2 3234 | . . . . 5 ⊢ ((𝐴 ∩ 𝐶) ⊆ (𝐵 ∩ 𝐶) → ((𝐵 ∩ 𝐶) ⊆ ∅ → (𝐴 ∩ 𝐶) ⊆ ∅)) | |
| 4 | 2, 3 | syl 14 | . . . 4 ⊢ (𝐴 ⊆ 𝐵 → ((𝐵 ∩ 𝐶) ⊆ ∅ → (𝐴 ∩ 𝐶) ⊆ ∅)) |
| 5 | 1, 4 | biimtrrid 153 | . . 3 ⊢ (𝐴 ⊆ 𝐵 → ((𝐵 ∩ 𝐶) = ∅ → (𝐴 ∩ 𝐶) ⊆ ∅)) |
| 6 | 5 | imp 124 | . 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) ⊆ ∅) |
| 7 | ss0 3535 | . 2 ⊢ ((𝐴 ∩ 𝐶) ⊆ ∅ → (𝐴 ∩ 𝐶) = ∅) | |
| 8 | 6, 7 | syl 14 | 1 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (𝐴 ∩ 𝐶) = ∅) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1397 ∩ cin 3199 ⊆ wss 3200 ∅c0 3494 |
| 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 619 ax-in2 620 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-dif 3202 df-in 3206 df-ss 3213 df-nul 3495 |
| This theorem is referenced by: djudisj 5164 fimacnvdisj 5521 unfiin 7117 hashunlem 11066 |
| Copyright terms: Public domain | W3C validator |