Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > enrbreq | GIF version |
Description: Equivalence relation for signed reals in terms of positive reals. (Contributed by NM, 3-Sep-1995.) |
Ref | Expression |
---|---|
enrbreq | ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) → (〈𝐴, 𝐵〉 ~R 〈𝐶, 𝐷〉 ↔ (𝐴 +P 𝐷) = (𝐵 +P 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-enr 6811 | . 2 ⊢ ~R = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ (P × P) ∧ 𝑦 ∈ (P × P)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = 〈𝑧, 𝑤〉 ∧ 𝑦 = 〈𝑣, 𝑢〉) ∧ (𝑧 +P 𝑢) = (𝑤 +P 𝑣)))} | |
2 | 1 | ecopoveq 6201 | 1 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝐶 ∈ P ∧ 𝐷 ∈ P)) → (〈𝐴, 𝐵〉 ~R 〈𝐶, 𝐷〉 ↔ (𝐴 +P 𝐷) = (𝐵 +P 𝐶))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 97 ↔ wb 98 = wceq 1243 ∈ wcel 1393 〈cop 3378 class class class wbr 3764 (class class class)co 5512 Pcnp 6389 +P cpp 6391 ~R cer 6394 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-opab 3819 df-xp 4351 df-iota 4867 df-fv 4910 df-ov 5515 df-enr 6811 |
This theorem is referenced by: enreceq 6821 addcmpblnr 6824 mulcmpblnr 6826 |
Copyright terms: Public domain | W3C validator |