ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  enqbreq2 Unicode version

Theorem enqbreq2 6916
Description: Equivalence relation for positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013.)
Assertion
Ref Expression
enqbreq2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  ~Q  B  <->  ( ( 1st `  A )  .N  ( 2nd `  B
) )  =  ( ( 1st `  B
)  .N  ( 2nd `  A ) ) ) )

Proof of Theorem enqbreq2
StepHypRef Expression
1 1st2nd2 5945 . . 3  |-  ( A  e.  ( N.  X.  N. )  ->  A  = 
<. ( 1st `  A
) ,  ( 2nd `  A ) >. )
2 1st2nd2 5945 . . 3  |-  ( B  e.  ( N.  X.  N. )  ->  B  = 
<. ( 1st `  B
) ,  ( 2nd `  B ) >. )
31, 2breqan12d 3860 . 2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  ~Q  B  <->  <. ( 1st `  A ) ,  ( 2nd `  A )
>.  ~Q  <. ( 1st `  B
) ,  ( 2nd `  B ) >. )
)
4 xp1st 5936 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 1st `  A )  e.  N. )
5 xp2nd 5937 . . . 4  |-  ( A  e.  ( N.  X.  N. )  ->  ( 2nd `  A )  e.  N. )
64, 5jca 300 . . 3  |-  ( A  e.  ( N.  X.  N. )  ->  ( ( 1st `  A )  e.  N.  /\  ( 2nd `  A )  e. 
N. ) )
7 xp1st 5936 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 1st `  B )  e.  N. )
8 xp2nd 5937 . . . 4  |-  ( B  e.  ( N.  X.  N. )  ->  ( 2nd `  B )  e.  N. )
97, 8jca 300 . . 3  |-  ( B  e.  ( N.  X.  N. )  ->  ( ( 1st `  B )  e.  N.  /\  ( 2nd `  B )  e. 
N. ) )
10 enqbreq 6915 . . 3  |-  ( ( ( ( 1st `  A
)  e.  N.  /\  ( 2nd `  A )  e.  N. )  /\  ( ( 1st `  B
)  e.  N.  /\  ( 2nd `  B )  e.  N. ) )  ->  ( <. ( 1st `  A ) ,  ( 2nd `  A
) >.  ~Q  <. ( 1st `  B ) ,  ( 2nd `  B )
>. 
<->  ( ( 1st `  A
)  .N  ( 2nd `  B ) )  =  ( ( 2nd `  A
)  .N  ( 1st `  B ) ) ) )
116, 9, 10syl2an 283 . 2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( <. ( 1st `  A
) ,  ( 2nd `  A ) >.  ~Q  <. ( 1st `  B ) ,  ( 2nd `  B
) >. 
<->  ( ( 1st `  A
)  .N  ( 2nd `  B ) )  =  ( ( 2nd `  A
)  .N  ( 1st `  B ) ) ) )
12 mulcompig 6890 . . . 4  |-  ( ( ( 2nd `  A
)  e.  N.  /\  ( 1st `  B )  e.  N. )  -> 
( ( 2nd `  A
)  .N  ( 1st `  B ) )  =  ( ( 1st `  B
)  .N  ( 2nd `  A ) ) )
135, 7, 12syl2an 283 . . 3  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  (
( 2nd `  A
)  .N  ( 1st `  B ) )  =  ( ( 1st `  B
)  .N  ( 2nd `  A ) ) )
1413eqeq2d 2099 . 2  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  (
( ( 1st `  A
)  .N  ( 2nd `  B ) )  =  ( ( 2nd `  A
)  .N  ( 1st `  B ) )  <->  ( ( 1st `  A )  .N  ( 2nd `  B
) )  =  ( ( 1st `  B
)  .N  ( 2nd `  A ) ) ) )
153, 11, 143bitrd 212 1  |-  ( ( A  e.  ( N. 
X.  N. )  /\  B  e.  ( N.  X.  N. ) )  ->  ( A  ~Q  B  <->  ( ( 1st `  A )  .N  ( 2nd `  B
) )  =  ( ( 1st `  B
)  .N  ( 2nd `  A ) ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1289    e. wcel 1438   <.cop 3449   class class class wbr 3845    X. cxp 4436   ` cfv 5015  (class class class)co 5652   1stc1st 5909   2ndc2nd 5910   N.cnpi 6831    .N cmi 6833    ~Q ceq 6838
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 579  ax-in2 580  ax-io 665  ax-5 1381  ax-7 1382  ax-gen 1383  ax-ie1 1427  ax-ie2 1428  ax-8 1440  ax-10 1441  ax-11 1442  ax-i12 1443  ax-bndl 1444  ax-4 1445  ax-13 1449  ax-14 1450  ax-17 1464  ax-i9 1468  ax-ial 1472  ax-i5r 1473  ax-ext 2070  ax-coll 3954  ax-sep 3957  ax-nul 3965  ax-pow 4009  ax-pr 4036  ax-un 4260  ax-setind 4353  ax-iinf 4403
This theorem depends on definitions:  df-bi 115  df-3an 926  df-tru 1292  df-fal 1295  df-nf 1395  df-sb 1693  df-eu 1951  df-mo 1952  df-clab 2075  df-cleq 2081  df-clel 2084  df-nfc 2217  df-ne 2256  df-ral 2364  df-rex 2365  df-reu 2366  df-rab 2368  df-v 2621  df-sbc 2841  df-csb 2934  df-dif 3001  df-un 3003  df-in 3005  df-ss 3012  df-nul 3287  df-pw 3431  df-sn 3452  df-pr 3453  df-op 3455  df-uni 3654  df-int 3689  df-iun 3732  df-br 3846  df-opab 3900  df-mpt 3901  df-tr 3937  df-id 4120  df-iord 4193  df-on 4195  df-suc 4198  df-iom 4406  df-xp 4444  df-rel 4445  df-cnv 4446  df-co 4447  df-dm 4448  df-rn 4449  df-res 4450  df-ima 4451  df-iota 4980  df-fun 5017  df-fn 5018  df-f 5019  df-f1 5020  df-fo 5021  df-f1o 5022  df-fv 5023  df-ov 5655  df-oprab 5656  df-mpt2 5657  df-1st 5911  df-2nd 5912  df-recs 6070  df-irdg 6135  df-oadd 6185  df-omul 6186  df-ni 6863  df-mi 6865  df-enq 6906
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator