Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mulidnq | GIF version |
Description: Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996.) |
Ref | Expression |
---|---|
mulidnq | ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-nqqs 6538 | . 2 ⊢ Q = ((N × N) / ~Q ) | |
2 | oveq1 5539 | . . 3 ⊢ ([〈𝑥, 𝑦〉] ~Q = 𝐴 → ([〈𝑥, 𝑦〉] ~Q ·Q 1Q) = (𝐴 ·Q 1Q)) | |
3 | id 19 | . . 3 ⊢ ([〈𝑥, 𝑦〉] ~Q = 𝐴 → [〈𝑥, 𝑦〉] ~Q = 𝐴) | |
4 | 2, 3 | eqeq12d 2095 | . 2 ⊢ ([〈𝑥, 𝑦〉] ~Q = 𝐴 → (([〈𝑥, 𝑦〉] ~Q ·Q 1Q) = [〈𝑥, 𝑦〉] ~Q ↔ (𝐴 ·Q 1Q) = 𝐴)) |
5 | df-1nqqs 6541 | . . . . 5 ⊢ 1Q = [〈1𝑜, 1𝑜〉] ~Q | |
6 | 5 | oveq2i 5543 | . . . 4 ⊢ ([〈𝑥, 𝑦〉] ~Q ·Q 1Q) = ([〈𝑥, 𝑦〉] ~Q ·Q [〈1𝑜, 1𝑜〉] ~Q ) |
7 | 1pi 6505 | . . . . 5 ⊢ 1𝑜 ∈ N | |
8 | mulpipqqs 6563 | . . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (1𝑜 ∈ N ∧ 1𝑜 ∈ N)) → ([〈𝑥, 𝑦〉] ~Q ·Q [〈1𝑜, 1𝑜〉] ~Q ) = [〈(𝑥 ·N 1𝑜), (𝑦 ·N 1𝑜)〉] ~Q ) | |
9 | 7, 7, 8 | mpanr12 429 | . . . 4 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ([〈𝑥, 𝑦〉] ~Q ·Q [〈1𝑜, 1𝑜〉] ~Q ) = [〈(𝑥 ·N 1𝑜), (𝑦 ·N 1𝑜)〉] ~Q ) |
10 | 6, 9 | syl5eq 2125 | . . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ([〈𝑥, 𝑦〉] ~Q ·Q 1Q) = [〈(𝑥 ·N 1𝑜), (𝑦 ·N 1𝑜)〉] ~Q ) |
11 | mulcompig 6521 | . . . . . . 7 ⊢ ((1𝑜 ∈ N ∧ 𝑥 ∈ N) → (1𝑜 ·N 𝑥) = (𝑥 ·N 1𝑜)) | |
12 | 7, 11 | mpan 414 | . . . . . 6 ⊢ (𝑥 ∈ N → (1𝑜 ·N 𝑥) = (𝑥 ·N 1𝑜)) |
13 | 12 | adantr 270 | . . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → (1𝑜 ·N 𝑥) = (𝑥 ·N 1𝑜)) |
14 | mulcompig 6521 | . . . . . . 7 ⊢ ((1𝑜 ∈ N ∧ 𝑦 ∈ N) → (1𝑜 ·N 𝑦) = (𝑦 ·N 1𝑜)) | |
15 | 7, 14 | mpan 414 | . . . . . 6 ⊢ (𝑦 ∈ N → (1𝑜 ·N 𝑦) = (𝑦 ·N 1𝑜)) |
16 | 15 | adantl 271 | . . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → (1𝑜 ·N 𝑦) = (𝑦 ·N 1𝑜)) |
17 | 13, 16 | opeq12d 3578 | . . . 4 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → 〈(1𝑜 ·N 𝑥), (1𝑜 ·N 𝑦)〉 = 〈(𝑥 ·N 1𝑜), (𝑦 ·N 1𝑜)〉) |
18 | 17 | eceq1d 6165 | . . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → [〈(1𝑜 ·N 𝑥), (1𝑜 ·N 𝑦)〉] ~Q = [〈(𝑥 ·N 1𝑜), (𝑦 ·N 1𝑜)〉] ~Q ) |
19 | mulcanenqec 6576 | . . . 4 ⊢ ((1𝑜 ∈ N ∧ 𝑥 ∈ N ∧ 𝑦 ∈ N) → [〈(1𝑜 ·N 𝑥), (1𝑜 ·N 𝑦)〉] ~Q = [〈𝑥, 𝑦〉] ~Q ) | |
20 | 7, 19 | mp3an1 1255 | . . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → [〈(1𝑜 ·N 𝑥), (1𝑜 ·N 𝑦)〉] ~Q = [〈𝑥, 𝑦〉] ~Q ) |
21 | 10, 18, 20 | 3eqtr2d 2119 | . 2 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ([〈𝑥, 𝑦〉] ~Q ·Q 1Q) = [〈𝑥, 𝑦〉] ~Q ) |
22 | 1, 4, 21 | ecoptocl 6216 | 1 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 = wceq 1284 ∈ wcel 1433 〈cop 3401 (class class class)co 5532 1𝑜c1o 6017 [cec 6127 Ncnpi 6462 ·N cmi 6464 ~Q ceq 6469 Qcnq 6470 1Qc1q 6471 ·Q cmq 6473 |
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 576 ax-in2 577 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-13 1444 ax-14 1445 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 ax-coll 3893 ax-sep 3896 ax-nul 3904 ax-pow 3948 ax-pr 3964 ax-un 4188 ax-setind 4280 ax-iinf 4329 |
This theorem depends on definitions: df-bi 115 df-dc 776 df-3or 920 df-3an 921 df-tru 1287 df-fal 1290 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-ne 2246 df-ral 2353 df-rex 2354 df-reu 2355 df-rab 2357 df-v 2603 df-sbc 2816 df-csb 2909 df-dif 2975 df-un 2977 df-in 2979 df-ss 2986 df-nul 3252 df-pw 3384 df-sn 3404 df-pr 3405 df-op 3407 df-uni 3602 df-int 3637 df-iun 3680 df-br 3786 df-opab 3840 df-mpt 3841 df-tr 3876 df-id 4048 df-iord 4121 df-on 4123 df-suc 4126 df-iom 4332 df-xp 4369 df-rel 4370 df-cnv 4371 df-co 4372 df-dm 4373 df-rn 4374 df-res 4375 df-ima 4376 df-iota 4887 df-fun 4924 df-fn 4925 df-f 4926 df-f1 4927 df-fo 4928 df-f1o 4929 df-fv 4930 df-ov 5535 df-oprab 5536 df-mpt2 5537 df-1st 5787 df-2nd 5788 df-recs 5943 df-irdg 5980 df-1o 6024 df-oadd 6028 df-omul 6029 df-er 6129 df-ec 6131 df-qs 6135 df-ni 6494 df-mi 6496 df-mpq 6535 df-enq 6537 df-nqqs 6538 df-mqqs 6540 df-1nqqs 6541 |
This theorem is referenced by: recmulnqg 6581 rec1nq 6585 ltaddnq 6597 halfnqq 6600 prarloclemarch 6608 ltrnqg 6610 addnqprllem 6717 addnqprulem 6718 addnqprl 6719 addnqpru 6720 appdivnq 6753 prmuloc2 6757 mulnqprl 6758 mulnqpru 6759 1idprl 6780 1idpru 6781 recexprlem1ssl 6823 recexprlem1ssu 6824 |
Copyright terms: Public domain | W3C validator |