Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > addnqprl | Unicode version |
Description: Lemma to prove downward closure in positive real addition. (Contributed by Jim Kingdon, 5-Dec-2019.) |
Ref | Expression |
---|---|
addnqprl |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prop 7276 | . . . . . 6 | |
2 | addnqprllem 7328 | . . . . . 6 | |
3 | 1, 2 | sylanl1 399 | . . . . 5 |
4 | 3 | adantlr 468 | . . . 4 |
5 | prop 7276 | . . . . . 6 | |
6 | addnqprllem 7328 | . . . . . 6 | |
7 | 5, 6 | sylanl1 399 | . . . . 5 |
8 | 7 | adantll 467 | . . . 4 |
9 | 4, 8 | jcad 305 | . . 3 |
10 | simpl 108 | . . . 4 | |
11 | simpl 108 | . . . . 5 | |
12 | simpl 108 | . . . . 5 | |
13 | 11, 12 | anim12i 336 | . . . 4 |
14 | df-iplp 7269 | . . . . 5 | |
15 | addclnq 7176 | . . . . 5 | |
16 | 14, 15 | genpprecll 7315 | . . . 4 |
17 | 10, 13, 16 | 3syl 17 | . . 3 |
18 | 9, 17 | syld 45 | . 2 |
19 | simpr 109 | . . . . 5 | |
20 | elprnql 7282 | . . . . . . . . 9 | |
21 | 1, 20 | sylan 281 | . . . . . . . 8 |
22 | 21 | ad2antrr 479 | . . . . . . 7 |
23 | elprnql 7282 | . . . . . . . . 9 | |
24 | 5, 23 | sylan 281 | . . . . . . . 8 |
25 | 24 | ad2antlr 480 | . . . . . . 7 |
26 | addclnq 7176 | . . . . . . 7 | |
27 | 22, 25, 26 | syl2anc 408 | . . . . . 6 |
28 | recclnq 7193 | . . . . . 6 | |
29 | 27, 28 | syl 14 | . . . . 5 |
30 | mulassnqg 7185 | . . . . 5 | |
31 | 19, 29, 27, 30 | syl3anc 1216 | . . . 4 |
32 | mulclnq 7177 | . . . . . 6 | |
33 | 19, 29, 32 | syl2anc 408 | . . . . 5 |
34 | distrnqg 7188 | . . . . 5 | |
35 | 33, 22, 25, 34 | syl3anc 1216 | . . . 4 |
36 | mulcomnqg 7184 | . . . . . . . 8 | |
37 | 29, 27, 36 | syl2anc 408 | . . . . . . 7 |
38 | recidnq 7194 | . . . . . . . 8 | |
39 | 27, 38 | syl 14 | . . . . . . 7 |
40 | 37, 39 | eqtrd 2170 | . . . . . 6 |
41 | 40 | oveq2d 5783 | . . . . 5 |
42 | mulidnq 7190 | . . . . . 6 | |
43 | 42 | adantl 275 | . . . . 5 |
44 | 41, 43 | eqtrd 2170 | . . . 4 |
45 | 31, 35, 44 | 3eqtr3d 2178 | . . 3 |
46 | 45 | eleq1d 2206 | . 2 |
47 | 18, 46 | sylibd 148 | 1 |
Colors of variables: wff set class |
Syntax hints: wi 4 wa 103 wceq 1331 wcel 1480 cop 3525 class class class wbr 3924 cfv 5118 (class class class)co 5767 c1st 6029 c2nd 6030 cnq 7081 c1q 7082 cplq 7083 cmq 7084 crq 7085 cltq 7086 cnp 7092 cpp 7094 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-coll 4038 ax-sep 4041 ax-nul 4049 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 ax-iinf 4497 |
This theorem depends on definitions: df-bi 116 df-dc 820 df-3or 963 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-ral 2419 df-rex 2420 df-reu 2421 df-rab 2423 df-v 2683 df-sbc 2905 df-csb 2999 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-nul 3359 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-int 3767 df-iun 3810 df-br 3925 df-opab 3985 df-mpt 3986 df-tr 4022 df-eprel 4206 df-id 4210 df-iord 4283 df-on 4285 df-suc 4288 df-iom 4500 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-rn 4545 df-res 4546 df-ima 4547 df-iota 5083 df-fun 5120 df-fn 5121 df-f 5122 df-f1 5123 df-fo 5124 df-f1o 5125 df-fv 5126 df-ov 5770 df-oprab 5771 df-mpo 5772 df-1st 6031 df-2nd 6032 df-recs 6195 df-irdg 6260 df-1o 6306 df-oadd 6310 df-omul 6311 df-er 6422 df-ec 6424 df-qs 6428 df-ni 7105 df-pli 7106 df-mi 7107 df-lti 7108 df-plpq 7145 df-mpq 7146 df-enq 7148 df-nqqs 7149 df-plqqs 7150 df-mqqs 7151 df-1nqqs 7152 df-rq 7153 df-ltnqqs 7154 df-inp 7267 df-iplp 7269 |
This theorem is referenced by: addlocprlemlt 7332 addclpr 7338 |
Copyright terms: Public domain | W3C validator |