Theorem elrid 6042

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 5667	. . 3 ⊢ ( I ↾ 𝑋) = ( I ∩ (𝑋 × V))
2	1	eleq2i 2852	. 2 ⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ 𝐴 ∈ ( I ∩ (𝑋 × V)))
3		elidinxp 6040	. 2 ⊢ (𝐴 ∈ ( I ∩ (𝑋 × V)) ↔ ∃𝑥 ∈ (𝑋 ∩ V)𝐴 = ⟨𝑥, 𝑥⟩)
4		inv1 4348	. . 3 ⊢ (𝑋 ∩ V) = 𝑋
5	4	rexeqi 3318	. 2 ⊢ (∃𝑥 ∈ (𝑋 ∩ V)𝐴 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)
6	2, 3, 5	3bitri 300	1 ⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ∃wrex 3086  Vcvv 3450   ∩ cin 3898  ⟨cop 4590   I cid 5549   × cxp 5653   ↾ cres 5657

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-id 5550  df-xp 5661  df-rel 5662  df-res 5667

This theorem is used by:  idinxpres  6043  idrefALT  6107  elid  6193