Metamath Proof Explorer


Theorem archnq

Description: For any fraction, there is an integer that is greater than it. This is also known as the "archimedean property". (Contributed by Mario Carneiro, 10-May-2013) (New usage is discouraged.)

Ref Expression
Assertion archnq A 𝑸 x 𝑵 A < 𝑸 x 1 𝑜

Proof

Step Hyp Ref Expression
1 elpqn A 𝑸 A 𝑵 × 𝑵
2 xp1st A 𝑵 × 𝑵 1 st A 𝑵
3 1 2 syl A 𝑸 1 st A 𝑵
4 1pi 1 𝑜 𝑵
5 addclpi 1 st A 𝑵 1 𝑜 𝑵 1 st A + 𝑵 1 𝑜 𝑵
6 3 4 5 sylancl A 𝑸 1 st A + 𝑵 1 𝑜 𝑵
7 xp2nd A 𝑵 × 𝑵 2 nd A 𝑵
8 1 7 syl A 𝑸 2 nd A 𝑵
9 mulclpi 1 st A + 𝑵 1 𝑜 𝑵 2 nd A 𝑵 1 st A + 𝑵 1 𝑜 𝑵 2 nd A 𝑵
10 6 8 9 syl2anc A 𝑸 1 st A + 𝑵 1 𝑜 𝑵 2 nd A 𝑵
11 eqid 1 st A + 𝑵 1 𝑜 = 1 st A + 𝑵 1 𝑜
12 oveq2 x = 1 𝑜 1 st A + 𝑵 x = 1 st A + 𝑵 1 𝑜
13 12 eqeq1d x = 1 𝑜 1 st A + 𝑵 x = 1 st A + 𝑵 1 𝑜 1 st A + 𝑵 1 𝑜 = 1 st A + 𝑵 1 𝑜
14 13 rspcev 1 𝑜 𝑵 1 st A + 𝑵 1 𝑜 = 1 st A + 𝑵 1 𝑜 x 𝑵 1 st A + 𝑵 x = 1 st A + 𝑵 1 𝑜
15 4 11 14 mp2an x 𝑵 1 st A + 𝑵 x = 1 st A + 𝑵 1 𝑜
16 ltexpi 1 st A 𝑵 1 st A + 𝑵 1 𝑜 𝑵 1 st A < 𝑵 1 st A + 𝑵 1 𝑜 x 𝑵 1 st A + 𝑵 x = 1 st A + 𝑵 1 𝑜
17 15 16 mpbiri 1 st A 𝑵 1 st A + 𝑵 1 𝑜 𝑵 1 st A < 𝑵 1 st A + 𝑵 1 𝑜
18 3 6 17 syl2anc A 𝑸 1 st A < 𝑵 1 st A + 𝑵 1 𝑜
19 nlt1pi ¬ 2 nd A < 𝑵 1 𝑜
20 ltmpi 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 𝑜 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 1 𝑜
21 6 20 syl A 𝑸 2 nd A < 𝑵 1 𝑜 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 1 𝑜
22 mulidpi 1 st A + 𝑵 1 𝑜 𝑵 1 st A + 𝑵 1 𝑜 𝑵 1 𝑜 = 1 st A + 𝑵 1 𝑜
23 6 22 syl A 𝑸 1 st A + 𝑵 1 𝑜 𝑵 1 𝑜 = 1 st A + 𝑵 1 𝑜
24 23 breq2d A 𝑸 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 1 𝑜 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜
25 21 24 bitrd A 𝑸 2 nd A < 𝑵 1 𝑜 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜
26 19 25 mtbii A 𝑸 ¬ 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜
27 ltsopi < 𝑵 Or 𝑵
28 ltrelpi < 𝑵 𝑵 × 𝑵
29 27 28 sotri3 1 st A + 𝑵 1 𝑜 𝑵 2 nd A 𝑵 1 st A < 𝑵 1 st A + 𝑵 1 𝑜 ¬ 1 st A + 𝑵 1 𝑜 𝑵 2 nd A < 𝑵 1 st A + 𝑵 1 𝑜 1 st A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 2 nd A
30 10 18 26 29 syl3anc A 𝑸 1 st A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 2 nd A
31 pinq 1 st A + 𝑵 1 𝑜 𝑵 1 st A + 𝑵 1 𝑜 1 𝑜 𝑸
32 6 31 syl A 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜 𝑸
33 ordpinq A 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜 𝑸 A < 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜 1 st A 𝑵 2 nd 1 st A + 𝑵 1 𝑜 1 𝑜 < 𝑵 1 st 1 st A + 𝑵 1 𝑜 1 𝑜 𝑵 2 nd A
34 32 33 mpdan A 𝑸 A < 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜 1 st A 𝑵 2 nd 1 st A + 𝑵 1 𝑜 1 𝑜 < 𝑵 1 st 1 st A + 𝑵 1 𝑜 1 𝑜 𝑵 2 nd A
35 ovex 1 st A + 𝑵 1 𝑜 V
36 1oex 1 𝑜 V
37 35 36 op2nd 2 nd 1 st A + 𝑵 1 𝑜 1 𝑜 = 1 𝑜
38 37 oveq2i 1 st A 𝑵 2 nd 1 st A + 𝑵 1 𝑜 1 𝑜 = 1 st A 𝑵 1 𝑜
39 mulidpi 1 st A 𝑵 1 st A 𝑵 1 𝑜 = 1 st A
40 3 39 syl A 𝑸 1 st A 𝑵 1 𝑜 = 1 st A
41 38 40 syl5eq A 𝑸 1 st A 𝑵 2 nd 1 st A + 𝑵 1 𝑜 1 𝑜 = 1 st A
42 35 36 op1st 1 st 1 st A + 𝑵 1 𝑜 1 𝑜 = 1 st A + 𝑵 1 𝑜
43 42 oveq1i 1 st 1 st A + 𝑵 1 𝑜 1 𝑜 𝑵 2 nd A = 1 st A + 𝑵 1 𝑜 𝑵 2 nd A
44 43 a1i A 𝑸 1 st 1 st A + 𝑵 1 𝑜 1 𝑜 𝑵 2 nd A = 1 st A + 𝑵 1 𝑜 𝑵 2 nd A
45 41 44 breq12d A 𝑸 1 st A 𝑵 2 nd 1 st A + 𝑵 1 𝑜 1 𝑜 < 𝑵 1 st 1 st A + 𝑵 1 𝑜 1 𝑜 𝑵 2 nd A 1 st A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 2 nd A
46 34 45 bitrd A 𝑸 A < 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜 1 st A < 𝑵 1 st A + 𝑵 1 𝑜 𝑵 2 nd A
47 30 46 mpbird A 𝑸 A < 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜
48 opeq1 x = 1 st A + 𝑵 1 𝑜 x 1 𝑜 = 1 st A + 𝑵 1 𝑜 1 𝑜
49 48 breq2d x = 1 st A + 𝑵 1 𝑜 A < 𝑸 x 1 𝑜 A < 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜
50 49 rspcev 1 st A + 𝑵 1 𝑜 𝑵 A < 𝑸 1 st A + 𝑵 1 𝑜 1 𝑜 x 𝑵 A < 𝑸 x 1 𝑜
51 6 47 50 syl2anc A 𝑸 x 𝑵 A < 𝑸 x 1 𝑜