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

Theorem elidinxpid 6039
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 6038 . 2 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥 ∈ (𝐴 ∩ 𝐴)𝐵 = ⟨𝑥, 𝑥⟩)
2 inidm 4172 . . 3 (𝐴 ∩ 𝐴) = 𝐴
32rexeqi 3319 . 2 (∃𝑥 ∈ (𝐴 ∩ 𝐴)𝐵 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥 ∈ 𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
41, 3bitri 278 1 (𝐵 ∈ ( I ∩ (𝐴 × 𝐴)) ↔ ∃𝑥 ∈ 𝐴 𝐵 = ⟨𝑥, 𝑥⟩)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570   ∈ wcel 2145  ∃wrex 3087   ∩ cin 3898  ⟨cop 4590   I cid 5545   × cxp 5649
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2733  ax-sep 5249  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator