Theorem prarloclemarch 7751

Description: A version of the Archimedean property. This variation is "stronger" than archnqq 7750 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 7725	. . . 4 ⊢ (𝐵 ∈ Q → (*Q‘𝐵) ∈ Q)
2		mulclnq 7709	. . . 4 ⊢ ((𝐴 ∈ Q ∧ (*Q‘𝐵) ∈ Q) → (𝐴 ·Q (*Q‘𝐵)) ∈ Q)
3	1, 2	sylan2 286	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q (*Q‘𝐵)) ∈ Q)
4		archnqq 7750	. . 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 527	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → 𝐴 ∈ Q)
7		1pi 7648	. . . . . . . . . . 11 ⊢ 1o ∈ N
8		opelxpi 4788	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ N ∧ 1o ∈ N) → ⟨𝑥, 1o⟩ ∈ (N × N))
9	7, 8	mpan2 425	. . . . . . . . . 10 ⊢ (𝑥 ∈ N → ⟨𝑥, 1o⟩ ∈ (N × N))
10		enqex 7693	. . . . . . . . . . 11 ⊢ ~Q ∈ V
11	10	ecelqsi 6838	. . . . . . . . . 10 ⊢ (⟨𝑥, 1o⟩ ∈ (N × N) → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
12	9, 11	syl 14	. . . . . . . . 9 ⊢ (𝑥 ∈ N → [⟨𝑥, 1o⟩] ~Q ∈ ((N × N) / ~Q ))
13		df-nqqs 7681	. . . . . . . . 9 ⊢ Q = ((N × N) / ~Q )
14	12, 13	eleqtrrdi 2328	. . . . . . . 8 ⊢ (𝑥 ∈ N → [⟨𝑥, 1o⟩] ~Q ∈ Q)
15	14	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → [⟨𝑥, 1o⟩] ~Q ∈ Q)
16		simplr 529	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → 𝐵 ∈ Q)
17		mulclnq 7709	. . . . . . 7 ⊢ (([⟨𝑥, 1o⟩] ~Q ∈ Q ∧ 𝐵 ∈ Q) → ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q)
18	15, 16, 17	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q)
19	16, 1	syl 14	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (*Q‘𝐵) ∈ Q)
20		ltmnqg 7734	. . . . . 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 1274	. . . . 5 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (𝐴 <Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ↔ ((*Q‘𝐵) ·Q 𝐴) <Q ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵))))
22		mulcomnqg 7716	. . . . . . 7 ⊢ (((*Q‘𝐵) ∈ Q ∧ 𝐴 ∈ Q) → ((*Q‘𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q‘𝐵)))
23	19, 6, 22	syl2anc 411	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((*Q‘𝐵) ·Q 𝐴) = (𝐴 ·Q (*Q‘𝐵)))
24		mulcomnqg 7716	. . . . . . . 8 ⊢ (((*Q‘𝐵) ∈ Q ∧ ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ∈ Q) → ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)))
25	19, 18, 24	syl2anc 411	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)))
26		mulassnqg 7717	. . . . . . . . 9 ⊢ (([⟨𝑥, 1o⟩] ~Q ∈ Q ∧ 𝐵 ∈ Q ∧ (*Q‘𝐵) ∈ Q) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q‘𝐵))))
27	15, 16, 19, 26	syl3anc 1274	. . . . . . . 8 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)) = ([⟨𝑥, 1o⟩] ~Q ·Q (𝐵 ·Q (*Q‘𝐵))))
28		recidnq 7726	. . . . . . . . . 10 ⊢ (𝐵 ∈ Q → (𝐵 ·Q (*Q‘𝐵)) = 1Q)
29	28	oveq2d 6076	. . . . . . . . 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 7722	. . . . . . . . 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 2271	. . . . . . 7 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → (([⟨𝑥, 1o⟩] ~Q ·Q 𝐵) ·Q (*Q‘𝐵)) = [⟨𝑥, 1o⟩] ~Q )
34	25, 33	eqtrd 2267	. . . . . 6 ⊢ (((𝐴 ∈ Q ∧ 𝐵 ∈ Q) ∧ 𝑥 ∈ N) → ((*Q‘𝐵) ·Q ([⟨𝑥, 1o⟩] ~Q ·Q 𝐵)) = [⟨𝑥, 1o⟩] ~Q )
35	23, 34	breq12d 4128	. . . . 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 2646	. 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 𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1398   ∈ wcel 2205  ∃wrex 2523  ⟨cop 3698   class class class wbr 4115   × cxp 4754  ‘cfv 5359  (class class class)co 6060  1_oc1o 6655  [cec 6780   / cqs 6781  Ncnpi 7605   ~_Q ceq 7612  Qcnq 7613  1_Qc1q 7614   ·_Q cmq 7616  *_Qcrq 7617   <_Q cltq 7618

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-14 2208  ax-ext 2216  ax-coll 4231  ax-sep 4234  ax-nul 4242  ax-pow 4293  ax-pr 4328  ax-un 4560  ax-setind 4666  ax-iinf 4717

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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3677  df-sn 3701  df-pr 3702  df-op 3704  df-uni 3921  df-int 3956  df-iun 3999  df-br 4116  df-opab 4178  df-mpt 4179  df-tr 4215  df-eprel 4416  df-id 4420  df-iord 4493  df-on 4495  df-suc 4498  df-iom 4720  df-xp 4762  df-rel 4763  df-cnv 4764  df-co 4765  df-dm 4766  df-rn 4767  df-res 4768  df-ima 4769  df-iota 5319  df-fun 5361  df-fn 5362  df-f 5363  df-f1 5364  df-fo 5365  df-f1o 5366  df-fv 5367  df-ov 6063  df-oprab 6064  df-mpo 6065  df-1st 6349  df-2nd 6350  df-recs 6551  df-irdg 6616  df-1o 6662  df-oadd 6666  df-omul 6667  df-er 6782  df-ec 6784  df-qs 6788  df-ni 7637  df-pli 7638  df-mi 7639  df-lti 7640  df-mpq 7678  df-enq 7680  df-nqqs 7681  df-mqqs 7683  df-1nqqs 7684  df-rq 7685  df-ltnqqs 7686

This theorem is referenced by:  prarloclemarch2  7752