Theorem sylan9ss 3958

Description: A subclass transitivity deduction. (Contributed by NM, 27-Sep-2004.) (Proof shortened by Andrew Salmon, 14-Jun-2011.)

Hypotheses

Ref	Expression
sylan9ss.1	⊢ (𝜑 → 𝐴 ⊆ 𝐵)
sylan9ss.2	⊢ (𝜓 → 𝐵 ⊆ 𝐶)

Assertion

Ref	Expression
sylan9ss	⊢ ((𝜑 ∧ 𝜓) → 𝐴 ⊆ 𝐶)

Proof of Theorem sylan9ss

Step	Hyp	Ref	Expression
1		sylan9ss.1	. 2 ⊢ (𝜑 → 𝐴 ⊆ 𝐵)
2		sylan9ss.2	. 2 ⊢ (𝜓 → 𝐵 ⊆ 𝐶)
3		sstr 3953	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐶) → 𝐴 ⊆ 𝐶)
4	1, 2, 3	syl2an 607	1 ⊢ ((𝜑 ∧ 𝜓) → 𝐴 ⊆ 𝐶)

Syntax hints:   → wi 4   ∧ wa 400   ⊆ wss 3913

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836

This theorem depends on definitions:  df-bi 210  df-an 401  df-ss 3930

This theorem is referenced by:  sylan9ssr  3959  psstr  4070  unss12  4149  ss2in  4205  ssdisj  4423  relrelss  6271  funssxp  6732  axdc3lem  10430  tskuni  10764  rtrclreclem4  15094  tsmsxp  24277  shslubi  31674  chlej12i  31764  insiga  34468  fnetr  36747  pcl0bN  40582  brtrclfv2  44338