Theorem elrid 6043

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 5666	. . 3 ⊢ ( I ↾ 𝑋) = ( I ∩ (𝑋 × V))
2	1	eleq2i 2855	. 2 ⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ 𝐴 ∈ ( I ∩ (𝑋 × V)))
3		elidinxp 6041	. 2 ⊢ (𝐴 ∈ ( I ∩ (𝑋 × V)) ↔ ∃𝑥 ∈ (𝑋 ∩ V)𝐴 = ⟨𝑥, 𝑥⟩)
4		inv1 4350	. . 3 ⊢ (𝑋 ∩ V) = 𝑋
5	4	rexeqi 3321	. 2 ⊢ (∃𝑥 ∈ (𝑋 ∩ V)𝐴 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)
6	2, 3, 5	3bitri 300	1 ⊢ (𝐴 ∈ ( I ↾ 𝑋) ↔ ∃𝑥 ∈ 𝑋 𝐴 = ⟨𝑥, 𝑥⟩)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2146  ∃wrex 3089  Vcvv 3453   ∩ cin 4091  ⟨cop 4837   I cid 5548   × cxp 5652   ↾ cres 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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

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 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-res 5666

This theorem is used by:  idinxpres  6044  idrefALT  6112  elid  6199