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

Theorem resopab2 6054
Description: Restriction of a class abstraction of ordered pairs. (Contributed by NM, 24-Aug-2007.)
Assertion
Ref Expression
resopab2 (𝐴𝐵 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝜑)} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦
Allowed substitution hints:   𝜑(𝑥,𝑦)

Proof of Theorem resopab2
StepHypRef Expression
1 resopab 6052 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝜑)} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴 ∧ (𝑥𝐵𝜑))}
2 ssel 3977 . . . . . 6 (𝐴𝐵 → (𝑥𝐴𝑥𝐵))
32pm4.71d 561 . . . . 5 (𝐴𝐵 → (𝑥𝐴 ↔ (𝑥𝐴𝑥𝐵)))
43anbi1d 631 . . . 4 (𝐴𝐵 → ((𝑥𝐴𝜑) ↔ ((𝑥𝐴𝑥𝐵) ∧ 𝜑)))
5 anass 468 . . . 4 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ (𝑥𝐴 ∧ (𝑥𝐵𝜑)))
64, 5bitr2di 288 . . 3 (𝐴𝐵 → ((𝑥𝐴 ∧ (𝑥𝐵𝜑)) ↔ (𝑥𝐴𝜑)))
76opabbidv 5209 . 2 (𝐴𝐵 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴 ∧ (𝑥𝐵𝜑))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
81, 7eqtrid 2789 1 (𝐴𝐵 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝜑)} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wss 3951  {copab 5205  cres 5687
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-clab 2715  df-cleq 2729  df-clel 2816  df-rab 3437  df-v 3482  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-opab 5206  df-xp 5691  df-rel 5692  df-res 5697
This theorem is referenced by:  resmpt  6055  marypha2lem4  9478
  Copyright terms: Public domain W3C validator