Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  inxprnres Structured version   Visualization version   GIF version

Theorem inxprnres 39496
Description: Restriction of a class as a class of ordered pairs. (Contributed by Peter Mazsa, 2-Jan-2019.)
Assertion
Ref Expression
inxprnres (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)}
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦

Proof of Theorem inxprnres
Dummy variables 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relinxp 5801 . 2 Rel (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))
2 relopab 5812 . 2 Rel {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)}
3 eleq1w 2847 . . . . . 6 (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
4 breq1 5111 . . . . . 6 (𝑥 = 𝑧 → (𝑥𝑅𝑦 ↔ 𝑧𝑅𝑦))
53, 4anbi12d 644 . . . . 5 (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦) ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑦)))
6 breq2 5112 . . . . . 6 (𝑦 = 𝑤 → (𝑧𝑅𝑦 ↔ 𝑧𝑅𝑤))
76anbi2d 642 . . . . 5 (𝑦 = 𝑤 → ((𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑦) ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑤)))
85, 7opelopabg 5520 . . . 4 ((𝑧 ∈ V ∧ 𝑤 ∈ V) → (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)} ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑤)))
98el2v 3461 . . 3 (⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)} ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑤))
10 brinxprnres 39495 . . . 4 (𝑤 ∈ V → (𝑧(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝑤 ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑤)))
1110elv 3459 . . 3 (𝑧(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝑤 ↔ (𝑧 ∈ 𝐴 ∧ 𝑧𝑅𝑤))
12 df-br 5109 . . 3 (𝑧(𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴)))𝑤 ↔ ⟨𝑧, 𝑤⟩ ∈ (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))))
139, 11, 123bitr2ri 303 . 2 (⟨𝑧, 𝑤⟩ ∈ (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) ↔ ⟨𝑧, 𝑤⟩ ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)})
141, 2, 13eqrelriiv 5775 1 (𝑅 ∩ (𝐴 × ran (𝑅 ↾ 𝐴))) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ∩ cin 4092  ⟨cop 4840   class class class wbr 5108  {copab 5173   × cxp 5656  ran crn 5659   ↾ cres 5660
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398
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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-dm 5668  df-rn 5669  df-res 5670
This theorem is used by:  dfres4  39497
  Copyright terms: Public domain W3C validator