Theorem trrelind 44424

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 15029	. . 3 ⊢ (𝜑 → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ 𝑅)
5		trrelind.s	. . . 4 ⊢ (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)
6		inss2 4190	. . . . 5 ⊢ (𝑅 ∩ 𝑆) ⊆ 𝑆
7	6	a1i 11	. . . 4 ⊢ (𝜑 → (𝑅 ∩ 𝑆) ⊆ 𝑆)
8	5, 7, 7	trrelssd 15029	. . 3 ⊢ (𝜑 → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ 𝑆)
9	4, 8	ssind 4193	. 2 ⊢ (𝜑 → ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)) ⊆ (𝑅 ∩ 𝑆))
10		trrelind.t	. . 3 ⊢ (𝜑 → 𝑇 = (𝑅 ∩ 𝑆))
11	10, 10	coeq12d 5852	. 2 ⊢ (𝜑 → (𝑇 ∘ 𝑇) = ((𝑅 ∩ 𝑆) ∘ (𝑅 ∩ 𝑆)))
12	9, 11, 10	3sstr4d 3993	1 ⊢ (𝜑 → (𝑇 ∘ 𝑇) ⊆ 𝑇)

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

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 2148  ax-9 2156  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-rab 3419  df-v 3459  df-in 3913  df-ss 3923  df-br 5112  df-opab 5176  df-co 5672

This theorem is used by:  xpintrreld  44425