Theorem recexnq 7609

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

Assertion

Ref	Expression
recexnq	⊢ (𝐴 ∈ Q → ∃𝑦(𝑦 ∈ Q ∧ (𝐴 ·Q 𝑦) = 1Q))

Distinct variable group:   𝑦,𝐴

Proof of Theorem recexnq

Dummy variables 𝑥 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nqqs 7567	. 2 ⊢ Q = ((N × N) / ~Q )
2		oveq1 6024	. . . . 5 ⊢ ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = (𝐴 ·Q 𝑦))
3	2	eqeq1d 2240	. . . 4 ⊢ ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → (([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q ↔ (𝐴 ·Q 𝑦) = 1Q))
4	3	anbi2d 464	. . 3 ⊢ ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → ((𝑦 ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q) ↔ (𝑦 ∈ Q ∧ (𝐴 ·Q 𝑦) = 1Q)))
5	4	exbidv 1873	. 2 ⊢ ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → (∃𝑦(𝑦 ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q) ↔ ∃𝑦(𝑦 ∈ Q ∧ (𝐴 ·Q 𝑦) = 1Q)))
6		opelxpi 4757	. . . . . 6 ⊢ ((𝑧 ∈ N ∧ 𝑥 ∈ N) → ⟨𝑧, 𝑥⟩ ∈ (N × N))
7	6	ancoms 268	. . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → ⟨𝑧, 𝑥⟩ ∈ (N × N))
8		enqex 7579	. . . . . 6 ⊢ ~Q ∈ V
9	8	ecelqsi 6757	. . . . 5 ⊢ (⟨𝑧, 𝑥⟩ ∈ (N × N) → [⟨𝑧, 𝑥⟩] ~Q ∈ ((N × N) / ~Q ))
10	7, 9	syl 14	. . . 4 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → [⟨𝑧, 𝑥⟩] ~Q ∈ ((N × N) / ~Q ))
11	10, 1	eleqtrrdi 2325	. . 3 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → [⟨𝑧, 𝑥⟩] ~Q ∈ Q)
12		mulcompig 7550	. . . . . . 7 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → (𝑥 ·N 𝑧) = (𝑧 ·N 𝑥))
13	12	opeq2d 3869	. . . . . 6 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → ⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩ = ⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩)
14	13	eceq1d 6737	. . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → [⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩] ~Q = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
15		mulclpi 7547	. . . . . 6 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → (𝑥 ·N 𝑧) ∈ N)
16		1qec 7607	. . . . . 6 ⊢ ((𝑥 ·N 𝑧) ∈ N → 1Q = [⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩] ~Q )
17	15, 16	syl 14	. . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → 1Q = [⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩] ~Q )
18		mulpipqqs 7592	. . . . . . 7 ⊢ (((𝑥 ∈ N ∧ 𝑧 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑥 ∈ N)) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
19	18	an42s 593	. . . . . 6 ⊢ (((𝑥 ∈ N ∧ 𝑧 ∈ N) ∧ (𝑥 ∈ N ∧ 𝑧 ∈ N)) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
20	19	anidms 397	. . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
21	14, 17, 20	3eqtr4rd 2275	. . . 4 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q)
22	11, 21	jca 306	. . 3 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → ([⟨𝑧, 𝑥⟩] ~Q ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q))
23		eleq1 2294	. . . . 5 ⊢ (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → (𝑦 ∈ Q ↔ [⟨𝑧, 𝑥⟩] ~Q ∈ Q))
24		oveq2 6025	. . . . . 6 ⊢ (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ))
25	24	eqeq1d 2240	. . . . 5 ⊢ (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → (([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q ↔ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q))
26	23, 25	anbi12d 473	. . . 4 ⊢ (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → ((𝑦 ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q) ↔ ([⟨𝑧, 𝑥⟩] ~Q ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q)))
27	26	spcegv 2894	. . 3 ⊢ ([⟨𝑧, 𝑥⟩] ~Q ∈ Q → (([⟨𝑧, 𝑥⟩] ~Q ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q) → ∃𝑦(𝑦 ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q)))
28	11, 22, 27	sylc 62	. 2 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → ∃𝑦(𝑦 ∈ Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q))
29	1, 5, 28	ecoptocl 6790	1 ⊢ (𝐴 ∈ Q → ∃𝑦(𝑦 ∈ Q ∧ (𝐴 ·Q 𝑦) = 1Q))

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1397  ∃wex 1540   ∈ wcel 2202  ⟨cop 3672   × cxp 4723  (class class class)co 6017  [cec 6699   / cqs 6700  Ncnpi 7491   ·_N cmi 7493   ~_Q ceq 7498  Qcnq 7499  1_Qc1q 7500   ·_Q cmq 7502

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-id 4390  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-recs 6470  df-irdg 6535  df-1o 6581  df-oadd 6585  df-omul 6586  df-er 6701  df-ec 6703  df-qs 6707  df-ni 7523  df-mi 7525  df-mpq 7564  df-enq 7566  df-nqqs 7567  df-mqqs 7569  df-1nqqs 7570

This theorem is referenced by:  recmulnqg  7610  recclnq  7611