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

Theorem rabxp 5704
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 5679 . . . . 5 (𝑥 ∈ (𝐴 × 𝐵) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)))
21anbi1i 636 . . . 4 ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ (∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) ∧ 𝜑))
3 19.41vv 1985 . . . 4 (∃𝑦∃𝑧((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) ∧ 𝜑) ↔ (∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) ∧ 𝜑))
4 anass 474 . . . . . 6 (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) ∧ 𝜑) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) ∧ 𝜑)))
5 rabxp.1 . . . . . . . . 9 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝜑 ↔ 𝜓))
65anbi2d 642 . . . . . . . 8 (𝑥 = ⟨𝑦, 𝑧⟩ → (((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) ∧ 𝜑) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) ∧ 𝜓)))
7 df-3an 1105 . . . . . . . 8 ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) ∧ 𝜓))
86, 7bitr4di 292 . . . . . . 7 (𝑥 = ⟨𝑦, 𝑧⟩ → (((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)))
98pm5.32i 585 . . . . . 6 ((𝑥 = ⟨𝑦, 𝑧⟩ ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵) ∧ 𝜑)) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)))
104, 9bitri 278 . . . . 5 (((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) ∧ 𝜑) ↔ (𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)))
11102exbii 1882 . . . 4 (∃𝑦∃𝑧((𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵)) ∧ 𝜑) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)))
122, 3, 113bitr2i 302 . . 3 ((𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑) ↔ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)))
1312abbii 2830 . 2 {𝑥 ∣ (𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑)} = {𝑥 ∣ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓))}
14 df-rab 3417 . 2 {𝑥 ∈ (𝐴 × 𝐵) ∣ 𝜑} = {𝑥 ∣ (𝑥 ∈ (𝐴 × 𝐵) ∧ 𝜑)}
15 df-opab 5172 . 2 {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)} = {𝑥 ∣ ∃𝑦∃𝑧(𝑥 = ⟨𝑦, 𝑧⟩ ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓))}
1613, 14, 153eqtr4i 2796 1 {𝑥 ∈ (𝐴 × 𝐵) ∣ 𝜑} = {⟨𝑦, 𝑧⟩ ∣ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐵 ∧ 𝜓)}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741  {crab 3416  ⟨cop 4838  {copab 5171   × cxp 5654
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 5253  ax-pr 5396
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-rab 3417  df-v 3456  df-ss 3901  df-in 4094  df-un 4154  df-sn 4589  df-pr 4591  df-op 4839  df-opab 5172  df-xp 5662
This theorem is used by:  cicer  18013  poimirlem26  38769  dib1dim  42425  diclspsn  42454  fgraphxp  44409  relcic  50374
  Copyright terms: Public domain W3C validator