| 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 4198 | . 2 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶) | |
| 2 | incom 4162 | . . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
| 3 | ssinss1 4198 | . . 3 ⊢ (𝐵 ⊆ 𝐶 → (𝐵 ∩ 𝐴) ⊆ 𝐶) | |
| 4 | 2, 3 | eqsstrid 3976 | . 2 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶) |
| 5 | 1, 4 | jaoi 871 | 1 ⊢ ((𝐴 ⊆ 𝐶 ∨ 𝐵 ⊆ 𝐶) → (𝐴 ∩ 𝐵) ⊆ 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∨ wo 861 ∩ cin 3905 ⊆ wss 3906 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-rab 3419 df-v 3459 df-in 3913 df-ss 3923 |
| This theorem is used by: pmatcoe1fsupp 22908 ppttop 23214 disjorimxrn 39555 iunrelexp0 44486 ntrclsk3 44854 icccncfext 46659 |
| Copyright terms: Public domain | W3C validator |