Theorem xrnresex 38599

Description: Sufficient condition for a restricted range Cartesian product to be a set. (Contributed by Peter Mazsa, 16-Dec-2020.) (Revised by Peter Mazsa, 7-Sep-2021.)

Assertion

Ref	Expression
xrnresex	⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → (𝑅 ⋉ (𝑆 ↾ 𝐴)) ∈ V)

Proof of Theorem xrnresex

Step	Hyp	Ref	Expression
1		xrnres3 38597	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = ((𝑅 ↾ 𝐴) ⋉ (𝑆 ↾ 𝐴))
2		xrnres2 38596	. . 3 ⊢ ((𝑅 ⋉ 𝑆) ↾ 𝐴) = (𝑅 ⋉ (𝑆 ↾ 𝐴))
3	1, 2	eqtr3i 2760	. 2 ⊢ ((𝑅 ↾ 𝐴) ⋉ (𝑆 ↾ 𝐴)) = (𝑅 ⋉ (𝑆 ↾ 𝐴))
4		dfres4 38469	. . . 4 ⊢ (𝑅 ↾ 𝐴) = (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))
5		dfres4 38469	. . . 4 ⊢ (𝑆 ↾ 𝐴) = (𝑆 ∩ (𝐴 × ran (𝑆 ↾ 𝐴)))
6	4, 5	xrneq12i 38573	. . 3 ⊢ ((𝑅 ↾ 𝐴) ⋉ (𝑆 ↾ 𝐴)) = ((𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) ⋉ (𝑆 ∩ (𝐴 × ran (𝑆 ↾ 𝐴))))
7		simp1 1137	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → 𝐴 ∈ 𝑉)
8		resexg 5985	. . . . . 6 ⊢ (𝑅 ∈ 𝑊 → (𝑅 ↾ 𝐴) ∈ V)
9		rnexg 7844	. . . . . 6 ⊢ ((𝑅 ↾ 𝐴) ∈ V → ran (𝑅 ↾ 𝐴) ∈ V)
10	8, 9	syl 17	. . . . 5 ⊢ (𝑅 ∈ 𝑊 → ran (𝑅 ↾ 𝐴) ∈ V)
11	10	3ad2ant2 1135	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → ran (𝑅 ↾ 𝐴) ∈ V)
12		rnexg 7844	. . . . 5 ⊢ ((𝑆 ↾ 𝐴) ∈ 𝑋 → ran (𝑆 ↾ 𝐴) ∈ V)
13	12	3ad2ant3 1136	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → ran (𝑆 ↾ 𝐴) ∈ V)
14		inxpxrn 38588	. . . . 5 ⊢ ((𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) ⋉ (𝑆 ∩ (𝐴 × ran (𝑆 ↾ 𝐴)))) = ((𝑅 ⋉ 𝑆) ∩ (𝐴 × (ran (𝑅 ↾ 𝐴) × ran (𝑆 ↾ 𝐴))))
15		xrninxpex 38587	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ ran (𝑅 ↾ 𝐴) ∈ V ∧ ran (𝑆 ↾ 𝐴) ∈ V) → ((𝑅 ⋉ 𝑆) ∩ (𝐴 × (ran (𝑅 ↾ 𝐴) × ran (𝑆 ↾ 𝐴)))) ∈ V)
16	14, 15	eqeltrid 2839	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ran (𝑅 ↾ 𝐴) ∈ V ∧ ran (𝑆 ↾ 𝐴) ∈ V) → ((𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) ⋉ (𝑆 ∩ (𝐴 × ran (𝑆 ↾ 𝐴)))) ∈ V)
17	7, 11, 13, 16	syl3anc 1374	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → ((𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) ⋉ (𝑆 ∩ (𝐴 × ran (𝑆 ↾ 𝐴)))) ∈ V)
18	6, 17	eqeltrid 2839	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → ((𝑅 ↾ 𝐴) ⋉ (𝑆 ↾ 𝐴)) ∈ V)
19	3, 18	eqeltrrid 2840	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 ∈ 𝑊 ∧ (𝑆 ↾ 𝐴) ∈ 𝑋) → (𝑅 ⋉ (𝑆 ↾ 𝐴)) ∈ V)

Syntax hints:   → wi 4   ∧ w3a 1087   ∈ wcel 2114  Vcvv 3439   ∩ cin 3899   × cxp 5621  ran crn 5624   ↾ cres 5625   ⋉ cxrn 38344

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2183  ax-ext 2707  ax-sep 5240  ax-nul 5250  ax-pow 5309  ax-pr 5376  ax-un 7680

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2538  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2810  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rab 3399  df-v 3441  df-dif 3903  df-un 3905  df-in 3907  df-ss 3917  df-nul 4285  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5518  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-iota 6447  df-fun 6493  df-fn 6494  df-f 6495  df-fo 6497  df-fv 6499  df-1st 7933  df-2nd 7934  df-xrn 38550

This theorem is referenced by:  xrnidresex  38600  xrncnvepresex  38601