![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > inss | Structured version Visualization version GIF version |
Description: Inclusion of an intersection of two classes. (Contributed by NM, 30-Oct-2014.) |
Ref | Expression |
---|---|
inss | ⊢ ((𝐴 ⊆ 𝐶 ∨ 𝐵 ⊆ 𝐶) → (𝐴 ∩ 𝐵) ⊆ 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssinss1 4233 | . 2 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶) | |
2 | incom 4197 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
3 | ssinss1 4233 | . . 3 ⊢ (𝐵 ⊆ 𝐶 → (𝐵 ∩ 𝐴) ⊆ 𝐶) | |
4 | 2, 3 | eqsstrid 4026 | . 2 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶) |
5 | 1, 4 | jaoi 856 | 1 ⊢ ((𝐴 ⊆ 𝐶 ∨ 𝐵 ⊆ 𝐶) → (𝐴 ∩ 𝐵) ⊆ 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 846 ∩ cin 3943 ⊆ wss 3944 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-ext 2698 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-tru 1537 df-ex 1775 df-sb 2061 df-clab 2705 df-cleq 2719 df-clel 2805 df-rab 3428 df-v 3471 df-in 3951 df-ss 3961 |
This theorem is referenced by: pmatcoe1fsupp 22590 ppttop 22897 inindif 32298 disjorimxrn 38157 iunrelexp0 43055 ntrclsk3 43423 icccncfext 45198 |
Copyright terms: Public domain | W3C validator |