Theorem trrelind 44419

Description: The intersection of transitive relations is a transitive relation. (Contributed by RP, 24-Dec-2019.)

Hypotheses

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

Assertion

Ref	Expression
trrelind	⊢ (𝜑 → (𝑇 ∘ 𝑇) ⊆ 𝑇)

Proof of Theorem trrelind

Step	Hyp	Ref	Expression
1		trrelind.r	. . . 4 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
2		inss1 4189	. . . . 5 ⊢ (𝑅 ∩ 𝑆) ⊆ 𝑅
3	2	a1i 11	. . . 4 ⊢ (𝜑 → (𝑅 ∩ 𝑆) ⊆ 𝑅)
4	1, 3, 3	trrelssd 15015	. . 3 ⊢ (𝜑 → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ 𝑅)
5		trrelind.s	. . . 4 ⊢ (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)
6		inss2 4190	. . . . 5 ⊢ (𝑅 ∩ 𝑆) ⊆ 𝑆
7	6	a1i 11	. . . 4 ⊢ (𝜑 → (𝑅 ∩ 𝑆) ⊆ 𝑆)
8	5, 7, 7	trrelssd 15015	. . 3 ⊢ (𝜑 → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ 𝑆)
9	4, 8	ssind 4193	. 2 ⊢ (𝜑 → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆))
10		trrelind.t	. . 3 ⊢ (𝜑 → 𝑇 = (𝑅 ∩ 𝑆))
11	10, 10	coeq12d 5850	. 2 ⊢ (𝜑 → (𝑇 ∘ 𝑇) = ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)))
12	9, 11, 10	3sstr4d 3992	1 ⊢ (𝜑 → (𝑇 ∘ 𝑇) ⊆ 𝑇)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3904   ⊆ wss 3905   ∘ ccom 5665

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 401  df-tru 1573  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-rab 3417  df-v 3457  df-in 3912  df-ss 3922  df-br 5110  df-opab 5174  df-co 5670

This theorem is used by:  xpintrreld  44420