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

Theorem elidinxpid 6036
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 6035 . 2 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐴)𝐵 = ⟨𝑥, 𝑥⟩)
2 inidm 4123 . . 3 (𝐴 ∩ 𝐴) = 𝐴
32rexeqi 3318 . 2 (∃𝑥 ∈ (𝐴 ∩ 𝐴)𝐵 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥 ∈ 𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
41, 3bitri 278 1 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥 ∈ 𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1569   ∈ wcel 2144  ∃wrex 3086   ∩ cin 4089  ⟨cop 4834   I cid 5544   × cxp 5648
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-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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  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 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator