MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  enreceq Unicode version

Theorem enreceq 8707
Description: Equivalence class equality of positive fractions in terms of positive integers. (Contributed by NM, 29-Nov-1995.) (New usage is discouraged.)
Assertion
Ref Expression
enreceq  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( [ <. A ,  B >. ]  ~R  =  [ <. C ,  D >. ]  ~R  <->  ( A  +P.  D )  =  ( B  +P.  C ) ) )

Proof of Theorem enreceq
StepHypRef Expression
1 enrer 8706 . . . 4  |-  ~R  Er  ( P.  X.  P. )
21a1i 10 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ~R  Er  ( P.  X.  P. ) )
3 opelxpi 4737 . . . 4  |-  ( ( A  e.  P.  /\  B  e.  P. )  -> 
<. A ,  B >.  e.  ( P.  X.  P. ) )
43adantr 451 . . 3  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  <. A ,  B >.  e.  ( P. 
X.  P. ) )
52, 4erth 6720 . 2  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( <. A ,  B >.  ~R  <. C ,  D >.  <->  [ <. A ,  B >. ]  ~R  =  [ <. C ,  D >. ]  ~R  ) )
6 enrbreq 8705 . 2  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( <. A ,  B >.  ~R  <. C ,  D >.  <->  ( A  +P.  D )  =  ( B  +P.  C ) ) )
75, 6bitr3d 246 1  |-  ( ( ( A  e.  P.  /\  B  e.  P. )  /\  ( C  e.  P.  /\  D  e.  P. )
)  ->  ( [ <. A ,  B >. ]  ~R  =  [ <. C ,  D >. ]  ~R  <->  ( A  +P.  D )  =  ( B  +P.  C ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 176    /\ wa 358    = wceq 1632    e. wcel 1696   <.cop 3656   class class class wbr 4039    X. cxp 4703  (class class class)co 5874    Er wer 6673   [cec 6674   P.cnp 8497    +P. cpp 8499    ~R cer 8504
This theorem is referenced by:  ltsrpr  8715  m1p1sr  8730  m1m1sr  8731  ltsosr  8732  0idsr  8735  1idsr  8736  00sr  8737  recexsrlem  8741  map2psrpr  8748
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1536  ax-5 1547  ax-17 1606  ax-9 1644  ax-8 1661  ax-13 1698  ax-14 1700  ax-6 1715  ax-7 1720  ax-11 1727  ax-12 1878  ax-ext 2277  ax-sep 4157  ax-nul 4165  ax-pow 4204  ax-pr 4230  ax-un 4528  ax-inf2 7358
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-tru 1310  df-ex 1532  df-nf 1535  df-sb 1639  df-eu 2160  df-mo 2161  df-clab 2283  df-cleq 2289  df-clel 2292  df-nfc 2421  df-ne 2461  df-ral 2561  df-rex 2562  df-reu 2563  df-rmo 2564  df-rab 2565  df-v 2803  df-sbc 3005  df-csb 3095  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-pss 3181  df-nul 3469  df-if 3579  df-pw 3640  df-sn 3659  df-pr 3660  df-tp 3661  df-op 3662  df-uni 3844  df-int 3879  df-iun 3923  df-br 4040  df-opab 4094  df-mpt 4095  df-tr 4130  df-eprel 4321  df-id 4325  df-po 4330  df-so 4331  df-fr 4368  df-we 4370  df-ord 4411  df-on 4412  df-lim 4413  df-suc 4414  df-om 4673  df-xp 4711  df-rel 4712  df-cnv 4713  df-co 4714  df-dm 4715  df-rn 4716  df-res 4717  df-ima 4718  df-iota 5235  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5877  df-oprab 5878  df-mpt2 5879  df-1st 6138  df-2nd 6139  df-recs 6404  df-rdg 6439  df-1o 6495  df-oadd 6499  df-omul 6500  df-er 6676  df-ec 6678  df-ni 8512  df-pli 8513  df-mi 8514  df-lti 8515  df-plpq 8548  df-mpq 8549  df-ltpq 8550  df-enq 8551  df-nq 8552  df-erq 8553  df-plq 8554  df-mq 8555  df-1nq 8556  df-rq 8557  df-ltnq 8558  df-np 8621  df-plp 8623  df-ltp 8625  df-enr 8697
  Copyright terms: Public domain W3C validator