Theorem enqbreq2 7331

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

Step	Hyp	Ref	Expression
1		1st2nd2 6166	. . 3 |- ( A e. ( N. X. N. ) -> A = <. ( 1st ` A ) , ( 2nd ` A ) >. )
2		1st2nd2 6166	. . 3 |- ( B e. ( N. X. N. ) -> B = <. ( 1st ` B ) , ( 2nd ` B ) >. )
3	1, 2	breqan12d 4014	. 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 6156	. . . 4 |- ( A e. ( N. X. N. ) -> ( 1st ` A ) e. N. )
5		xp2nd 6157	. . . 4 |- ( A e. ( N. X. N. ) -> ( 2nd ` A ) e. N. )
6	4, 5	jca 306	. . 3 |- ( A e. ( N. X. N. ) -> ( ( 1st ` A ) e. N. /\ ( 2nd ` A ) e. N. ) )
7		xp1st 6156	. . . 4 |- ( B e. ( N. X. N. ) -> ( 1st ` B ) e. N. )
8		xp2nd 6157	. . . 4 |- ( B e. ( N. X. N. ) -> ( 2nd ` B ) e. N. )
9	7, 8	jca 306	. . 3 |- ( B e. ( N. X. N. ) -> ( ( 1st ` B ) e. N. /\ ( 2nd ` B ) e. N. ) )
10		enqbreq 7330	. . 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 ) ) ) )
11	6, 9, 10	syl2an 289	. 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 7305	. . . 4 |- ( ( ( 2nd ` A ) e. N. /\ ( 1st ` B ) e. N. ) -> ( ( 2nd ` A ) .N ( 1st ` B ) ) = ( ( 1st ` B ) .N ( 2nd ` A ) ) )
13	5, 7, 12	syl2an 289	. . 3 |- ( ( A e. ( N. X. N. ) /\ B e. ( N. X. N. ) ) -> ( ( 2nd ` A ) .N ( 1st ` B ) ) = ( ( 1st ` B ) .N ( 2nd ` A ) ) )
14	13	eqeq2d 2187	. 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 ) ) ) )
15	3, 11, 14	3bitrd 214	1 |- ( ( A e. ( N. X. N. ) /\ B e. ( N. X. N. ) ) -> ( A ~Q B <-> ( ( 1st ` A ) .N ( 2nd ` B ) ) = ( ( 1st ` B ) .N ( 2nd ` A ) ) ) )

Syntax hints:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1353   e. wcel 2146   <.cop 3592   class class class wbr 3998   X. cxp 4618   ` cfv 5208  (class class class)co 5865   1stc1st 6129   2ndc2nd 6130   N.cnpi 7246   .N cmi 7248   ~Q ceq 7253

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 614  ax-in2 615  ax-io 709  ax-5 1445  ax-7 1446  ax-gen 1447  ax-ie1 1491  ax-ie2 1492  ax-8 1502  ax-10 1503  ax-11 1504  ax-i12 1505  ax-bndl 1507  ax-4 1508  ax-17 1524  ax-i9 1528  ax-ial 1532  ax-i5r 1533  ax-13 2148  ax-14 2149  ax-ext 2157  ax-coll 4113  ax-sep 4116  ax-nul 4124  ax-pow 4169  ax-pr 4203  ax-un 4427  ax-setind 4530  ax-iinf 4581

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1459  df-sb 1761  df-eu 2027  df-mo 2028  df-clab 2162  df-cleq 2168  df-clel 2171  df-nfc 2306  df-ne 2346  df-ral 2458  df-rex 2459  df-reu 2460  df-rab 2462  df-v 2737  df-sbc 2961  df-csb 3056  df-dif 3129  df-un 3131  df-in 3133  df-ss 3140  df-nul 3421  df-pw 3574  df-sn 3595  df-pr 3596  df-op 3598  df-uni 3806  df-int 3841  df-iun 3884  df-br 3999  df-opab 4060  df-mpt 4061  df-tr 4097  df-id 4287  df-iord 4360  df-on 4362  df-suc 4365  df-iom 4584  df-xp 4626  df-rel 4627  df-cnv 4628  df-co 4629  df-dm 4630  df-rn 4631  df-res 4632  df-ima 4633  df-iota 5170  df-fun 5210  df-fn 5211  df-f 5212  df-f1 5213  df-fo 5214  df-f1o 5215  df-fv 5216  df-ov 5868  df-oprab 5869  df-mpo 5870  df-1st 6131  df-2nd 6132  df-recs 6296  df-irdg 6361  df-oadd 6411  df-omul 6412  df-ni 7278  df-mi 7280  df-enq 7321

This theorem is referenced by: (None)