Theorem xpintrreld 44425

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

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∩ cin 3907   ⊆ wss 3908   × cxp 5664   ∘ ccom 5670

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-11 2195  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678

This theorem is used by:  restrreld  44426