| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > archrecnq | GIF version | ||
| Description: Archimedean principle for fractions (reciprocal version). (Contributed by Jim Kingdon, 27-Sep-2020.) |
| Ref | Expression |
|---|---|
| archrecnq | ⊢ (𝐴 ∈ Q → ∃𝑗 ∈ N (*Q‘[〈𝑗, 1o〉] ~Q ) <Q 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | recclnq 7766 | . . 3 ⊢ (𝐴 ∈ Q → (*Q‘𝐴) ∈ Q) | |
| 2 | archnqq 7791 | . . 3 ⊢ ((*Q‘𝐴) ∈ Q → ∃𝑗 ∈ N (*Q‘𝐴) <Q [〈𝑗, 1o〉] ~Q ) | |
| 3 | 1, 2 | syl 14 | . 2 ⊢ (𝐴 ∈ Q → ∃𝑗 ∈ N (*Q‘𝐴) <Q [〈𝑗, 1o〉] ~Q ) |
| 4 | nnnq 7796 | . . . . 5 ⊢ (𝑗 ∈ N → [〈𝑗, 1o〉] ~Q ∈ Q) | |
| 5 | ltrnqg 7794 | . . . . 5 ⊢ (((*Q‘𝐴) ∈ Q ∧ [〈𝑗, 1o〉] ~Q ∈ Q) → ((*Q‘𝐴) <Q [〈𝑗, 1o〉] ~Q ↔ (*Q‘[〈𝑗, 1o〉] ~Q ) <Q (*Q‘(*Q‘𝐴)))) | |
| 6 | 1, 4, 5 | syl2an 289 | . . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝑗 ∈ N) → ((*Q‘𝐴) <Q [〈𝑗, 1o〉] ~Q ↔ (*Q‘[〈𝑗, 1o〉] ~Q ) <Q (*Q‘(*Q‘𝐴)))) |
| 7 | recrecnq 7768 | . . . . . 6 ⊢ (𝐴 ∈ Q → (*Q‘(*Q‘𝐴)) = 𝐴) | |
| 8 | 7 | breq2d 4143 | . . . . 5 ⊢ (𝐴 ∈ Q → ((*Q‘[〈𝑗, 1o〉] ~Q ) <Q (*Q‘(*Q‘𝐴)) ↔ (*Q‘[〈𝑗, 1o〉] ~Q ) <Q 𝐴)) |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝑗 ∈ N) → ((*Q‘[〈𝑗, 1o〉] ~Q ) <Q (*Q‘(*Q‘𝐴)) ↔ (*Q‘[〈𝑗, 1o〉] ~Q ) <Q 𝐴)) |
| 10 | 6, 9 | bitrd 188 | . . 3 ⊢ ((𝐴 ∈ Q ∧ 𝑗 ∈ N) → ((*Q‘𝐴) <Q [〈𝑗, 1o〉] ~Q ↔ (*Q‘[〈𝑗, 1o〉] ~Q ) <Q 𝐴)) |
| 11 | 10 | rexbidva 2547 | . 2 ⊢ (𝐴 ∈ Q → (∃𝑗 ∈ N (*Q‘𝐴) <Q [〈𝑗, 1o〉] ~Q ↔ ∃𝑗 ∈ N (*Q‘[〈𝑗, 1o〉] ~Q ) <Q 𝐴)) |
| 12 | 3, 11 | mpbid 147 | 1 ⊢ (𝐴 ∈ Q → ∃𝑗 ∈ N (*Q‘[〈𝑗, 1o〉] ~Q ) <Q 𝐴) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2209 ∃wrex 2529 〈cop 3712 class class class wbr 4131 ‘cfv 5380 1oc1o 6684 [cec 6809 Ncnpi 7646 ~Q ceq 7653 Qcnq 7654 *Qcrq 7658 <Q cltq 7659 |
| 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 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 |
| 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 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-eprel 4436 df-id 4440 df-iord 4513 df-on 4515 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-1o 6691 df-oadd 6695 df-omul 6696 df-er 6811 df-ec 6813 df-qs 6817 df-ni 7678 df-pli 7679 df-mi 7680 df-lti 7681 df-mpq 7719 df-enq 7721 df-nqqs 7722 df-mqqs 7724 df-1nqqs 7725 df-rq 7726 df-ltnqqs 7727 |
| This theorem is used by: archrecpr 8038 caucvgprlemm 8042 caucvgprlemloc 8049 caucvgprlemlim 8055 caucvgprprlemml 8068 caucvgprprlemloc 8077 |
| Copyright terms: Public domain | W3C validator |