Theorem recexnq 7577

Description: Existence of positive fraction reciprocal. (Contributed by Jim Kingdon, 20-Sep-2019.)

Assertion

Ref	Expression
recexnq	|- ( A e. Q. -> E. y ( y e. Q. /\ ( A .Q y ) = 1Q ) )

Distinct variable group:   y, A

Proof of Theorem recexnq

Dummy variables x z are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nqqs 7535	. 2 |- Q. = ( ( N. X. N. ) /. ~Q )
2		oveq1 6008	. . . . 5 |- ( [ <. x , z >. ] ~Q = A -> ( [ <. x , z >. ] ~Q .Q y ) = ( A .Q y ) )
3	2	eqeq1d 2238	. . . 4 |- ( [ <. x , z >. ] ~Q = A -> ( ( [ <. x , z >. ] ~Q .Q y ) = 1Q <-> ( A .Q y ) = 1Q ) )
4	3	anbi2d 464	. . 3 |- ( [ <. x , z >. ] ~Q = A -> ( ( y e. Q. /\ ( [ <. x , z >. ] ~Q .Q y ) = 1Q ) <-> ( y e. Q. /\ ( A .Q y ) = 1Q ) ) )
5	4	exbidv 1871	. 2 |- ( [ <. x , z >. ] ~Q = A -> ( E. y ( y e. Q. /\ ( [ <. x , z >. ] ~Q .Q y ) = 1Q ) <-> E. y ( y e. Q. /\ ( A .Q y ) = 1Q ) ) )
6		opelxpi 4751	. . . . . 6 |- ( ( z e. N. /\ x e. N. ) -> <. z , x >. e. ( N. X. N. ) )
7	6	ancoms 268	. . . . 5 |- ( ( x e. N. /\ z e. N. ) -> <. z , x >. e. ( N. X. N. ) )
8		enqex 7547	. . . . . 6 |- ~Q e. _V
9	8	ecelqsi 6736	. . . . 5 |- ( <. z , x >. e. ( N. X. N. ) -> [ <. z , x >. ] ~Q e. ( ( N. X. N. ) /. ~Q ) )
10	7, 9	syl 14	. . . 4 |- ( ( x e. N. /\ z e. N. ) -> [ <. z , x >. ] ~Q e. ( ( N. X. N. ) /. ~Q ) )
11	10, 1	eleqtrrdi 2323	. . 3 |- ( ( x e. N. /\ z e. N. ) -> [ <. z , x >. ] ~Q e. Q. )
12		mulcompig 7518	. . . . . . 7 |- ( ( x e. N. /\ z e. N. ) -> ( x .N z ) = ( z .N x ) )
13	12	opeq2d 3864	. . . . . 6 |- ( ( x e. N. /\ z e. N. ) -> <. ( x .N z ) , ( x .N z ) >. = <. ( x .N z ) , ( z .N x ) >. )
14	13	eceq1d 6716	. . . . 5 |- ( ( x e. N. /\ z e. N. ) -> [ <. ( x .N z ) , ( x .N z ) >. ] ~Q = [ <. ( x .N z ) , ( z .N x ) >. ] ~Q )
15		mulclpi 7515	. . . . . 6 |- ( ( x e. N. /\ z e. N. ) -> ( x .N z ) e. N. )
16		1qec 7575	. . . . . 6 |- ( ( x .N z ) e. N. -> 1Q = [ <. ( x .N z ) , ( x .N z ) >. ] ~Q )
17	15, 16	syl 14	. . . . 5 |- ( ( x e. N. /\ z e. N. ) -> 1Q = [ <. ( x .N z ) , ( x .N z ) >. ] ~Q )
18		mulpipqqs 7560	. . . . . . 7 |- ( ( ( x e. N. /\ z e. N. ) /\ ( z e. N. /\ x e. N. ) ) -> ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = [ <. ( x .N z ) , ( z .N x ) >. ] ~Q )
19	18	an42s 591	. . . . . 6 |- ( ( ( x e. N. /\ z e. N. ) /\ ( x e. N. /\ z e. N. ) ) -> ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = [ <. ( x .N z ) , ( z .N x ) >. ] ~Q )
20	19	anidms 397	. . . . 5 |- ( ( x e. N. /\ z e. N. ) -> ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = [ <. ( x .N z ) , ( z .N x ) >. ] ~Q )
21	14, 17, 20	3eqtr4rd 2273	. . . 4 |- ( ( x e. N. /\ z e. N. ) -> ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = 1Q )
22	11, 21	jca 306	. . 3 |- ( ( x e. N. /\ z e. N. ) -> ( [ <. z , x >. ] ~Q e. Q. /\ ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = 1Q ) )
23		eleq1 2292	. . . . 5 |- ( y = [ <. z , x >. ] ~Q -> ( y e. Q. <-> [ <. z , x >. ] ~Q e. Q. ) )
24		oveq2 6009	. . . . . 6 |- ( y = [ <. z , x >. ] ~Q -> ( [ <. x , z >. ] ~Q .Q y ) = ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) )
25	24	eqeq1d 2238	. . . . 5 |- ( y = [ <. z , x >. ] ~Q -> ( ( [ <. x , z >. ] ~Q .Q y ) = 1Q <-> ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = 1Q ) )
26	23, 25	anbi12d 473	. . . 4 |- ( y = [ <. z , x >. ] ~Q -> ( ( y e. Q. /\ ( [ <. x , z >. ] ~Q .Q y ) = 1Q ) <-> ( [ <. z , x >. ] ~Q e. Q. /\ ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = 1Q ) ) )
27	26	spcegv 2891	. . 3 |- ( [ <. z , x >. ] ~Q e. Q. -> ( ( [ <. z , x >. ] ~Q e. Q. /\ ( [ <. x , z >. ] ~Q .Q [ <. z , x >. ] ~Q ) = 1Q ) -> E. y ( y e. Q. /\ ( [ <. x , z >. ] ~Q .Q y ) = 1Q ) ) )
28	11, 22, 27	sylc 62	. 2 |- ( ( x e. N. /\ z e. N. ) -> E. y ( y e. Q. /\ ( [ <. x , z >. ] ~Q .Q y ) = 1Q ) )
29	1, 5, 28	ecoptocl 6769	1 |- ( A e. Q. -> E. y ( y e. Q. /\ ( A .Q y ) = 1Q ) )

Syntax hints:   -> wi 4   /\ wa 104   = wceq 1395   E.wex 1538   e. wcel 2200   <.cop 3669   X. cxp 4717  (class class class)co 6001   [cec 6678   /.cqs 6679   N.cnpi 7459   .N cmi 7461   ~Q ceq 7466   Q.cnq 7467   1Qc1q 7468   .Q cmq 7470

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-nul 4210  ax-pow 4258  ax-pr 4293  ax-un 4524  ax-setind 4629  ax-iinf 4680

This theorem depends on definitions:  df-bi 117  df-dc 840  df-3or 1003  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-ral 2513  df-rex 2514  df-reu 2515  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-tr 4183  df-id 4384  df-iord 4457  df-on 4459  df-suc 4462  df-iom 4683  df-xp 4725  df-rel 4726  df-cnv 4727  df-co 4728  df-dm 4729  df-rn 4730  df-res 4731  df-ima 4732  df-iota 5278  df-fun 5320  df-fn 5321  df-f 5322  df-f1 5323  df-fo 5324  df-f1o 5325  df-fv 5326  df-ov 6004  df-oprab 6005  df-mpo 6006  df-1st 6286  df-2nd 6287  df-recs 6451  df-irdg 6516  df-1o 6562  df-oadd 6566  df-omul 6567  df-er 6680  df-ec 6682  df-qs 6686  df-ni 7491  df-mi 7493  df-mpq 7532  df-enq 7534  df-nqqs 7535  df-mqqs 7537  df-1nqqs 7538

This theorem is referenced by:  recmulnqg  7578  recclnq  7579