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

Theorem prarloclemarch 7531
Description: A version of the Archimedean property. This variation is "stronger" than archnqq 7530 in the sense that we provide an integer which is larger than a given rational 𝐴 even after being multiplied by a second rational 𝐵. (Contributed by Jim Kingdon, 30-Nov-2019.)
Assertion
Ref Expression
prarloclemarch ((𝐴Q𝐵Q) → ∃𝑥N 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem prarloclemarch
StepHypRef Expression
1 recclnq 7505 . . . 4 (𝐵Q → (*Q𝐵) ∈ Q)
2 mulclnq 7489 . . . 4 ((𝐴Q ∧ (*Q𝐵) ∈ Q) → (𝐴 ·Q (*Q𝐵)) ∈ Q)
31, 2sylan2 286 . . 3 ((𝐴Q𝐵Q) → (𝐴 ·Q (*Q𝐵)) ∈ Q)
4 archnqq 7530 . . 3 ((𝐴 ·Q (*Q𝐵)) ∈ Q → ∃𝑥N (𝐴 ·Q (*Q𝐵)) <Q [⟨𝑥, 1o⟩] ~Q )
53, 4syl 14 . 2 ((𝐴Q𝐵Q) → ∃𝑥N (𝐴 ·Q (*Q𝐵)) <Q [⟨𝑥, 1o⟩] ~Q )
6 simpll 527 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → 𝐴Q)
7 1pi 7428 . . . . . . . . . . 11 1oN
8 opelxpi 4707 . . . . . . . . . . 11 ((𝑥N ∧ 1oN) → ⟨𝑥, 1o⟩ ∈ (N × N))
97, 8mpan2 425 . . . . . . . . . 10 (𝑥N → ⟨𝑥, 1o⟩ ∈ (N × N))
10 enqex 7473 . . . . . . . . . . 11 ~Q ∈ V
1110ecelqsi 6676 . . . . . . . . . 10 (⟨𝑥, 1o⟩ ∈ (N × N) → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
129, 11syl 14 . . . . . . . . 9 (𝑥N → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
13 df-nqqs 7461 . . . . . . . . 9 Q = ((N × N) / ~Q )
1412, 13eleqtrrdi 2299 . . . . . . . 8 (𝑥N → [⟨𝑥, 1o⟩] ~QQ)
1514adantl 277 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → [⟨𝑥, 1o⟩] ~QQ)
16 simplr 528 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → 𝐵Q)
17 mulclnq 7489 . . . . . . 7 (([⟨𝑥, 1o⟩] ~QQ𝐵Q) → ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q)
1815, 16, 17syl2anc 411 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q)
1916, 1syl 14 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → (*Q𝐵) ∈ Q)
20 ltmnqg 7514 . . . . . 6 ((𝐴Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q ∧ (*Q𝐵) ∈ Q) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
216, 18, 19, 20syl3anc 1250 . . . . 5 (((𝐴Q𝐵Q) ∧ 𝑥N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
22 mulcomnqg 7496 . . . . . . 7 (((*Q𝐵) ∈ Q𝐴Q) → ((*Q𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q𝐵)))
2319, 6, 22syl2anc 411 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q𝐵)))
24 mulcomnqg 7496 . . . . . . . 8 (((*Q𝐵) ∈ Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q) → ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)))
2519, 18, 24syl2anc 411 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)))
26 mulassnqg 7497 . . . . . . . . 9 (([⟨𝑥, 1o⟩] ~QQ𝐵Q ∧ (*Q𝐵) ∈ Q) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))))
2715, 16, 19, 26syl3anc 1250 . . . . . . . 8 (((𝐴Q𝐵Q) ∧ 𝑥N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))))
28 recidnq 7506 . . . . . . . . . 10 (𝐵Q → (𝐵 ·Q (*Q𝐵)) = 1Q)
2928oveq2d 5960 . . . . . . . . 9 (𝐵Q → ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))) = ([⟨𝑥, 1o⟩] ~Q ·Q 1Q))
3016, 29syl 14 . . . . . . . 8 (((𝐴Q𝐵Q) ∧ 𝑥N) → ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))) = ([⟨𝑥, 1o⟩] ~Q ·Q 1Q))
31 mulidnq 7502 . . . . . . . . 9 ([⟨𝑥, 1o⟩] ~QQ → ([⟨𝑥, 1o⟩] ~Q ·Q 1Q) = [⟨𝑥, 1o⟩] ~Q )
3215, 31syl 14 . . . . . . . 8 (((𝐴Q𝐵Q) ∧ 𝑥N) → ([⟨𝑥, 1o⟩] ~Q ·Q 1Q) = [⟨𝑥, 1o⟩] ~Q )
3327, 30, 323eqtrd 2242 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = [⟨𝑥, 1o⟩] ~Q )
3425, 33eqtrd 2238 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = [⟨𝑥, 1o⟩] ~Q )
3523, 34breq12d 4057 . . . . 5 (((𝐴Q𝐵Q) ∧ 𝑥N) → (((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) ↔ (𝐴 ·Q (*Q𝐵)) <Q [⟨𝑥, 1o⟩] ~Q ))
3621, 35bitrd 188 . . . 4 (((𝐴Q𝐵Q) ∧ 𝑥N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ (𝐴 ·Q (*Q𝐵)) <Q [⟨𝑥, 1o⟩] ~Q ))
3736biimprd 158 . . 3 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((𝐴 ·Q (*Q𝐵)) <Q [⟨𝑥, 1o⟩] ~Q𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)))
3837reximdva 2608 . 2 ((𝐴Q𝐵Q) → (∃𝑥N (𝐴 ·Q (*Q𝐵)) <Q [⟨𝑥, 1o⟩] ~Q → ∃𝑥N 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)))
395, 38mpd 13 1 ((𝐴Q𝐵Q) → ∃𝑥N 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105   = wceq 1373  wcel 2176  wrex 2485  cop 3636   class class class wbr 4044   × cxp 4673  cfv 5271  (class class class)co 5944  1oc1o 6495  [cec 6618   / cqs 6619  Ncnpi 7385   ~Q ceq 7392  Qcnq 7393  1Qc1q 7394   ·Q cmq 7396  *Qcrq 7397   <Q cltq 7398
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 615  ax-in2 616  ax-io 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-13 2178  ax-14 2179  ax-ext 2187  ax-coll 4159  ax-sep 4162  ax-nul 4170  ax-pow 4218  ax-pr 4253  ax-un 4480  ax-setind 4585  ax-iinf 4636
This theorem depends on definitions:  df-bi 117  df-dc 837  df-3or 982  df-3an 983  df-tru 1376  df-fal 1379  df-nf 1484  df-sb 1786  df-eu 2057  df-mo 2058  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-ne 2377  df-ral 2489  df-rex 2490  df-reu 2491  df-rab 2493  df-v 2774  df-sbc 2999  df-csb 3094  df-dif 3168  df-un 3170  df-in 3172  df-ss 3179  df-nul 3461  df-pw 3618  df-sn 3639  df-pr 3640  df-op 3642  df-uni 3851  df-int 3886  df-iun 3929  df-br 4045  df-opab 4106  df-mpt 4107  df-tr 4143  df-eprel 4336  df-id 4340  df-iord 4413  df-on 4415  df-suc 4418  df-iom 4639  df-xp 4681  df-rel 4682  df-cnv 4683  df-co 4684  df-dm 4685  df-rn 4686  df-res 4687  df-ima 4688  df-iota 5232  df-fun 5273  df-fn 5274  df-f 5275  df-f1 5276  df-fo 5277  df-f1o 5278  df-fv 5279  df-ov 5947  df-oprab 5948  df-mpo 5949  df-1st 6226  df-2nd 6227  df-recs 6391  df-irdg 6456  df-1o 6502  df-oadd 6506  df-omul 6507  df-er 6620  df-ec 6622  df-qs 6626  df-ni 7417  df-pli 7418  df-mi 7419  df-lti 7420  df-mpq 7458  df-enq 7460  df-nqqs 7461  df-mqqs 7463  df-1nqqs 7464  df-rq 7465  df-ltnqqs 7466
This theorem is referenced by:  prarloclemarch2  7532
  Copyright terms: Public domain W3C validator