Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > addnqprulem | Unicode version |
Description: Lemma to prove upward closure in positive real addition. (Contributed by Jim Kingdon, 7-Dec-2019.) |
Ref | Expression |
---|---|
addnqprulem |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 109 | . . . . 5 | |
2 | ltrnqi 7343 | . . . . . 6 | |
3 | simplr 520 | . . . . . . . . 9 | |
4 | recclnq 7314 | . . . . . . . . 9 | |
5 | 3, 4 | syl 14 | . . . . . . . 8 |
6 | ltrelnq 7287 | . . . . . . . . . . . 12 | |
7 | 6 | brel 4640 | . . . . . . . . . . 11 |
8 | 7 | adantl 275 | . . . . . . . . . 10 |
9 | 8 | simpld 111 | . . . . . . . . 9 |
10 | recclnq 7314 | . . . . . . . . 9 | |
11 | 9, 10 | syl 14 | . . . . . . . 8 |
12 | ltmnqg 7323 | . . . . . . . 8 | |
13 | 5, 11, 3, 12 | syl3anc 1220 | . . . . . . 7 |
14 | ltmnqg 7323 | . . . . . . . . 9 | |
15 | 14 | adantl 275 | . . . . . . . 8 |
16 | mulclnq 7298 | . . . . . . . . 9 | |
17 | 3, 5, 16 | syl2anc 409 | . . . . . . . 8 |
18 | mulclnq 7298 | . . . . . . . . 9 | |
19 | 3, 11, 18 | syl2anc 409 | . . . . . . . 8 |
20 | elprnqu 7404 | . . . . . . . . 9 | |
21 | 20 | ad2antrr 480 | . . . . . . . 8 |
22 | mulcomnqg 7305 | . . . . . . . . 9 | |
23 | 22 | adantl 275 | . . . . . . . 8 |
24 | 15, 17, 19, 21, 23 | caovord2d 5992 | . . . . . . 7 |
25 | 13, 24 | bitrd 187 | . . . . . 6 |
26 | 2, 25 | syl5ib 153 | . . . . 5 |
27 | 1, 26 | mpd 13 | . . . 4 |
28 | recidnq 7315 | . . . . . . . 8 | |
29 | 28 | oveq1d 5841 | . . . . . . 7 |
30 | 1nq 7288 | . . . . . . . . 9 | |
31 | mulcomnqg 7305 | . . . . . . . . 9 | |
32 | 30, 31 | mpan 421 | . . . . . . . 8 |
33 | mulidnq 7311 | . . . . . . . 8 | |
34 | 32, 33 | eqtrd 2190 | . . . . . . 7 |
35 | 29, 34 | sylan9eqr 2212 | . . . . . 6 |
36 | 35 | breq1d 3977 | . . . . 5 |
37 | 21, 3, 36 | syl2anc 409 | . . . 4 |
38 | 27, 37 | mpbid 146 | . . 3 |
39 | prcunqu 7407 | . . . 4 | |
40 | 39 | ad2antrr 480 | . . 3 |
41 | 38, 40 | mpd 13 | . 2 |
42 | 41 | ex 114 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wb 104 w3a 963 wceq 1335 wcel 2128 cop 3564 class class class wbr 3967 cfv 5172 (class class class)co 5826 cnq 7202 c1q 7203 cmq 7205 crq 7206 cltq 7207 cnp 7213 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-coll 4081 ax-sep 4084 ax-nul 4092 ax-pow 4137 ax-pr 4171 ax-un 4395 ax-setind 4498 ax-iinf 4549 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-ral 2440 df-rex 2441 df-reu 2442 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3396 df-pw 3546 df-sn 3567 df-pr 3568 df-op 3570 df-uni 3775 df-int 3810 df-iun 3853 df-br 3968 df-opab 4028 df-mpt 4029 df-tr 4065 df-eprel 4251 df-id 4255 df-iord 4328 df-on 4330 df-suc 4333 df-iom 4552 df-xp 4594 df-rel 4595 df-cnv 4596 df-co 4597 df-dm 4598 df-rn 4599 df-res 4600 df-ima 4601 df-iota 5137 df-fun 5174 df-fn 5175 df-f 5176 df-f1 5177 df-fo 5178 df-f1o 5179 df-fv 5180 df-ov 5829 df-oprab 5830 df-mpo 5831 df-1st 6090 df-2nd 6091 df-recs 6254 df-irdg 6319 df-1o 6365 df-oadd 6369 df-omul 6370 df-er 6482 df-ec 6484 df-qs 6488 df-ni 7226 df-mi 7228 df-lti 7229 df-mpq 7267 df-enq 7269 df-nqqs 7270 df-mqqs 7272 df-1nqqs 7273 df-rq 7274 df-ltnqqs 7275 df-inp 7388 |
This theorem is referenced by: addnqpru 7452 |
Copyright terms: Public domain | W3C validator |