Theorem xrnres 39074

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

Assertion

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

Proof of Theorem xrnres

Step	Hyp	Ref	Expression
1		resco 6251	. . 3 ⊢ ((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) = (◡(1st ↾ (V × V)) ∘ (𝑅 ↾ 𝐴))
2	1	ineq1i 4169	. 2 ⊢ (((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ↾ 𝐴)) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
3		df-xrn 39029	. . . 4 ⊢ (𝑅 ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
4	3	reseq1i 5974	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
5		inres2 38896	. . 3 ⊢ (((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆)) ↾ 𝐴)
6	4, 5	eqtr4i 2789	. 2 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (((◡(1st ↾ (V × V)) ∘ 𝑅) ↾ 𝐴) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
7		df-xrn 39029	. 2 ⊢ ((𝑅 ↾ 𝐴) ⋉ 𝑆) = ((◡(1st ↾ (V × V)) ∘ (𝑅 ↾ 𝐴)) ∩ (◡(2nd ↾ (V × V)) ∘ 𝑆))
8	2, 6, 7	3eqtr4i 2796	1 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ((𝑅 ↾ 𝐴) ⋉ 𝑆)

Syntax hints:   = wceq 1570  Vcvv 3455   ∩ cin 3904   × cxp 5659  ^◡ccnv 5660   ↾ cres 5663   ∘ ccom 5665  1^st c1st 7980  2^nd c2nd 7981   ⋉ cxrn 38823

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-xp 5667  df-rel 5668  df-co 5670  df-res 5673  df-xrn 39029

This theorem is referenced by:  dmxrncnvepres  39081