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 103 | . . . . 5 | |
2 | ltrnqi 6519 | . . . . . 6 | |
3 | simplr 482 | . . . . . . . . 9 | |
4 | recclnq 6490 | . . . . . . . . 9 | |
5 | 3, 4 | syl 14 | . . . . . . . 8 |
6 | ltrelnq 6463 | . . . . . . . . . . . 12 | |
7 | 6 | brel 4392 | . . . . . . . . . . 11 |
8 | 7 | adantl 262 | . . . . . . . . . 10 |
9 | 8 | simpld 105 | . . . . . . . . 9 |
10 | recclnq 6490 | . . . . . . . . 9 | |
11 | 9, 10 | syl 14 | . . . . . . . 8 |
12 | ltmnqg 6499 | . . . . . . . 8 | |
13 | 5, 11, 3, 12 | syl3anc 1135 | . . . . . . 7 |
14 | ltmnqg 6499 | . . . . . . . . 9 | |
15 | 14 | adantl 262 | . . . . . . . 8 |
16 | mulclnq 6474 | . . . . . . . . 9 | |
17 | 3, 5, 16 | syl2anc 391 | . . . . . . . 8 |
18 | mulclnq 6474 | . . . . . . . . 9 | |
19 | 3, 11, 18 | syl2anc 391 | . . . . . . . 8 |
20 | elprnqu 6580 | . . . . . . . . 9 | |
21 | 20 | ad2antrr 457 | . . . . . . . 8 |
22 | mulcomnqg 6481 | . . . . . . . . 9 | |
23 | 22 | adantl 262 | . . . . . . . 8 |
24 | 15, 17, 19, 21, 23 | caovord2d 5670 | . . . . . . 7 |
25 | 13, 24 | bitrd 177 | . . . . . 6 |
26 | 2, 25 | syl5ib 143 | . . . . 5 |
27 | 1, 26 | mpd 13 | . . . 4 |
28 | recidnq 6491 | . . . . . . . 8 | |
29 | 28 | oveq1d 5527 | . . . . . . 7 |
30 | 1nq 6464 | . . . . . . . . 9 | |
31 | mulcomnqg 6481 | . . . . . . . . 9 | |
32 | 30, 31 | mpan 400 | . . . . . . . 8 |
33 | mulidnq 6487 | . . . . . . . 8 | |
34 | 32, 33 | eqtrd 2072 | . . . . . . 7 |
35 | 29, 34 | sylan9eqr 2094 | . . . . . 6 |
36 | 35 | breq1d 3774 | . . . . 5 |
37 | 21, 3, 36 | syl2anc 391 | . . . 4 |
38 | 27, 37 | mpbid 135 | . . 3 |
39 | prcunqu 6583 | . . . 4 | |
40 | 39 | ad2antrr 457 | . . 3 |
41 | 38, 40 | mpd 13 | . 2 |
42 | 41 | ex 108 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 97 wb 98 w3a 885 wceq 1243 wcel 1393 cop 3378 class class class wbr 3764 cfv 4902 (class class class)co 5512 cnq 6378 c1q 6379 cmq 6381 crq 6382 cltq 6383 cnp 6389 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-in1 544 ax-in2 545 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-13 1404 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-coll 3872 ax-sep 3875 ax-nul 3883 ax-pow 3927 ax-pr 3944 ax-un 4170 ax-setind 4262 ax-iinf 4311 |
This theorem depends on definitions: df-bi 110 df-dc 743 df-3or 886 df-3an 887 df-tru 1246 df-fal 1249 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ne 2206 df-ral 2311 df-rex 2312 df-reu 2313 df-rab 2315 df-v 2559 df-sbc 2765 df-csb 2853 df-dif 2920 df-un 2922 df-in 2924 df-ss 2931 df-nul 3225 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-int 3616 df-iun 3659 df-br 3765 df-opab 3819 df-mpt 3820 df-tr 3855 df-eprel 4026 df-id 4030 df-iord 4103 df-on 4105 df-suc 4108 df-iom 4314 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-rn 4356 df-res 4357 df-ima 4358 df-iota 4867 df-fun 4904 df-fn 4905 df-f 4906 df-f1 4907 df-fo 4908 df-f1o 4909 df-fv 4910 df-ov 5515 df-oprab 5516 df-mpt2 5517 df-1st 5767 df-2nd 5768 df-recs 5920 df-irdg 5957 df-1o 6001 df-oadd 6005 df-omul 6006 df-er 6106 df-ec 6108 df-qs 6112 df-ni 6402 df-mi 6404 df-lti 6405 df-mpq 6443 df-enq 6445 df-nqqs 6446 df-mqqs 6448 df-1nqqs 6449 df-rq 6450 df-ltnqqs 6451 df-inp 6564 |
This theorem is referenced by: addnqpru 6628 |
Copyright terms: Public domain | W3C validator |