Theorem xrnres2 39402

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

Assertion

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

Proof of Theorem xrnres2

Step	Hyp	Ref	Expression
1		resco 6251	. . 3 ⊢ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴) = (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴))
2	1	ineq2i 4114	. 2 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ ((◡(2nd ↾ (V × V)) ∘ 𝑆) ↾ 𝐴)) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴)))
3		df-xrn 39356	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
4	3	reseq1i 5965	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
5		inres 5987	. . 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 39356	. 2 ⊢ (𝑅 ⋉ (𝑆 ↾ 𝐴)) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ (𝑆 ↾ 𝐴)))
8	2, 6, 7	3eqtr4i 2793	1 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))

This proof depends on syntax axioms:   = wceq 1569  Vcvv 3450   ∩ cin 4089   × cxp 5648  ^◡ccnv 5649   ↾ cres 5652   ∘ ccom 5654  1^st c1st 7999  2^nd c2nd 8000   ⋉ cxrn 39150

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-co 5659  df-res 5662  df-xrn 39356

This theorem is used by:  xrnresex  39405  dmxrncnvepres  39408  dfblockliftmap2  39437  br1cossxrnres  39514  disjxrnres5  39823