Theorem inxpxrn 38956

Description: Two ways to express the intersection of a range Cartesian product with a Cartesian product. (Contributed by Peter Mazsa, 10-Apr-2020.)

Assertion

Ref	Expression
inxpxrn	⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶))) = ((𝑅 ⋉ 𝑆) ∩ (𝐴 × (𝐵 × 𝐶)))

Proof of Theorem inxpxrn

Dummy variables 𝑢 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		xrnrel 38920	. 2 ⊢ Rel ((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶)))
2		relinxp 5802	. 2 ⊢ Rel ((𝑅 ⋉ 𝑆) ∩ (𝐴 × (𝐵 × 𝐶)))
3		brxrn2 38922	. . . . . 6 ⊢ (𝑢 ∈ V → (𝑢(𝑅 ⋉ 𝑆)𝑥 ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))
4	3	elv 3468	. . . . 5 ⊢ (𝑢(𝑅 ⋉ 𝑆)𝑥 ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))
5	4	anbi2i 634	. . . 4 ⊢ ((𝑢 ∈ 𝐴 ∧ 𝑢(𝑅 ⋉ 𝑆)𝑥) ↔ (𝑢 ∈ 𝐴 ∧ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))
6	5	anbi2i 634	. . 3 ⊢ ((𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ 𝑢(𝑅 ⋉ 𝑆)𝑥)) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
7		xrninxp2 38954	. . . 4 ⊢ ((𝑅 ⋉ 𝑆) ∩ (𝐴 × (𝐵 × 𝐶))) = {⟨𝑢, 𝑥⟩ ∣ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ 𝑢(𝑅 ⋉ 𝑆)𝑥))}
8	7	brabidgaw 38911	. . 3 ⊢ (𝑢((𝑅 ⋉ 𝑆) ∩ (𝐴 × (𝐵 × 𝐶)))𝑥 ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ 𝑢(𝑅 ⋉ 𝑆)𝑥)))
9		brxrn2 38922	. . . . 5 ⊢ (𝑢 ∈ V → (𝑢((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶)))𝑥 ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)))
10	9	elv 3468	. . . 4 ⊢ (𝑢((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶)))𝑥 ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧))
11		3anass 1109	. . . . 5 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)))
12	11	2exbii 1876	. . . 4 ⊢ (∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)))
13		brinxp2 5740	. . . . . . . . . . . 12 ⊢ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑢 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢𝑅𝑦))
14		brinxp2 5740	. . . . . . . . . . . 12 ⊢ (𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧 ↔ ((𝑢 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ∧ 𝑢𝑆𝑧))
15	13, 14	anbi12i 639	. . . . . . . . . . 11 ⊢ ((𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧) ↔ (((𝑢 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢𝑅𝑦) ∧ ((𝑢 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ∧ 𝑢𝑆𝑧)))
16		anan 38773	. . . . . . . . . . 11 ⊢ ((((𝑢 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢𝑅𝑦) ∧ ((𝑢 ∈ 𝐴 ∧ 𝑧 ∈ 𝐶) ∧ 𝑢𝑆𝑧)) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
17	15, 16	bitri 278	. . . . . . . . . 10 ⊢ ((𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧) ↔ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
18	17	anbi2i 634	. . . . . . . . 9 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))))
19		anass 473	. . . . . . . . 9 ⊢ (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))))
20		eqelb 38779	. . . . . . . . . . 11 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑥 ∈ (𝐵 × 𝐶)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ ⟨𝑦, 𝑧⟩ ∈ (𝐵 × 𝐶)))
21		opelxp 5698	. . . . . . . . . . . 12 ⊢ (⟨𝑦, 𝑧⟩ ∈ (𝐵 × 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
22	21	anbi2i 634	. . . . . . . . . . 11 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ ⟨𝑦, 𝑧⟩ ∈ (𝐵 × 𝐶)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)))
23	20, 22	bitr2i 279	. . . . . . . . . 10 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑥 ∈ (𝐵 × 𝐶)))
24	23	anbi1i 635	. . . . . . . . 9 ⊢ (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶)) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑥 ∈ (𝐵 × 𝐶)) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
25	18, 19, 24	3bitr2i 302	. . . . . . . 8 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)) ↔ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑥 ∈ (𝐵 × 𝐶)) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
26		ancom 465	. . . . . . . . 9 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑥 ∈ (𝐵 × 𝐶)) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ 𝑥 = ⟨𝑦, 𝑧⟩))
27	26	anbi1i 635	. . . . . . . 8 ⊢ (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑥 ∈ (𝐵 × 𝐶)) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ ((𝑥 ∈ (𝐵 × 𝐶) ∧ 𝑥 = ⟨𝑦, 𝑧⟩) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
28		anass 473	. . . . . . . 8 ⊢ (((𝑥 ∈ (𝐵 × 𝐶) ∧ 𝑥 = ⟨𝑦, 𝑧⟩) ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))))
29	25, 27, 28	3bitri 300	. . . . . . 7 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))))
30		an12 657	. . . . . . . . 9 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
31		3anass 1109	. . . . . . . . . 10 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))
32	31	anbi2i 634	. . . . . . . . 9 ⊢ ((𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)) ↔ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
33	30, 32	bitr4i 281	. . . . . . . 8 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))
34	33	anbi2i 634	. . . . . . 7 ⊢ ((𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢 ∈ 𝐴 ∧ (𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
35	29, 34	bitri 278	. . . . . 6 ⊢ ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
36	35	2exbii 1876	. . . . 5 ⊢ (∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)) ↔ ∃𝑦∃𝑧(𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
37		19.42vv 1984	. . . . 5 ⊢ (∃𝑦∃𝑧(𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ ∃𝑦∃𝑧(𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
38		19.42vv 1984	. . . . . 6 ⊢ (∃𝑦∃𝑧(𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)) ↔ (𝑢 ∈ 𝐴 ∧ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧)))
39	38	anbi2i 634	. . . . 5 ⊢ ((𝑥 ∈ (𝐵 × 𝐶) ∧ ∃𝑦∃𝑧(𝑢 ∈ 𝐴 ∧ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
40	36, 37, 39	3bitri 300	. . . 4 ⊢ (∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑢(𝑅 ∩ (𝐴 × 𝐵))𝑦 ∧ 𝑢(𝑆 ∩ (𝐴 × 𝐶))𝑧)) ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
41	10, 12, 40	3bitri 300	. . 3 ⊢ (𝑢((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶)))𝑥 ↔ (𝑥 ∈ (𝐵 × 𝐶) ∧ (𝑢 ∈ 𝐴 ∧ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ 𝑢𝑅𝑦 ∧ 𝑢𝑆𝑧))))
42	6, 8, 41	3bitr4ri 307	. 2 ⊢ (𝑢((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶)))𝑥 ↔ 𝑢((𝑅 ⋉ 𝑆) ∩ (𝐴 × (𝐵 × 𝐶)))𝑥)
43	1, 2, 42	eqbrriv 5778	1 ⊢ ((𝑅 ∩ (𝐴 × 𝐵)) ⋉ (𝑆 ∩ (𝐴 × 𝐶))) = ((𝑅 ⋉ 𝑆) ∩ (𝐴 × (𝐵 × 𝐶)))

Syntax hints:   ↔ wb 209   ∧ wa 400   ∧ w3a 1101   = wceq 1567  ∃wex 1806   ∈ wcel 2149  Vcvv 3463   ∩ cin 3912  ⟨cop 4600   class class class wbr 5113   × cxp 5660   ⋉ cxrn 38712

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-1st 7985  df-2nd 7986  df-xrn 38918

This theorem is referenced by:  xrnres4  38966  xrnresex  38967