Theorem bj-opelidb1 38150

Description: Characterization of the ordered pair elements of the identity relation. Variant of bj-opelidb 38149 where only the sethood of the first component is expressed. (Contributed by BJ, 27-Dec-2023.)

Assertion

Ref	Expression
bj-opelidb1	⊢ (⟨𝐴, 𝐵⟩ ∈ I ↔ (𝐴 ∈ V ∧ 𝐴 = 𝐵))

Proof of Theorem bj-opelidb1

Step	Hyp	Ref	Expression
1		an32 659	. 2 ⊢ (((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐴 = 𝐵) ↔ ((𝐴 ∈ V ∧ 𝐴 = 𝐵) ∧ 𝐵 ∈ V))
2		bj-opelidb 38149	. 2 ⊢ (⟨𝐴, 𝐵⟩ ∈ I ↔ ((𝐴 ∈ V ∧ 𝐵 ∈ V) ∧ 𝐴 = 𝐵))
3		eleq1 2848	. . . 4 ⊢ (𝐴 = 𝐵 → (𝐴 ∈ V ↔ 𝐵 ∈ V))
4	3	biimpac 484	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐴 = 𝐵) → 𝐵 ∈ V)
5	4	pm4.71i 569	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐴 = 𝐵) ↔ ((𝐴 ∈ V ∧ 𝐴 = 𝐵) ∧ 𝐵 ∈ V))
6	1, 2, 5	3bitr4i 306	1 ⊢ (⟨𝐴, 𝐵⟩ ∈ I ↔ (𝐴 ∈ V ∧ 𝐴 = 𝐵))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Vcvv 3450  ⟨cop 4589   I cid 5544

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-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

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-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-opab 5167  df-id 5545

This theorem is used by:  bj-idres  38157  bj-elid3  38164  bj-eldiag2  38174