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

Theorem elidinxpid 6004
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 6003 . 2 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥 ∈ (𝐴𝐴)𝐵 = ⟨𝑥, 𝑥⟩)
2 inidm 4162 . . 3 (𝐴𝐴) = 𝐴
32rexeqi 3297 . 2 (∃𝑥 ∈ (𝐴𝐴)𝐵 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
41, 3bitri 276 1 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
Colors of variables: wff setvar class
Syntax hints:  wb 207   = wceq 1547  wcel 2119  wrex 3064  cin 3889  cop 4568   I cid 5519   × cxp 5623
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-id 5520  df-xp 5631  df-rel 5632
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator