Theorem xrnres 39175

Description: Two ways to express restriction of range Cartesian product, see also xrnres2 39176, xrnres3 39177. (Contributed by Peter Mazsa, 5-Jun-2021.)

Assertion

Ref	Expression
xrnres	⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ((𝑅 ↾ 𝐴) ⋉ 𝑆)

Proof of Theorem xrnres

Step	Hyp	Ref	Expression
1		resco 6250	. . 3 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) = (◡(1st ↾ (V × V)) ∘ (𝑅 ↾ 𝐴))
2	1	ineq1i 4165	. 2 ⊢ (((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ↾ 𝐴)) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
3		df-xrn 39130	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
4	3	reseq1i 5972	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
5		inres2 38997	. . 3 ⊢ (((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
6	4, 5	eqtr4i 2788	. 2 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
7		df-xrn 39130	. 2 ⊢ ((𝑅 ↾ 𝐴) ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ↾ 𝐴)) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
8	2, 6, 7	3eqtr4i 2795	1 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ((𝑅 ↾ 𝐴) ⋉ 𝑆)

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3453   ∩ cin 3901   × cxp 5657  ^◡ccnv 5658   ↾ cres 5661   ∘ ccom 5663  1^st c1st 7987  2^nd c2nd 7988   ⋉ cxrn 38924

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 2734  ax-sep 5255  ax-pr 5402

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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-co 5668  df-res 5671  df-xrn 39130

This theorem is used by:  dmxrncnvepres  39182