Theorem inss 3367

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 3366	. 2 ⊢ (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶)
2		incom 3329	. . 3 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
3		ssinss1 3366	. . 3 ⊢ (𝐵 ⊆ 𝐶 → (𝐵 ∩ 𝐴) ⊆ 𝐶)
4	2, 3	eqsstrid 3203	. 2 ⊢ (𝐵 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶)
5	1, 4	jaoi 716	1 ⊢ ((𝐴 ⊆ 𝐶 ∨ 𝐵 ⊆ 𝐶) → (𝐴 ∩ 𝐵) ⊆ 𝐶)

Syntax hints:   → wi 4   ∨ wo 708   ∩ cin 3130   ⊆ wss 3131

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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-ext 2159

This theorem depends on definitions:  df-bi 117  df-tru 1356  df-nf 1461  df-sb 1763  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-v 2741  df-in 3137  df-ss 3144

This theorem is referenced by: (None)