Theorem elinxp 6010

Description: Membership in an intersection with a Cartesian product. (Contributed by Peter Mazsa, 9-Sep-2022.)

Assertion

Ref	Expression
elinxp	⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))

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

Proof of Theorem elinxp

Step	Hyp	Ref	Expression
1		relinxp 5793	. . . . 5 ⊢ Rel (𝑅 ∩ (𝐴 × 𝐵))
2		elrel 5775	. . . . 5 ⊢ ((Rel (𝑅 ∩ (𝐴 × 𝐵)) ∧ 𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵))) → ∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
3	1, 2	mpan 703	. . . 4 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → ∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩)
4		eleq1 2848	. . . . . . . . 9 ⊢ (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵))))
5	4	biimpd 232	. . . . . . . 8 ⊢ (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → ⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵))))
6		opelinxp 5732	. . . . . . . . 9 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
7	6	biimpi 219	. . . . . . . 8 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
8	5, 7	syl6com 38	. . . . . . 7 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → (𝐶 = ⟨𝑥, 𝑦⟩ → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅)))
9	8	ancld 560	. . . . . 6 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → (𝐶 = ⟨𝑥, 𝑦⟩ → (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))))
10		an12 658	. . . . . 6 ⊢ ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅)))
11	9, 10	imbitrdi 254	. . . . 5 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → (𝐶 = ⟨𝑥, 𝑦⟩ → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))))
12	11	2eximdv 1951	. . . 4 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → (∃𝑥∃𝑦 𝐶 = ⟨𝑥, 𝑦⟩ → ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))))
13	3, 12	mpd 16	. . 3 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅)))
14		r2ex 3199	. . 3 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅) ↔ ∃𝑥∃𝑦((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅)))
15	13, 14	sylibr 237	. 2 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) → ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))
16	6	simplbi2 506	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → ⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵))))
17	4	biimprd 251	. . . . 5 ⊢ (𝐶 = ⟨𝑥, 𝑦⟩ → (⟨𝑥, 𝑦⟩ ∈ (𝑅 ∩ (𝐴 × 𝐵)) → 𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵))))
18	16, 17	syl9 78	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → (𝐶 = ⟨𝑥, 𝑦⟩ → (⟨𝑥, 𝑦⟩ ∈ 𝑅 → 𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)))))
19	18	impd 416	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅) → 𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵))))
20	19	rexlimivv 3204	. 2 ⊢ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅) → 𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)))
21	15, 20	impbii 212	1 ⊢ (𝐶 ∈ (𝑅 ∩ (𝐴 × 𝐵)) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ 𝑅))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086   ∩ cin 4088  ⟨cop 4834   × cxp 5649  Rel wrel 5656

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 5391

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 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5657  df-rel 5658

This theorem is used by:  elres  6011  elidinxp  6038  dmstructnn  46034  dmstructfi  46035