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

Theorem rabxp 5708
Description: Class abstraction restricted to a Cartesian product as an ordered-pair class abstraction. (Contributed by NM, 20-Feb-2014.)
Hypothesis
Ref Expression
rabxp.1 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑𝜓))
Assertion
Ref Expression
rabxp {𝑥 ∈ (𝐴 × 𝐵) ∣ 𝜑} = {⟨𝑦, 𝑧⟩ ∣ (𝑦𝐴𝑧𝐵𝜓)}
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝜑,𝑦,𝑧   𝜓,𝑥
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑦, 𝑧)

Proof of Theorem rabxp
StepHypRef Expression
1 elxp 5683 . . . . 5 (𝑥 ∈ (𝐴 × 𝐵) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)))
21anbi1i 635 . . . 4 ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ (∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)) ∧ 𝜑))
3 19.41vv 1979 . . . 4 (∃𝑦𝑧((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)) ∧ 𝜑) ↔ (∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)) ∧ 𝜑))
4 anass 473 . . . . . 6 (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)) ∧ 𝜑) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐴𝑧𝐵) ∧ 𝜑)))
5 rabxp.1 . . . . . . . . 9 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑𝜓))
65anbi2d 641 . . . . . . . 8 (𝑥 = ⟨𝑦, 𝑧⟩ → (((𝑦𝐴𝑧𝐵) ∧ 𝜑) ↔ ((𝑦𝐴𝑧𝐵) ∧ 𝜓)))
7 df-3an 1104 . . . . . . . 8 ((𝑦𝐴𝑧𝐵𝜓) ↔ ((𝑦𝐴𝑧𝐵) ∧ 𝜓))
86, 7bitr4di 292 . . . . . . 7 (𝑥 = ⟨𝑦, 𝑧⟩ → (((𝑦𝐴𝑧𝐵) ∧ 𝜑) ↔ (𝑦𝐴𝑧𝐵𝜓)))
98pm5.32i 584 . . . . . 6 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦𝐴𝑧𝐵) ∧ 𝜑)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵𝜓)))
104, 9bitri 278 . . . . 5 (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)) ∧ 𝜑) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵𝜓)))
11102exbii 1878 . . . 4 (∃𝑦𝑧((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵)) ∧ 𝜑) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵𝜓)))
122, 3, 113bitr2i 302 . . 3 ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵𝜓)))
1312abbii 2829 . 2 {𝑥 ∣ (𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {𝑥 ∣ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵𝜓))}
14 df-rab 3416 . 2 {𝑥 ∈ (𝐴 × 𝐵) ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑)}
15 df-opab 5173 . 2 {⟨𝑦, 𝑧⟩ ∣ (𝑦𝐴𝑧𝐵𝜓)} = {𝑥 ∣ ∃𝑦𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦𝐴𝑧𝐵𝜓))}
1613, 14, 153eqtr4i 2795 1 {𝑥 ∈ (𝐴 × 𝐵) ∣ 𝜑} = {⟨𝑦, 𝑧⟩ ∣ (𝑦𝐴𝑧𝐵𝜓)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 400  w3a 1102   = wceq 1569  wex 1808  wcel 2142  {cab 2740  {crab 3415  cop 4594  {copab 5172   × cxp 5658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-ex 1809  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-rab 3416  df-v 3456  df-un 3909  df-in 3911  df-ss 3921  df-sn 4589  df-pr 4591  df-op 4595  df-opab 5173  df-xp 5666
This theorem is used by:  cicer  17869  poimirlem26  38325  dib1dim  41967  diclspsn  41996  fgraphxp  43959  relcic  49851
  Copyright terms: Public domain W3C validator