Theorem xpintrreld 44625

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 15113	. . 3 ⊢ ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵)
3	2	a1i 11	. 2 ⊢ (𝜑 → ((𝐴 × 𝐵) ∘ (𝐴 × 𝐵)) ⊆ (𝐴 × 𝐵))
4		xpintrreld.s	. 2 ⊢ (𝜑 → 𝑆 = (𝑅 ∩ (𝐴 × 𝐵)))
5	1, 3, 4	trrelind 44624	1 ⊢ (𝜑 → (𝑆 ∘ 𝑆) ⊆ 𝑆)

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3898   ⊆ wss 3899   × cxp 5649   ∘ ccom 5655

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663

This theorem is used by:  restrreld  44626