Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > caucvgprlemk | GIF version |
Description: Lemma for caucvgpr 7656. Reciprocals of positive integers decrease as the positive integers increase. (Contributed by Jim Kingdon, 9-Oct-2020.) |
Ref | Expression |
---|---|
caucvgprlemk.jk | ⊢ (𝜑 → 𝐽 <N 𝐾) |
caucvgprlemk.jkq | ⊢ (𝜑 → (*Q‘[〈𝐽, 1o〉] ~Q ) <Q 𝑄) |
Ref | Expression |
---|---|
caucvgprlemk | ⊢ (𝜑 → (*Q‘[〈𝐾, 1o〉] ~Q ) <Q 𝑄) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caucvgprlemk.jk | . . . 4 ⊢ (𝜑 → 𝐽 <N 𝐾) | |
2 | ltrelpi 7298 | . . . . . . 7 ⊢ <N ⊆ (N × N) | |
3 | 2 | brel 4672 | . . . . . 6 ⊢ (𝐽 <N 𝐾 → (𝐽 ∈ N ∧ 𝐾 ∈ N)) |
4 | 1, 3 | syl 14 | . . . . 5 ⊢ (𝜑 → (𝐽 ∈ N ∧ 𝐾 ∈ N)) |
5 | ltnnnq 7397 | . . . . 5 ⊢ ((𝐽 ∈ N ∧ 𝐾 ∈ N) → (𝐽 <N 𝐾 ↔ [〈𝐽, 1o〉] ~Q <Q [〈𝐾, 1o〉] ~Q )) | |
6 | 4, 5 | syl 14 | . . . 4 ⊢ (𝜑 → (𝐽 <N 𝐾 ↔ [〈𝐽, 1o〉] ~Q <Q [〈𝐾, 1o〉] ~Q )) |
7 | 1, 6 | mpbid 147 | . . 3 ⊢ (𝜑 → [〈𝐽, 1o〉] ~Q <Q [〈𝐾, 1o〉] ~Q ) |
8 | ltrnqi 7395 | . . 3 ⊢ ([〈𝐽, 1o〉] ~Q <Q [〈𝐾, 1o〉] ~Q → (*Q‘[〈𝐾, 1o〉] ~Q ) <Q (*Q‘[〈𝐽, 1o〉] ~Q )) | |
9 | 7, 8 | syl 14 | . 2 ⊢ (𝜑 → (*Q‘[〈𝐾, 1o〉] ~Q ) <Q (*Q‘[〈𝐽, 1o〉] ~Q )) |
10 | caucvgprlemk.jkq | . 2 ⊢ (𝜑 → (*Q‘[〈𝐽, 1o〉] ~Q ) <Q 𝑄) | |
11 | ltsonq 7372 | . . 3 ⊢ <Q Or Q | |
12 | ltrelnq 7339 | . . 3 ⊢ <Q ⊆ (Q × Q) | |
13 | 11, 12 | sotri 5016 | . 2 ⊢ (((*Q‘[〈𝐾, 1o〉] ~Q ) <Q (*Q‘[〈𝐽, 1o〉] ~Q ) ∧ (*Q‘[〈𝐽, 1o〉] ~Q ) <Q 𝑄) → (*Q‘[〈𝐾, 1o〉] ~Q ) <Q 𝑄) |
14 | 9, 10, 13 | syl2anc 411 | 1 ⊢ (𝜑 → (*Q‘[〈𝐾, 1o〉] ~Q ) <Q 𝑄) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∈ wcel 2146 〈cop 3592 class class class wbr 3998 ‘cfv 5208 1oc1o 6400 [cec 6523 Ncnpi 7246 <N clti 7249 ~Q ceq 7253 Qcnq 7254 *Qcrq 7258 <Q cltq 7259 |
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 1445 ax-7 1446 ax-gen 1447 ax-ie1 1491 ax-ie2 1492 ax-8 1502 ax-10 1503 ax-11 1504 ax-i12 1505 ax-bndl 1507 ax-4 1508 ax-17 1524 ax-i9 1528 ax-ial 1532 ax-i5r 1533 ax-13 2148 ax-14 2149 ax-ext 2157 ax-coll 4113 ax-sep 4116 ax-nul 4124 ax-pow 4169 ax-pr 4203 ax-un 4427 ax-setind 4530 ax-iinf 4581 |
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 1459 df-sb 1761 df-eu 2027 df-mo 2028 df-clab 2162 df-cleq 2168 df-clel 2171 df-nfc 2306 df-ne 2346 df-ral 2458 df-rex 2459 df-reu 2460 df-rab 2462 df-v 2737 df-sbc 2961 df-csb 3056 df-dif 3129 df-un 3131 df-in 3133 df-ss 3140 df-nul 3421 df-pw 3574 df-sn 3595 df-pr 3596 df-op 3598 df-uni 3806 df-int 3841 df-iun 3884 df-br 3999 df-opab 4060 df-mpt 4061 df-tr 4097 df-eprel 4283 df-id 4287 df-po 4290 df-iso 4291 df-iord 4360 df-on 4362 df-suc 4365 df-iom 4584 df-xp 4626 df-rel 4627 df-cnv 4628 df-co 4629 df-dm 4630 df-rn 4631 df-res 4632 df-ima 4633 df-iota 5170 df-fun 5210 df-fn 5211 df-f 5212 df-f1 5213 df-fo 5214 df-f1o 5215 df-fv 5216 df-ov 5868 df-oprab 5869 df-mpo 5870 df-1st 6131 df-2nd 6132 df-recs 6296 df-irdg 6361 df-1o 6407 df-oadd 6411 df-omul 6412 df-er 6525 df-ec 6527 df-qs 6531 df-ni 7278 df-mi 7280 df-lti 7281 df-mpq 7319 df-enq 7321 df-nqqs 7322 df-mqqs 7324 df-1nqqs 7325 df-rq 7326 df-ltnqqs 7327 |
This theorem is referenced by: caucvgprlem1 7653 caucvgprlem2 7654 |
Copyright terms: Public domain | W3C validator |