Theorem xrnres2 39175

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

Assertion

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

Proof of Theorem xrnres2

Step	Hyp	Ref	Expression
1		resco 6246	. . 3 ⊢ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴))
2	1	ineq2i 4163	. 2 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴)) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴)))
3		df-xrn 39129	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
4	3	reseq1i 5968	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
5		inres 5990	. . 3 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴)) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
6	4, 5	eqtr4i 2786	. 2 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴))
7		df-xrn 39129	. 2 ⊢ (𝑅 ⋉ (𝑆 ↾ 𝐴)) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴)))
8	2, 6, 7	3eqtr4i 2793	1 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))

This proof depends on syntax axioms:   = wceq 1570  Vcvv 3450   ∩ cin 3898   × cxp 5653  ^◡ccnv 5654   ↾ cres 5657   ∘ ccom 5659  1^st c1st 7985  2^nd c2nd 7986   ⋉ cxrn 38923

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 2732  ax-sep 5251  ax-pr 5398

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 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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 5661  df-rel 5662  df-co 5664  df-res 5667  df-xrn 39129

This theorem is used by:  xrnresex  39178  dmxrncnvepres  39181  dfblockliftmap2  39210  br1cossxrnres  39287  disjxrnres5  39596