Theorem inss 4038

Description: Inclusion of an intersection of two classes. (Contributed by NM, 30-Oct-2014.)

Assertion

Ref	Expression
inss	⊢ ((𝐴 ⊆ 𝐶 ∨ 𝐵 ⊆ 𝐶) → (𝐴 ∩ 𝐵) ⊆ 𝐶)

Proof of Theorem inss

Step	Hyp	Ref	Expression
1		ssinss1 4037	. 2 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶)
2		incom 4003	. . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
3		ssinss1 4037	. . 3 ⊢ (𝐵 ⊆ 𝐶 → (𝐵 ∩ 𝐴) ⊆ 𝐶)
4	2, 3	syl5eqss 3845	. 2 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶)
5	1, 4	jaoi 884	1 ⊢ ((𝐴 ⊆ 𝐶 ∨ 𝐵 ⊆ 𝐶) → (𝐴 ∩ 𝐵) ⊆ 𝐶)

Syntax hints:   → wi 4   ∨ wo 874   ∩ cin 3768   ⊆ wss 3769

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-ext 2777

This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2786  df-cleq 2792  df-clel 2795  df-nfc 2930  df-v 3387  df-in 3776  df-ss 3783

This theorem is referenced by:  pmatcoe1fsupp  20834  ppttop  21140  inindif  29871  iunrelexp0  38777  ntrclsk3  39150  icccncfext  40844