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 4168 . . 3 (𝐴𝐴) = 𝐴
32rexeqi 3295 . 2 (∃𝑥 ∈ (𝐴𝐴)𝐵 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
41, 3bitri 275 1 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
Colors of variables: wff setvar class
Syntax hints:  wb 206   = wceq 1542  wcel 2114  wrex 3062  cin 3889  cop 4574   I cid 5518   × cxp 5622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-pr 5370
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-id 5519  df-xp 5630  df-rel 5631
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator