Theorem inxp2 39123

Description: Intersection with a Cartesian product. (Contributed by Peter Mazsa, 18-Jul-2019.)

Assertion

Ref	Expression
inxp2	⊢ (𝑅 ∩ (𝐴 × 𝐵)) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦)}

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑥,𝑅,𝑦

Proof of Theorem inxp2

Step	Hyp	Ref	Expression
1		relinxp 5795	. . 3 ⊢ Rel (𝑅 ∩ (𝐴 × 𝐵))
2		dfrel4v 6183	. . 3 ⊢ (Rel (𝑅 ∩ (𝐴 × 𝐵)) ↔ (𝑅 ∩ (𝐴 × 𝐵)) = {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦})
3	1, 2	mpbi 233	. 2 ⊢ (𝑅 ∩ (𝐴 × 𝐵)) = {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦}
4		brinxp2 5733	. . 3 ⊢ (𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦))
5	4	opabbii 5172	. 2 ⊢ {⟨𝑥, 𝑦⟩ ∣ 𝑥(𝑅 ∩ (𝐴 × 𝐵))𝑦} = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦)}
6	3, 5	eqtri 2783	1 ⊢ (𝑅 ∩ (𝐴 × 𝐵)) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑥𝑅𝑦)}

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∩ cin 3898   class class class wbr 5103  {copab 5167   × cxp 5653  Rel wrel 5660

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-cnv 5663

This theorem is used by:  xrninxp  39163  xrninxp2  39164