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

Theorem enrbreq 11023
Description: Equivalence relation for signed reals in terms of positive reals. (Contributed by NM, 3-Sep-1995.) (New usage is discouraged.)
Assertion
Ref Expression
enrbreq (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (⟨𝐴, 𝐵⟩ ~R𝐶, 𝐷⟩ ↔ (𝐴 +P 𝐷) = (𝐵 +P 𝐶)))

Proof of Theorem enrbreq
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-enr 11013 . 2 ~R = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (P × P) ∧ 𝑦 ∈ (P × P)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 +P 𝑢) = (𝑤 +P 𝑣)))}
21ecopoveq 8800 1 (((𝐴P𝐵P) ∧ (𝐶P𝐷P)) → (⟨𝐴, 𝐵⟩ ~R𝐶, 𝐷⟩ ↔ (𝐴 +P 𝐷) = (𝐵 +P 𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1560  wcel 2142  cop 4588   class class class wbr 5100  (class class class)co 7396  Pcnp 10817   +P cpp 10819   ~R cer 10822
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-sb 2091  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3077  df-rex 3087  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-xp 5653  df-iota 6477  df-fv 6529  df-ov 7399  df-enr 11013
This theorem is referenced by:  enreceq  11024  addcmpblnr  11027  mulcmpblnr  11029
  Copyright terms: Public domain W3C validator