Theorem elrid 5906

Description: Characterization of the elements of a restricted identity relation. (Contributed by BJ, 28-Aug-2022.) (Proof shortened by Peter Mazsa, 9-Sep-2022.)

Assertion

Ref	Expression
elrid	⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)

Distinct variable groups:   𝑥,𝐴   𝑥,𝑋

Proof of Theorem elrid

Step	Hyp	Ref	Expression
1		df-res 5560	. . 3 ⊢ ( I ↾ 𝑋) = ( I ∩ (𝑋 × V))
2	1	eleq2i 2903	. 2 ⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ 𝐴 ∈ ( I ∩ (𝑋 × V)))
3		elidinxp 5904	. 2 ⊢ (𝐴 ∈ ( I ∩ (𝑋 × V)) ↔ ∃𝑥 ∈ (𝑋 ∩ V)𝐴 = ⟨𝑥, 𝑥⟩)
4		inv1 4341	. . 3 ⊢ (𝑋 ∩ V) = 𝑋
5	4	rexeqi 3413	. 2 ⊢ (∃𝑥 ∈ (𝑋 ∩ V)𝐴 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)
6	2, 3, 5	3bitri 299	1 ⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)

Syntax hints:   ↔ wb 208   = wceq 1536   ∈ wcel 2113  ∃wrex 3138  Vcvv 3491   ∩ cin 3928  ⟨cop 4566   I cid 5452   × cxp 5546   ↾ cres 5550

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-br 5060  df-opab 5122  df-id 5453  df-xp 5554  df-rel 5555  df-res 5560

This theorem is referenced by:  idinxpres  5907  idrefALT  5966  elid  6049