Theorem sylan9ssr 3287

Description: A subclass transitivity deduction. (Contributed by NM, 27-Sep-2004.)

Hypotheses

Ref	Expression
sylan9ssr.1	⊢ (φ → A ⊆ B)
sylan9ssr.2	⊢ (ψ → B ⊆ C)

Assertion

Ref	Expression
sylan9ssr	⊢ ((ψ ∧ φ) → A ⊆ C)

Proof of Theorem sylan9ssr

Step	Hyp	Ref	Expression
1		sylan9ssr.1	. . 3 ⊢ (φ → A ⊆ B)
2		sylan9ssr.2	. . 3 ⊢ (ψ → B ⊆ C)
3	1, 2	sylan9ss 3286	. 2 ⊢ ((φ ∧ ψ) → A ⊆ C)
4	3	ancoms 439	1 ⊢ ((ψ ∧ φ) → A ⊆ C)

Syntax hints:   → wi 4   ∧ wa 358   ⊆ wss 3258

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-v 2862  df-nin 3212  df-compl 3213  df-in 3214  df-ss 3260

This theorem is referenced by:  intssuni2  3952