Theorem elidinxp 6051

Description: Characterization of the elements of the intersection of the identity relation with a Cartesian product. (Contributed by Peter Mazsa, 9-Sep-2022.)

Assertion

Ref	Expression
elidinxp	⊢ (𝐶 ∈ ( I ∩ (𝐴 × 𝐵)) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝐶 = ⟨𝑥, 𝑥⟩)

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

Proof of Theorem elidinxp

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		risset 3243	. . . . 5 ⊢ (𝑥 ∈ 𝐵 ↔ ∃𝑦 ∈ 𝐵 𝑦 = 𝑥)
2	1	anbi2ci 637	. . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐶 = ⟨𝑥, 𝑥⟩) ↔ (𝐶 = ⟨𝑥, 𝑥⟩ ∧ ∃𝑦 ∈ 𝐵 𝑦 = 𝑥))
3		r19.42v 3200	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ (𝐶 = ⟨𝑥, 𝑥⟩ ∧ ∃𝑦 ∈ 𝐵 𝑦 = 𝑥))
4		opeq2 4844	. . . . . . . . 9 ⊢ (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
5	4	equcoms 2053	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
6	5	eqeq2d 2777	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (𝐶 = ⟨𝑥, 𝑥⟩ ↔ 𝐶 = ⟨𝑥, 𝑦⟩))
7	6	pm5.32ri 586	. . . . . 6 ⊢ ((𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝑦 = 𝑥))
8		vex 3462	. . . . . . . . 9 ⊢ 𝑦 ∈ V
9	8	ideq 5843	. . . . . . . 8 ⊢ (𝑥 I 𝑦 ↔ 𝑥 = 𝑦)
10		df-br 5115	. . . . . . . 8 ⊢ (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
11		equcom 2051	. . . . . . . 8 ⊢ (𝑥 = 𝑦 ↔ 𝑦 = 𝑥)
12	9, 10, 11	3bitr3i 304	. . . . . . 7 ⊢ (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑦 = 𝑥)
13	12	anbi2i 635	. . . . . 6 ⊢ ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝑦 = 𝑥))
14	7, 13	bitr4i 281	. . . . 5 ⊢ ((𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
15	14	rexbii 3115	. . . 4 ⊢ (∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
16	2, 3, 15	3bitr2i 302	. . 3 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝐶 = ⟨𝑥, 𝑥⟩) ↔ ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
17	16	rexbii 3115	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝐶 = ⟨𝑥, 𝑥⟩) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
18		rexin 4206	. 2 ⊢ (∃𝑥 ∈ (𝐴 ∩ 𝐵)𝐶 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝐶 = ⟨𝑥, 𝑥⟩))
19		elinxp 6023	. 2 ⊢ (𝐶 ∈ ( I ∩ (𝐴 × 𝐵)) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
20	17, 18, 19	3bitr4ri 307	1 ⊢ (𝐶 ∈ ( I ∩ (𝐴 × 𝐵)) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐵)𝐶 = ⟨𝑥, 𝑥⟩)

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃wrex 3092   ∩ cin 3907  ⟨cop 4600   class class class wbr 5114   I cid 5560   × cxp 5664

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409

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 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673

This theorem is used by:  elidinxpid  6052  elrid  6053  idinxpres  6054