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

Theorem recexnq 7705
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.
StepHypRef Expression
1 df-nqqs 7663 . 2 Q = ((N × N) / ~Q )
2 oveq1 6057 . . . . 5 ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = (𝐴 ·Q 𝑦))
32eqeq1d 2241 . . . 4 ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → (([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q ↔ (𝐴 ·Q 𝑦) = 1Q))
43anbi2d 464 . . 3 ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → ((𝑦Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q) ↔ (𝑦Q ∧ (𝐴 ·Q 𝑦) = 1Q)))
54exbidv 1874 . 2 ([⟨𝑥, 𝑧⟩] ~Q = 𝐴 → (∃𝑦(𝑦Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q) ↔ ∃𝑦(𝑦Q ∧ (𝐴 ·Q 𝑦) = 1Q)))
6 opelxpi 4781 . . . . . 6 ((𝑧N𝑥N) → ⟨𝑧, 𝑥⟩ ∈ (N × N))
76ancoms 268 . . . . 5 ((𝑥N𝑧N) → ⟨𝑧, 𝑥⟩ ∈ (N × N))
8 enqex 7675 . . . . . 6 ~Q ∈ V
98ecelqsi 6823 . . . . 5 (⟨𝑧, 𝑥⟩ ∈ (N × N) → [⟨𝑧, 𝑥⟩] ~Q ∈ ((N × N) / ~Q ))
107, 9syl 14 . . . 4 ((𝑥N𝑧N) → [⟨𝑧, 𝑥⟩] ~Q ∈ ((N × N) / ~Q ))
1110, 1eleqtrrdi 2326 . . 3 ((𝑥N𝑧N) → [⟨𝑧, 𝑥⟩] ~QQ)
12 mulcompig 7646 . . . . . . 7 ((𝑥N𝑧N) → (𝑥 ·N 𝑧) = (𝑧 ·N 𝑥))
1312opeq2d 3890 . . . . . 6 ((𝑥N𝑧N) → ⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩ = ⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩)
1413eceq1d 6803 . . . . 5 ((𝑥N𝑧N) → [⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩] ~Q = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
15 mulclpi 7643 . . . . . 6 ((𝑥N𝑧N) → (𝑥 ·N 𝑧) ∈ N)
16 1qec 7703 . . . . . 6 ((𝑥 ·N 𝑧) ∈ N → 1Q = [⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩] ~Q )
1715, 16syl 14 . . . . 5 ((𝑥N𝑧N) → 1Q = [⟨(𝑥 ·N 𝑧), (𝑥 ·N 𝑧)⟩] ~Q )
18 mulpipqqs 7688 . . . . . . 7 (((𝑥N𝑧N) ∧ (𝑧N𝑥N)) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
1918an42s 593 . . . . . 6 (((𝑥N𝑧N) ∧ (𝑥N𝑧N)) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
2019anidms 397 . . . . 5 ((𝑥N𝑧N) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = [⟨(𝑥 ·N 𝑧), (𝑧 ·N 𝑥)⟩] ~Q )
2114, 17, 203eqtr4rd 2276 . . . 4 ((𝑥N𝑧N) → ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q)
2211, 21jca 306 . . 3 ((𝑥N𝑧N) → ([⟨𝑧, 𝑥⟩] ~QQ ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q))
23 eleq1 2295 . . . . 5 (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → (𝑦Q ↔ [⟨𝑧, 𝑥⟩] ~QQ))
24 oveq2 6058 . . . . . 6 (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ))
2524eqeq1d 2241 . . . . 5 (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → (([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q ↔ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q))
2623, 25anbi12d 473 . . . 4 (𝑦 = [⟨𝑧, 𝑥⟩] ~Q → ((𝑦Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q) ↔ ([⟨𝑧, 𝑥⟩] ~QQ ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q)))
2726spcegv 2905 . . 3 ([⟨𝑧, 𝑥⟩] ~QQ → (([⟨𝑧, 𝑥⟩] ~QQ ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q [⟨𝑧, 𝑥⟩] ~Q ) = 1Q) → ∃𝑦(𝑦Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q)))
2811, 22, 27sylc 62 . 2 ((𝑥N𝑧N) → ∃𝑦(𝑦Q ∧ ([⟨𝑥, 𝑧⟩] ~Q ·Q 𝑦) = 1Q))
291, 5, 28ecoptocl 6856 1 (𝐴Q → ∃𝑦(𝑦Q ∧ (𝐴 ·Q 𝑦) = 1Q))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wex 1541  wcel 2203  cop 3692   × cxp 4747  (class class class)co 6050  [cec 6765   / cqs 6766  Ncnpi 7587   ·N cmi 7589   ~Q ceq 7594  Qcnq 7595  1Qc1q 7596   ·Q cmq 7598
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4225  ax-sep 4228  ax-nul 4236  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-iinf 4710
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-iun 3993  df-br 4110  df-opab 4172  df-mpt 4173  df-tr 4209  df-id 4414  df-iord 4487  df-on 4489  df-suc 4492  df-iom 4713  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-f1 5357  df-fo 5358  df-f1o 5359  df-fv 5360  df-ov 6053  df-oprab 6054  df-mpo 6055  df-1st 6334  df-2nd 6335  df-recs 6536  df-irdg 6601  df-1o 6647  df-oadd 6651  df-omul 6652  df-er 6767  df-ec 6769  df-qs 6773  df-ni 7619  df-mi 7621  df-mpq 7660  df-enq 7662  df-nqqs 7663  df-mqqs 7665  df-1nqqs 7666
This theorem is referenced by:  recmulnqg  7706  recclnq  7707
  Copyright terms: Public domain W3C validator