Theorem trrelssd 14333

Description: The composition of subclasses of a transitive relation is a subclass of that relation. (Contributed by RP, 24-Dec-2019.)

Hypotheses

Ref	Expression
trrelssd.r	⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
trrelssd.s	⊢ (𝜑 → 𝑆 ⊆ 𝑅)
trrelssd.t	⊢ (𝜑 → 𝑇 ⊆ 𝑅)

Assertion

Ref	Expression
trrelssd	⊢ (𝜑 → (𝑆 ∘ 𝑇) ⊆ 𝑅)

Proof of Theorem trrelssd

Step	Hyp	Ref	Expression
1		trrelssd.s	. . 3 ⊢ (𝜑 → 𝑆 ⊆ 𝑅)
2		trrelssd.t	. . 3 ⊢ (𝜑 → 𝑇 ⊆ 𝑅)
3	1, 2	coss12d 14332	. 2 ⊢ (𝜑 → (𝑆 ∘ 𝑇) ⊆ (𝑅 ∘ 𝑅))
4		trrelssd.r	. 2 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
5	3, 4	sstrd 3977	1 ⊢ (𝜑 → (𝑆 ∘ 𝑇) ⊆ 𝑅)

Syntax hints:   → wi 4   ⊆ wss 3936   ∘ ccom 5559

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-in 3943  df-ss 3952  df-br 5067  df-opab 5129  df-co 5564

This theorem is referenced by:  trclfvlb2  14370  trrelind  40030  iunrelexpmin1  40073  iunrelexpmin2  40077