Theorem xrnres2 36529

Description: Two ways to express restriction of range Cartesian product, see also xrnres 36528, xrnres3 36530. (Contributed by Peter Mazsa, 6-Sep-2021.)

Assertion

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

Proof of Theorem xrnres2

Step	Hyp	Ref	Expression
1		resco 6154	. . 3 ⊢ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴))
2	1	ineq2i 4143	. 2 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴)) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴)))
3		df-xrn 36501	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
4	3	reseq1i 5887	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
5		inres 5909	. . 3 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴)) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
6	4, 5	eqtr4i 2769	. 2 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴))
7		df-xrn 36501	. 2 ⊢ (𝑅 ⋉ (𝑆 ↾ 𝐴)) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴)))
8	2, 6, 7	3eqtr4i 2776	1 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))

Syntax hints:   = wceq 1539  Vcvv 3432   ∩ cin 3886   × cxp 5587  ^◡ccnv 5588   ↾ cres 5591   ∘ ccom 5593  1^st c1st 7829  2^nd c2nd 7830   ⋉ cxrn 36332

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-xp 5595  df-rel 5596  df-co 5598  df-res 5601  df-xrn 36501

This theorem is referenced by:  xrnresex  36532  br1cossxrnres  36566