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

Theorem resopab2 5368
 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 5366 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝜑)} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴 ∧ (𝑥𝐵𝜑))}
2 ssel 3562 . . . . . 6 (𝐴𝐵 → (𝑥𝐴𝑥𝐵))
32pm4.71d 664 . . . . 5 (𝐴𝐵 → (𝑥𝐴 ↔ (𝑥𝐴𝑥𝐵)))
43anbi1d 737 . . . 4 (𝐴𝐵 → ((𝑥𝐴𝜑) ↔ ((𝑥𝐴𝑥𝐵) ∧ 𝜑)))
5 anass 679 . . . 4 (((𝑥𝐴𝑥𝐵) ∧ 𝜑) ↔ (𝑥𝐴 ∧ (𝑥𝐵𝜑)))
64, 5syl6rbb 276 . . 3 (𝐴𝐵 → ((𝑥𝐴 ∧ (𝑥𝐵𝜑)) ↔ (𝑥𝐴𝜑)))
76opabbidv 4648 . 2 (𝐴𝐵 → {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴 ∧ (𝑥𝐵𝜑))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
81, 7syl5eq 2656 1 (𝐴𝐵 → ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐵𝜑)} ↾ 𝐴) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝜑)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475   ∈ wcel 1977   ⊆ wss 3540  {copab 4642   ↾ cres 5040 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-opab 4644  df-xp 5044  df-rel 5045  df-res 5050 This theorem is referenced by:  resmpt  5369  marypha2lem4  8227
 Copyright terms: Public domain W3C validator