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

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

Proof of Theorem elidinxp
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 risset 3227 . . . . 5 (𝑥𝐵 ↔ ∃𝑦𝐵 𝑦 = 𝑥)
21anbi2ci 633 . . . 4 ((𝑥𝐵𝐶 = ⟨𝑥, 𝑥⟩) ↔ (𝐶 = ⟨𝑥, 𝑥⟩ ∧ ∃𝑦𝐵 𝑦 = 𝑥))
3 r19.42v 3184 . . . 4 (∃𝑦𝐵 (𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ (𝐶 = ⟨𝑥, 𝑥⟩ ∧ ∃𝑦𝐵 𝑦 = 𝑥))
4 opeq2 4822 . . . . . . . . 9 (𝑥 = 𝑦 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
54equcoms 2030 . . . . . . . 8 (𝑦 = 𝑥 → ⟨𝑥, 𝑥⟩ = ⟨𝑥, 𝑦⟩)
65eqeq2d 2763 . . . . . . 7 (𝑦 = 𝑥 → (𝐶 = ⟨𝑥, 𝑥⟩ ↔ 𝐶 = ⟨𝑥, 𝑦⟩))
76pm5.32ri 582 . . . . . 6 ((𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝑦 = 𝑥))
8 vex 3448 . . . . . . . . 9 𝑦 ∈ V
98ideq 5813 . . . . . . . 8 (𝑥 I 𝑦𝑥 = 𝑦)
10 df-br 5091 . . . . . . . 8 (𝑥 I 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ I )
11 equcom 2028 . . . . . . . 8 (𝑥 = 𝑦𝑦 = 𝑥)
129, 10, 113bitr3i 303 . . . . . . 7 (⟨𝑥, 𝑦⟩ ∈ I ↔ 𝑦 = 𝑥)
1312anbi2i 631 . . . . . 6 ((𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ 𝑦 = 𝑥))
147, 13bitr4i 280 . . . . 5 ((𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
1514rexbii 3099 . . . 4 (∃𝑦𝐵 (𝐶 = ⟨𝑥, 𝑥⟩ ∧ 𝑦 = 𝑥) ↔ ∃𝑦𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
162, 3, 153bitr2i 301 . . 3 ((𝑥𝐵𝐶 = ⟨𝑥, 𝑥⟩) ↔ ∃𝑦𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
1716rexbii 3099 . 2 (∃𝑥𝐴 (𝑥𝐵𝐶 = ⟨𝑥, 𝑥⟩) ↔ ∃𝑥𝐴𝑦𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
18 rexin 4193 . 2 (∃𝑥 ∈ (𝐴𝐵)𝐶 = ⟨𝑥, 𝑥⟩ ↔ ∃𝑥𝐴 (𝑥𝐵𝐶 = ⟨𝑥, 𝑥⟩))
19 elinxp 5994 . 2 (𝐶 ∈ ( I ∩ (𝐴 × 𝐵)) ↔ ∃𝑥𝐴𝑦𝐵 (𝐶 = ⟨𝑥, 𝑦⟩ ∧ ⟨𝑥, 𝑦⟩ ∈ I ))
2017, 18, 193bitr4ri 306 1 (𝐶 ∈ ( I ∩ (𝐴 × 𝐵)) ↔ ∃𝑥 ∈ (𝐴𝐵)𝐶 = ⟨𝑥, 𝑥⟩)
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 398   = wceq 1550  wcel 2132  wrex 3076  cin 3894  cop 4578   class class class wbr 5090   I cid 5530   × cxp 5634
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1805  ax-4 1819  ax-5 1920  ax-6 1977  ax-7 2018  ax-8 2134  ax-9 2142  ax-ext 2724  ax-sep 5236  ax-pr 5380
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 857  df-3an 1097  df-tru 1553  df-fal 1563  df-ex 1790  df-sb 2081  df-clab 2731  df-cleq 2744  df-clel 2827  df-ral 3067  df-rex 3077  df-rab 3405  df-v 3446  df-dif 3898  df-un 3900  df-in 3902  df-ss 3912  df-nul 4277  df-if 4471  df-sn 4573  df-pr 4575  df-op 4579  df-br 5091  df-opab 5153  df-id 5531  df-xp 5642  df-rel 5643
This theorem is referenced by:  elidinxpid  6020  elrid  6021  idinxpres  6022
  Copyright terms: Public domain W3C validator