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

Theorem prarloclemarch 7408
Description: A version of the Archimedean property. This variation is "stronger" than archnqq 7407 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 7382 . . . 4 (𝐵Q → (*Q𝐵) ∈ Q)
2 mulclnq 7366 . . . 4 ((𝐴Q ∧ (*Q𝐵) ∈ Q) → (𝐴 ·Q (*Q𝐵)) ∈ Q)
31, 2sylan2 286 . . 3 ((𝐴Q𝐵Q) → (𝐴 ·Q (*Q𝐵)) ∈ Q)
4 archnqq 7407 . . 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 7305 . . . . . . . . . . 11 1oN
8 opelxpi 4655 . . . . . . . . . . 11 ((𝑥N ∧ 1oN) → ⟨𝑥, 1o⟩ ∈ (N × N))
97, 8mpan2 425 . . . . . . . . . 10 (𝑥N → ⟨𝑥, 1o⟩ ∈ (N × N))
10 enqex 7350 . . . . . . . . . . 11 ~Q ∈ V
1110ecelqsi 6583 . . . . . . . . . 10 (⟨𝑥, 1o⟩ ∈ (N × N) → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
129, 11syl 14 . . . . . . . . 9 (𝑥N → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
13 df-nqqs 7338 . . . . . . . . 9 Q = ((N × N) / ~Q )
1412, 13eleqtrrdi 2271 . . . . . . . 8 (𝑥N → [⟨𝑥, 1o⟩] ~QQ)
1514adantl 277 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → [⟨𝑥, 1o⟩] ~QQ)
16 simplr 528 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → 𝐵Q)
17 mulclnq 7366 . . . . . . 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 7391 . . . . . 6 ((𝐴Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q ∧ (*Q𝐵) ∈ Q) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
216, 18, 19, 20syl3anc 1238 . . . . 5 (((𝐴Q𝐵Q) ∧ 𝑥N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q𝐵) ·Q 𝐴) <Q ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
22 mulcomnqg 7373 . . . . . . 7 (((*Q𝐵) ∈ Q𝐴Q) → ((*Q𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q𝐵)))
2319, 6, 22syl2anc 411 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q𝐵)))
24 mulcomnqg 7373 . . . . . . . 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 7374 . . . . . . . . 9 (([⟨𝑥, 1o⟩] ~QQ𝐵Q ∧ (*Q𝐵) ∈ Q) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))))
2715, 16, 19, 26syl3anc 1238 . . . . . . . 8 (((𝐴Q𝐵Q) ∧ 𝑥N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q𝐵))))
28 recidnq 7383 . . . . . . . . . 10 (𝐵Q → (𝐵 ·Q (*Q𝐵)) = 1Q)
2928oveq2d 5885 . . . . . . . . 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 7379 . . . . . . . . 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 2214 . . . . . . 7 (((𝐴Q𝐵Q) ∧ 𝑥N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q𝐵)) = [⟨𝑥, 1o⟩] ~Q )
3425, 33eqtrd 2210 . . . . . 6 (((𝐴Q𝐵Q) ∧ 𝑥N) → ((*Q𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = [⟨𝑥, 1o⟩] ~Q )
3523, 34breq12d 4013 . . . . 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 2579 . 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 1353  wcel 2148  wrex 2456  cop 3594   class class class wbr 4000   × cxp 4621  cfv 5212  (class class class)co 5869  1oc1o 6404  [cec 6527   / cqs 6528  Ncnpi 7262   ~Q ceq 7269  Qcnq 7270  1Qc1q 7271   ·Q cmq 7273  *Qcrq 7274   <Q cltq 7275
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4115  ax-sep 4118  ax-nul 4126  ax-pow 4171  ax-pr 4206  ax-un 4430  ax-setind 4533  ax-iinf 4584
This theorem depends on definitions:  df-bi 117  df-dc 835  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2739  df-sbc 2963  df-csb 3058  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-nul 3423  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-int 3843  df-iun 3886  df-br 4001  df-opab 4062  df-mpt 4063  df-tr 4099  df-eprel 4286  df-id 4290  df-iord 4363  df-on 4365  df-suc 4368  df-iom 4587  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-res 4635  df-ima 4636  df-iota 5174  df-fun 5214  df-fn 5215  df-f 5216  df-f1 5217  df-fo 5218  df-f1o 5219  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-recs 6300  df-irdg 6365  df-1o 6411  df-oadd 6415  df-omul 6416  df-er 6529  df-ec 6531  df-qs 6535  df-ni 7294  df-pli 7295  df-mi 7296  df-lti 7297  df-mpq 7335  df-enq 7337  df-nqqs 7338  df-mqqs 7340  df-1nqqs 7341  df-rq 7342  df-ltnqqs 7343
This theorem is referenced by:  prarloclemarch2  7409
  Copyright terms: Public domain W3C validator