Theorem xpintrreld 41163

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

Hypotheses

Ref	Expression
xpintrreld.r	⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
xpintrreld.s	⊢ (𝜑 → 𝑆 = (𝑅 ∩ (𝐴 × 𝐵)))

Assertion

Ref	Expression
xpintrreld	⊢ (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)

Proof of Theorem xpintrreld

Step	Hyp	Ref	Expression
1		xpintrreld.r	. 2 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
2		xptrrel 14619	. . 3 ⊢ ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)
3	2	a1i 11	. 2 ⊢ (𝜑 → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵))
4		xpintrreld.s	. 2 ⊢ (𝜑 → 𝑆 = (𝑅 ∩ (𝐴 × 𝐵)))
5	1, 3, 4	trrelind 41162	1 ⊢ (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)

Syntax hints:   → wi 4   = wceq 1539   ∩ cin 3882   ⊆ wss 3883   × cxp 5578   ∘ ccom 5584

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592

This theorem is referenced by:  restrreld  41164