Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-dfres2 Structured version   Visualization version   GIF version

Theorem bj-dfres2 38056
Description: Alternate definition of the restriction of a class to another, as an ordered pair class abstraction: the restriction of a class to another is the class of ordered pairs whose first component is in the restricting class and whose components are related by the restricted class. (Contributed by Mario Carneiro, 5-Nov-2013.) Do not depend on df-rel 5657. (Revised by BJ, 16-Oct-2026.)
Assertion
Ref Expression
bj-dfres2 (𝑅 ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)}
Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝑅,𝑦

Proof of Theorem bj-dfres2
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-rex 3087 . . . 4 (∃𝑥 ∈ 𝐴 ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦) ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)))
2 an12 658 . . . . . . 7 ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)))
32exbii 1880 . . . . . 6 (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)) ↔ ∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)))
4 19.42v 1985 . . . . . 6 (∃𝑦(𝑥 ∈ 𝐴 ∧ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)) ↔ (𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)))
53, 4bitr2i 279 . . . . 5 ((𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
65exbii 1880 . . . 4 (∃𝑥(𝑥 ∈ 𝐴 ∧ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦)) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
71, 6bitri 278 . . 3 (∃𝑥 ∈ 𝐴 ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦) ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
8 bj-elres 38055 . . 3 (𝑧 ∈ (𝑅 ↾ 𝐴) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝑥𝑅𝑦))
9 elopab 5500 . . 3 (𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)} ↔ ∃𝑥∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)))
107, 8, 93bitr4i 306 . 2 (𝑧 ∈ (𝑅 ↾ 𝐴) ↔ 𝑧 ∈ {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)})
1110eqriv 2757 1 (𝑅 ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑥𝑅𝑦)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃wrex 3086  ⟨cop 4834   class class class wbr 5102  {copab 5166   ↾ cres 5652
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-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 3897  df-in 4090  df-un 4150  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-res 5662
This theorem is used by:  relpart  38058
  Copyright terms: Public domain W3C validator