MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  ssinss1OLD Structured version   Visualization version   GIF version

Theorem ssinss1OLD 4192
Description: Obsolete version of ssinss1 4191 as of 10-Jun-2026. (Contributed by NM, 14-Sep-1999.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
ssinss1OLD (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶)

Proof of Theorem ssinss1OLD
StepHypRef Expression
1 inss1 4182 . 2 (𝐴 ∩ 𝐵) ⊆ 𝐴
2 sstr2 3938 . 2 ((𝐴 ∩ 𝐵) ⊆ 𝐴 → (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶))
31, 2ax-mp 5 1 (𝐴 ⊆ 𝐶 → (𝐴 ∩ 𝐵) ⊆ 𝐶)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∩ cin 3898   ⊆ wss 3899
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 2147  ax-9 2155  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-v 3453  df-in 3906  df-ss 3916
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator