MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elidinxpid Structured version   Visualization version   GIF version

Theorem elidinxpid 6038
Description: Characterization of the elements of the intersection of the identity relation with a Cartesian square. (Contributed by Peter Mazsa, 9-Sep-2022.)
Assertion
Ref Expression
elidinxpid (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem elidinxpid
StepHypRef Expression
1 elidinxp 6037 . 2 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥 ∈ (𝐴𝐴)𝐵 = ⟨𝑥, 𝑥⟩)
2 inidm 4181 . . 3 (𝐴𝐴) = 𝐴
32rexeqi 3322 . 2 (∃𝑥 ∈ (𝐴𝐴)𝐵 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
41, 3bitri 278 1 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
Colors of variables: wff setvar class
Syntax hints:  wb 209   = wceq 1563  wcel 2145  wrex 3089  cin 3906  cop 4591   I cid 5546   × cxp 5650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737  ax-sep 5251  ax-pr 5395
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-br 5106  df-opab 5168  df-id 5547  df-xp 5658  df-rel 5659
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator