| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mulpipq | GIF version | ||
| Description: Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.) (Revised by Mario Carneiro, 8-May-2013.) |
| Ref | Expression |
|---|---|
| mulpipq | ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (〈𝐴, 𝐵〉 ·pQ 〈𝐶, 𝐷〉) = 〈(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | opelxpi 4751 | . . 3 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 〈𝐴, 𝐵〉 ∈ (N × N)) | |
| 2 | opelxpi 4751 | . . 3 ⊢ ((𝐶 ∈ N ∧ 𝐷 ∈ N) → 〈𝐶, 𝐷〉 ∈ (N × N)) | |
| 3 | mulpipq2 7566 | . . 3 ⊢ ((〈𝐴, 𝐵〉 ∈ (N × N) ∧ 〈𝐶, 𝐷〉 ∈ (N × N)) → (〈𝐴, 𝐵〉 ·pQ 〈𝐶, 𝐷〉) = 〈((1st ‘〈𝐴, 𝐵〉) ·N (1st ‘〈𝐶, 𝐷〉)), ((2nd ‘〈𝐴, 𝐵〉) ·N (2nd ‘〈𝐶, 𝐷〉))〉) | |
| 4 | 1, 2, 3 | syl2an 289 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (〈𝐴, 𝐵〉 ·pQ 〈𝐶, 𝐷〉) = 〈((1st ‘〈𝐴, 𝐵〉) ·N (1st ‘〈𝐶, 𝐷〉)), ((2nd ‘〈𝐴, 𝐵〉) ·N (2nd ‘〈𝐶, 𝐷〉))〉) |
| 5 | op1stg 6302 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (1st ‘〈𝐴, 𝐵〉) = 𝐴) | |
| 6 | op1stg 6302 | . . . 4 ⊢ ((𝐶 ∈ N ∧ 𝐷 ∈ N) → (1st ‘〈𝐶, 𝐷〉) = 𝐶) | |
| 7 | 5, 6 | oveqan12d 6026 | . . 3 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ((1st ‘〈𝐴, 𝐵〉) ·N (1st ‘〈𝐶, 𝐷〉)) = (𝐴 ·N 𝐶)) |
| 8 | op2ndg 6303 | . . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (2nd ‘〈𝐴, 𝐵〉) = 𝐵) | |
| 9 | op2ndg 6303 | . . . 4 ⊢ ((𝐶 ∈ N ∧ 𝐷 ∈ N) → (2nd ‘〈𝐶, 𝐷〉) = 𝐷) | |
| 10 | 8, 9 | oveqan12d 6026 | . . 3 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ((2nd ‘〈𝐴, 𝐵〉) ·N (2nd ‘〈𝐶, 𝐷〉)) = (𝐵 ·N 𝐷)) |
| 11 | 7, 10 | opeq12d 3865 | . 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → 〈((1st ‘〈𝐴, 𝐵〉) ·N (1st ‘〈𝐶, 𝐷〉)), ((2nd ‘〈𝐴, 𝐵〉) ·N (2nd ‘〈𝐶, 𝐷〉))〉 = 〈(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)〉) |
| 12 | 4, 11 | eqtrd 2262 | 1 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → (〈𝐴, 𝐵〉 ·pQ 〈𝐶, 𝐷〉) = 〈(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)〉) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 〈cop 3669 × cxp 4717 ‘cfv 5318 (class class class)co 6007 1st c1st 6290 2nd c2nd 6291 Ncnpi 7467 ·N cmi 7469 ·pQ cmpq 7472 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4199 ax-sep 4202 ax-nul 4210 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-iinf 4680 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-iun 3967 df-br 4084 df-opab 4146 df-mpt 4147 df-tr 4183 df-id 4384 df-iord 4457 df-on 4459 df-suc 4462 df-iom 4683 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-f1 5323 df-fo 5324 df-f1o 5325 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-1st 6292 df-2nd 6293 df-recs 6457 df-irdg 6522 df-oadd 6572 df-omul 6573 df-ni 7499 df-mi 7501 df-mpq 7540 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |