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

Theorem opabbid 4647
 Description: Equivalent wff's yield equal ordered-pair class abstractions (deduction rule). (Contributed by NM, 21-Feb-2004.) (Proof shortened by Andrew Salmon, 9-Jul-2011.)
Hypotheses
Ref Expression
opabbid.1 𝑥𝜑
opabbid.2 𝑦𝜑
opabbid.3 (𝜑 → (𝜓𝜒))
Assertion
Ref Expression
opabbid (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {⟨𝑥, 𝑦⟩ ∣ 𝜒})

Proof of Theorem opabbid
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 opabbid.1 . . . 4 𝑥𝜑
2 opabbid.2 . . . . 5 𝑦𝜑
3 opabbid.3 . . . . . 6 (𝜑 → (𝜓𝜒))
43anbi2d 736 . . . . 5 (𝜑 → ((𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ (𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜒)))
52, 4exbid 2078 . . . 4 (𝜑 → (∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ ∃𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜒)))
61, 5exbid 2078 . . 3 (𝜑 → (∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓) ↔ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜒)))
76abbidv 2728 . 2 (𝜑 → {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜒)})
8 df-opab 4644 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜓)}
9 df-opab 4644 . 2 {⟨𝑥, 𝑦⟩ ∣ 𝜒} = {𝑧 ∣ ∃𝑥𝑦(𝑧 = ⟨𝑥, 𝑦⟩ ∧ 𝜒)}
107, 8, 93eqtr4g 2669 1 (𝜑 → {⟨𝑥, 𝑦⟩ ∣ 𝜓} = {⟨𝑥, 𝑦⟩ ∣ 𝜒})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 195   ∧ wa 383   = wceq 1475  ∃wex 1695  Ⅎwnf 1699  {cab 2596  ⟨cop 4131  {copab 4642 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-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-opab 4644 This theorem is referenced by:  opabbidv  4648  mpteq12f  4661  feqmptdf  6161  fnoprabg  6659  mpteq12df  28837  mpteq12d  30915
 Copyright terms: Public domain W3C validator