| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulcomnqg | GIF version | ||
| Description: Multiplication of positive fractions is commutative. (Contributed by Jim Kingdon, 17-Sep-2019.) |
| Ref | Expression |
|---|---|
| mulcomnqg | ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q 𝐵) = (𝐵 ·Q 𝐴)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-nqqs 7503 | . 2 ⊢ Q = ((N × N) / ~Q ) | |
| 2 | mulpipqqs 7528 | . 2 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N)) → ([〈𝑥, 𝑦〉] ~Q ·Q [〈𝑧, 𝑤〉] ~Q ) = [〈(𝑥 ·N 𝑧), (𝑦 ·N 𝑤)〉] ~Q ) | |
| 3 | mulpipqqs 7528 | . 2 ⊢ (((𝑧 ∈ N ∧ 𝑤 ∈ N) ∧ (𝑥 ∈ N ∧ 𝑦 ∈ N)) → ([〈𝑧, 𝑤〉] ~Q ·Q [〈𝑥, 𝑦〉] ~Q ) = [〈(𝑧 ·N 𝑥), (𝑤 ·N 𝑦)〉] ~Q ) | |
| 4 | mulcompig 7486 | . . 3 ⊢ ((𝑥 ∈ N ∧ 𝑧 ∈ N) → (𝑥 ·N 𝑧) = (𝑧 ·N 𝑥)) | |
| 5 | 4 | ad2ant2r 509 | . 2 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N)) → (𝑥 ·N 𝑧) = (𝑧 ·N 𝑥)) |
| 6 | mulcompig 7486 | . . 3 ⊢ ((𝑦 ∈ N ∧ 𝑤 ∈ N) → (𝑦 ·N 𝑤) = (𝑤 ·N 𝑦)) | |
| 7 | 6 | ad2ant2l 508 | . 2 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (𝑧 ∈ N ∧ 𝑤 ∈ N)) → (𝑦 ·N 𝑤) = (𝑤 ·N 𝑦)) |
| 8 | 1, 2, 3, 5, 7 | ecovicom 6760 | 1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 ·Q 𝐵) = (𝐵 ·Q 𝐴)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1375 ∈ wcel 2180 (class class class)co 5974 Ncnpi 7427 ·N cmi 7429 ~Q ceq 7434 Qcnq 7435 ·Q cmq 7438 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 713 ax-5 1473 ax-7 1474 ax-gen 1475 ax-ie1 1519 ax-ie2 1520 ax-8 1530 ax-10 1531 ax-11 1532 ax-i12 1533 ax-bndl 1535 ax-4 1536 ax-17 1552 ax-i9 1556 ax-ial 1560 ax-i5r 1561 ax-13 2182 ax-14 2183 ax-ext 2191 ax-coll 4178 ax-sep 4181 ax-nul 4189 ax-pow 4237 ax-pr 4272 ax-un 4501 ax-setind 4606 ax-iinf 4657 |
| This theorem depends on definitions: df-bi 117 df-dc 839 df-3or 984 df-3an 985 df-tru 1378 df-fal 1381 df-nf 1487 df-sb 1789 df-eu 2060 df-mo 2061 df-clab 2196 df-cleq 2202 df-clel 2205 df-nfc 2341 df-ne 2381 df-ral 2493 df-rex 2494 df-reu 2495 df-rab 2497 df-v 2781 df-sbc 3009 df-csb 3105 df-dif 3179 df-un 3181 df-in 3183 df-ss 3190 df-nul 3472 df-pw 3631 df-sn 3652 df-pr 3653 df-op 3655 df-uni 3868 df-int 3903 df-iun 3946 df-br 4063 df-opab 4125 df-mpt 4126 df-tr 4162 df-id 4361 df-iord 4434 df-on 4436 df-suc 4439 df-iom 4660 df-xp 4702 df-rel 4703 df-cnv 4704 df-co 4705 df-dm 4706 df-rn 4707 df-res 4708 df-ima 4709 df-iota 5254 df-fun 5296 df-fn 5297 df-f 5298 df-f1 5299 df-fo 5300 df-f1o 5301 df-fv 5302 df-ov 5977 df-oprab 5978 df-mpo 5979 df-1st 6256 df-2nd 6257 df-recs 6421 df-irdg 6486 df-oadd 6536 df-omul 6537 df-er 6650 df-ec 6652 df-qs 6656 df-ni 7459 df-mi 7461 df-mpq 7500 df-enq 7502 df-nqqs 7503 df-mqqs 7505 |
| This theorem is referenced by: recmulnqg 7546 recrecnq 7549 rec1nq 7550 lt2mulnq 7560 halfnqq 7565 prarloclemarch 7573 prarloclemarch2 7574 ltrnqg 7575 prarloclemlt 7648 addnqprllem 7682 addnqprulem 7683 addnqprl 7684 addnqpru 7685 appdivnq 7718 prmuloclemcalc 7720 mulnqprl 7723 mulnqpru 7724 mullocprlem 7725 mulclpr 7727 mulcomprg 7735 distrlem4prl 7739 distrlem4pru 7740 1idprl 7745 1idpru 7746 recexprlem1ssl 7788 recexprlem1ssu 7789 recexprlemss1l 7790 recexprlemss1u 7791 |
| Copyright terms: Public domain | W3C validator |