Theorem prarloclemarch 7785

Description: A version of the Archimedean property. This variation is "stronger" than archnqq 7784 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

Step	Hyp	Ref	Expression
1		recclnq 7759	. . . 4 ⊢ (𝐵 ∈ Q → (*Q‘𝐵) ∈ Q)
2		mulclnq 7743	. . . 4 ⊢ ((𝐴 ∈ Q ∧ (*Q‘𝐵) ∈ Q) → (𝐴 ·Q (*Q‘𝐵)) ∈ Q)
3	1, 2	sylan2 286	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q (*Q‘𝐵)) ∈ Q)
4		archnqq 7784	. . 3 ⊢ ((𝐴 ·Q (*Q‘𝐵)) ∈ Q → ∃𝑥 ∈ N (𝐴 ·Q (*Q‘𝐵)) <Q [⟨𝑥, 1o⟩] ~Q )
5	3, 4	syl 14	. 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ∃𝑥 ∈ N (𝐴 ·Q (*Q‘𝐵)) <Q [⟨𝑥, 1o⟩] ~Q )
6		simpll 531	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → 𝐴 ∈ Q)
7		1pi 7682	. . . . . . . . . . 11 ⊢ 1o ∈ N
8		opelxpi 4806	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ N ∧ 1o ∈ N) → ⟨𝑥, 1o⟩ ∈ (N × N))
9	7, 8	mpan2 429	. . . . . . . . . 10 ⊢ (𝑥 ∈ N → ⟨𝑥, 1o⟩ ∈ (N × N))
10		enqex 7727	. . . . . . . . . . 11 ⊢ ~Q ∈ V
11	10	ecelqsi 6863	. . . . . . . . . 10 ⊢ (⟨𝑥, 1o⟩ ∈ (N × N) → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
12	9, 11	syl 14	. . . . . . . . 9 ⊢ (𝑥 ∈ N → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
13		df-nqqs 7715	. . . . . . . . 9 ⊢ Q = ((N × N) / ~Q )
14	12, 13	eleqtrrdi 2332	. . . . . . . 8 ⊢ (𝑥 ∈ N → [⟨𝑥, 1o⟩] ~Q ∈ Q)
15	14	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → [⟨𝑥, 1o⟩] ~Q ∈ Q)
16		simplr 533	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → 𝐵 ∈ Q)
17		mulclnq 7743	. . . . . . 7 ⊢ (([⟨𝑥, 1o⟩] ~Q ∈ Q ∧ 𝐵 ∈ Q) → ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q)
18	15, 16, 17	syl2anc 415	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q)
19	16, 1	syl 14	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (*Q‘𝐵) ∈ Q)
20		ltmnqg 7768	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q ∧ (*Q‘𝐵) ∈ Q) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q‘𝐵) ·Q 𝐴) <Q ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
21	6, 18, 19, 20	syl3anc 1278	. . . . 5 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q‘𝐵) ·Q 𝐴) <Q ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
22		mulcomnqg 7750	. . . . . . 7 ⊢ (((*Q‘𝐵) ∈ Q ∧ 𝐴 ∈ Q) → ((*Q‘𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q‘𝐵)))
23	19, 6, 22	syl2anc 415	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((*Q‘𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q‘𝐵)))
24		mulcomnqg 7750	. . . . . . . 8 ⊢ (((*Q‘𝐵) ∈ Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q) → ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)))
25	19, 18, 24	syl2anc 415	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)))
26		mulassnqg 7751	. . . . . . . . 9 ⊢ (([⟨𝑥, 1o⟩] ~Q ∈ Q ∧ 𝐵 ∈ Q ∧ (*Q‘𝐵) ∈ Q) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q‘𝐵))))
27	15, 16, 19, 26	syl3anc 1278	. . . . . . . 8 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q‘𝐵))))
28		recidnq 7760	. . . . . . . . . 10 ⊢ (𝐵 ∈ Q → (𝐵 ·Q (*Q‘𝐵)) = 1Q)
29	28	oveq2d 6101	. . . . . . . . 9 ⊢ (𝐵 ∈ Q → ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q‘𝐵))) = ([⟨𝑥, 1o⟩] ~Q ·Q 1Q))
30	16, 29	syl 14	. . . . . . . 8 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q‘𝐵))) = ([⟨𝑥, 1o⟩] ~Q ·Q 1Q))
31		mulidnq 7756	. . . . . . . . 9 ⊢ ([⟨𝑥, 1o⟩] ~Q ∈ Q → ([⟨𝑥, 1o⟩] ~Q ·Q 1Q) = [⟨𝑥, 1o⟩] ~Q )
32	15, 31	syl 14	. . . . . . . 8 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ([⟨𝑥, 1o⟩] ~Q ·Q 1Q) = [⟨𝑥, 1o⟩] ~Q )
33	27, 30, 32	3eqtrd 2275	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)) = [⟨𝑥, 1o⟩] ~Q )
34	25, 33	eqtrd 2271	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = [⟨𝑥, 1o⟩] ~Q )
35	23, 34	breq12d 4143	. . . . 5 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (((*Q‘𝐵) ·Q 𝐴) <Q ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) ↔ (𝐴 ·Q (*Q‘𝐵)) <Q [⟨𝑥, 1o⟩] ~Q ))
36	21, 35	bitrd 188	. . . 4 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ (𝐴 ·Q (*Q‘𝐵)) <Q [⟨𝑥, 1o⟩] ~Q ))
37	36	biimprd 158	. . 3 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((𝐴 ·Q (*Q‘𝐵)) <Q [⟨𝑥, 1o⟩] ~Q → 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)))
38	37	reximdva 2652	. 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (∃𝑥 ∈ N (𝐴 ·Q (*Q‘𝐵)) <Q [⟨𝑥, 1o⟩] ~Q → ∃𝑥 ∈ N 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)))
39	5, 38	mpd 13	1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ∃𝑥 ∈ N 𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ∃wrex 2529  ⟨cop 3712   class class class wbr 4130   × cxp 4772  ‘cfv 5377  (class class class)co 6085  1_oc1o 6680  [cec 6805   / cqs 6806  Ncnpi 7639   ~_Q ceq 7646  Qcnq 7647  1_Qc1q 7648   ·_Q cmq 7650  *_Qcrq 7651   <_Q cltq 7652

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-eprel 4434  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-lti 7674  df-mpq 7712  df-enq 7714  df-nqqs 7715  df-mqqs 7717  df-1nqqs 7718  df-rq 7719  df-ltnqqs 7720

This theorem is used by:  prarloclemarch2  7786