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

Theorem ecopqsi 8707
Description: "Closure" law for equivalence class of ordered pairs. (Contributed by NM, 25-Mar-1996.)
Hypotheses
Ref Expression
ecopqsi.1 𝑅 ∈ V
ecopqsi.2 𝑆 = ((𝐴 × 𝐴) / 𝑅)
Assertion
Ref Expression
ecopqsi ((𝐵𝐴𝐶𝐴) → [⟨𝐵, 𝐶⟩]𝑅𝑆)

Proof of Theorem ecopqsi
StepHypRef Expression
1 opelxpi 5655 . 2 ((𝐵𝐴𝐶𝐴) → ⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴))
2 ecopqsi.1 . . . 4 𝑅 ∈ V
32ecelqsi 8706 . . 3 (⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴) → [⟨𝐵, 𝐶⟩]𝑅 ∈ ((𝐴 × 𝐴) / 𝑅))
4 ecopqsi.2 . . 3 𝑆 = ((𝐴 × 𝐴) / 𝑅)
53, 4eleqtrrdi 2850 . 2 (⟨𝐵, 𝐶⟩ ∈ (𝐴 × 𝐴) → [⟨𝐵, 𝐶⟩]𝑅𝑆)
61, 5syl 17 1 ((𝐵𝐴𝐶𝐴) → [⟨𝐵, 𝐶⟩]𝑅𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1547  wcel 2119  Vcvv 3431  cop 4561   × cxp 5616  [cec 8631   / cqs 8632
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711  ax-sep 5218  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-opab 5135  df-xp 5624  df-rel 5625  df-cnv 5626  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-ec 8635  df-qs 8639
This theorem is referenced by:  brecop  8747  recexsrlem  11017
  Copyright terms: Public domain W3C validator