Theorem bj-elid3 37839

Description: Characterization of the couples in I whose first component is a setvar. (Contributed by BJ, 29-Mar-2020.)

Assertion

Ref	Expression
bj-elid3	⊢ (⟨𝑥, 𝐴⟩ ∈ I ↔ 𝑥 = 𝐴)

Proof of Theorem bj-elid3

Step	Hyp	Ref	Expression
1		vex 3458	. 2 ⊢ 𝑥 ∈ V
2		bj-opelidb1 37825	. 2 ⊢ (⟨𝑥, 𝐴⟩ ∈ I ↔ (𝑥 ∈ V ∧ 𝑥 = 𝐴))
3	1, 2	mpbiran 721	1 ⊢ (⟨𝑥, 𝐴⟩ ∈ I ↔ 𝑥 = 𝐴)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2142  Vcvv 3454  ⟨cop 4594   I cid 5554

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-opab 5173  df-id 5555

This theorem is used by: (None)