![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > recidnq | Unicode version |
Description: A positive fraction times its reciprocal is 1. (Contributed by NM, 6-Mar-1996.) (Revised by Mario Carneiro, 8-May-2013.) |
Ref | Expression |
---|---|
recidnq |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | recclnq 6633 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
2 | eqid 2082 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
3 | recmulnqg 6632 |
. . 3
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() | |
4 | 2, 3 | mpbii 146 |
. 2
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
5 | 1, 4 | mpdan 412 |
1
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Colors of variables: wff set class |
Syntax hints: ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 577 ax-in2 578 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-13 1445 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2064 ax-coll 3895 ax-sep 3898 ax-nul 3906 ax-pow 3950 ax-pr 3966 ax-un 4190 ax-setind 4282 ax-iinf 4331 |
This theorem depends on definitions: df-bi 115 df-dc 777 df-3or 921 df-3an 922 df-tru 1288 df-fal 1291 df-nf 1391 df-sb 1687 df-eu 1945 df-mo 1946 df-clab 2069 df-cleq 2075 df-clel 2078 df-nfc 2209 df-ne 2247 df-ral 2354 df-rex 2355 df-reu 2356 df-rab 2358 df-v 2604 df-sbc 2817 df-csb 2910 df-dif 2976 df-un 2978 df-in 2980 df-ss 2987 df-nul 3253 df-pw 3386 df-sn 3406 df-pr 3407 df-op 3409 df-uni 3604 df-int 3639 df-iun 3682 df-br 3788 df-opab 3842 df-mpt 3843 df-tr 3878 df-id 4050 df-iord 4123 df-on 4125 df-suc 4128 df-iom 4334 df-xp 4371 df-rel 4372 df-cnv 4373 df-co 4374 df-dm 4375 df-rn 4376 df-res 4377 df-ima 4378 df-iota 4891 df-fun 4928 df-fn 4929 df-f 4930 df-f1 4931 df-fo 4932 df-f1o 4933 df-fv 4934 df-ov 5540 df-oprab 5541 df-mpt2 5542 df-1st 5792 df-2nd 5793 df-recs 5948 df-irdg 6013 df-1o 6059 df-oadd 6063 df-omul 6064 df-er 6165 df-ec 6167 df-qs 6171 df-ni 6545 df-mi 6547 df-mpq 6586 df-enq 6588 df-nqqs 6589 df-mqqs 6591 df-1nqqs 6592 df-rq 6593 |
This theorem is referenced by: recrecnq 6635 rec1nq 6636 halfnqq 6651 prarloclemarch 6659 ltrnqg 6661 addnqprllem 6768 addnqprulem 6769 addnqprl 6770 addnqpru 6771 appdivnq 6804 mulnqprl 6809 mulnqpru 6810 1idprl 6831 1idpru 6832 recexprlem1ssl 6874 recexprlem1ssu 6875 recexprlemss1l 6876 recexprlemss1u 6877 recidpipr 7075 |
Copyright terms: Public domain | W3C validator |