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

Theorem prarloclemarch 7605
Description: A version of the Archimedean property. This variation is "stronger" than archnqq 7604 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 7579 . . . 4 (𝐵Q → (*Q𝐵) ∈ Q)
2 mulclnq 7563 . . . 4 ((𝐴Q ∧ (*Q𝐵) ∈ Q) → (𝐴 ·Q (*Q𝐵)) ∈ Q)
31, 2sylan2 286 . . 3 ((𝐴Q𝐵Q) → (𝐴 ·Q (*Q𝐵)) ∈ Q)
4 archnqq 7604 . . 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 7502 . . . . . . . . . . 11 1oN
8 opelxpi 4751 . . . . . . . . . . 11 ((𝑥N ∧ 1oN) → ⟨𝑥, 1o⟩ ∈ (N × N))
97, 8mpan2 425 . . . . . . . . . 10 (𝑥N → ⟨𝑥, 1o⟩ ∈ (N × N))
10 enqex 7547 . . . . . . . . . . 11 ~Q ∈ V
1110ecelqsi 6736 . . . . . . . . . 10 (⟨𝑥, 1o⟩ ∈ (N × N) → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
129, 11syl 14 . . . . . . . . 9 (𝑥N → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
13 df-nqqs 7535 . . . . . . . . 9 Q = ((N × N) / ~Q )
1412, 13eleqtrrdi 2323 . . . . . . . 8 (𝑥N → [⟨𝑥, 1o⟩] ~QQ)
1514adantl 277 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → [⟨𝑥, 1o⟩] ~QQ)
16 simplr 528 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → 𝐵Q)
17 mulclnq 7563 . . . . . . 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 7588 . . . . . 6 ((𝐴Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q ∧ (*Q𝐵) ∈ Q) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
216, 18, 19, 20syl3anc 1271 . . . . 5 (((𝐴Q𝐵Q) ∧ 𝑥N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
22 mulcomnqg 7570 . . . . . . 7 (((*Q𝐵) ∈ Q𝐴Q) → ((*Q𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q𝐵)))
2319, 6, 22syl2anc 411 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q𝐵)))
24 mulcomnqg 7570 . . . . . . . 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 7571 . . . . . . . . 9 (([⟨𝑥, 1o⟩] ~QQ𝐵Q ∧ (*Q𝐵) ∈ Q) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))))
2715, 16, 19, 26syl3anc 1271 . . . . . . . 8 (((𝐴Q𝐵Q) ∧ 𝑥N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))))
28 recidnq 7580 . . . . . . . . . 10 (𝐵Q → (𝐵 ·Q (*Q𝐵)) = 1Q)
2928oveq2d 6017 . . . . . . . . 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 7576 . . . . . . . . 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 2266 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = [⟨𝑥, 1o⟩] ~Q )
3425, 33eqtrd 2262 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = [⟨𝑥, 1o⟩] ~Q )
3523, 34breq12d 4096 . . . . 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 2632 . 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 1395  wcel 2200  wrex 2509  cop 3669   class class class wbr 4083   × cxp 4717  cfv 5318  (class class class)co 6001  1oc1o 6555  [cec 6678   / cqs 6679  Ncnpi 7459   ~Q ceq 7466  Qcnq 7467  1Qc1q 7468   ·Q cmq 7470  *Qcrq 7471   <Q cltq 7472
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-eprel 4380  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-pli 7492  df-mi 7493  df-lti 7494  df-mpq 7532  df-enq 7534  df-nqqs 7535  df-mqqs 7537  df-1nqqs 7538  df-rq 7539  df-ltnqqs 7540
This theorem is referenced by:  prarloclemarch2  7606
  Copyright terms: Public domain W3C validator