 Intuitionistic Logic Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  ILE Home  >  Th. List  >  mulpipq2 GIF version

Theorem mulpipq2 6469
 Description: Multiplication of positive fractions in terms of positive integers. (Contributed by Mario Carneiro, 8-May-2013.)
Assertion
Ref Expression
mulpipq2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩)

Proof of Theorem mulpipq2
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xp1st 5792 . . . 4 (𝐴 ∈ (N × N) → (1st𝐴) ∈ N)
2 xp1st 5792 . . . 4 (𝐵 ∈ (N × N) → (1st𝐵) ∈ N)
3 mulclpi 6426 . . . 4 (((1st𝐴) ∈ N ∧ (1st𝐵) ∈ N) → ((1st𝐴) ·N (1st𝐵)) ∈ N)
41, 2, 3syl2an 273 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ((1st𝐴) ·N (1st𝐵)) ∈ N)
5 xp2nd 5793 . . . 4 (𝐴 ∈ (N × N) → (2nd𝐴) ∈ N)
6 xp2nd 5793 . . . 4 (𝐵 ∈ (N × N) → (2nd𝐵) ∈ N)
7 mulclpi 6426 . . . 4 (((2nd𝐴) ∈ N ∧ (2nd𝐵) ∈ N) → ((2nd𝐴) ·N (2nd𝐵)) ∈ N)
85, 6, 7syl2an 273 . . 3 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ((2nd𝐴) ·N (2nd𝐵)) ∈ N)
9 opexg 3964 . . 3 ((((1st𝐴) ·N (1st𝐵)) ∈ N ∧ ((2nd𝐴) ·N (2nd𝐵)) ∈ N) → ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩ ∈ V)
104, 8, 9syl2anc 391 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩ ∈ V)
11 fveq2 5178 . . . . 5 (𝑥 = 𝐴 → (1st𝑥) = (1st𝐴))
1211oveq1d 5527 . . . 4 (𝑥 = 𝐴 → ((1st𝑥) ·N (1st𝑦)) = ((1st𝐴) ·N (1st𝑦)))
13 fveq2 5178 . . . . 5 (𝑥 = 𝐴 → (2nd𝑥) = (2nd𝐴))
1413oveq1d 5527 . . . 4 (𝑥 = 𝐴 → ((2nd𝑥) ·N (2nd𝑦)) = ((2nd𝐴) ·N (2nd𝑦)))
1512, 14opeq12d 3557 . . 3 (𝑥 = 𝐴 → ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩ = ⟨((1st𝐴) ·N (1st𝑦)), ((2nd𝐴) ·N (2nd𝑦))⟩)
16 fveq2 5178 . . . . 5 (𝑦 = 𝐵 → (1st𝑦) = (1st𝐵))
1716oveq2d 5528 . . . 4 (𝑦 = 𝐵 → ((1st𝐴) ·N (1st𝑦)) = ((1st𝐴) ·N (1st𝐵)))
18 fveq2 5178 . . . . 5 (𝑦 = 𝐵 → (2nd𝑦) = (2nd𝐵))
1918oveq2d 5528 . . . 4 (𝑦 = 𝐵 → ((2nd𝐴) ·N (2nd𝑦)) = ((2nd𝐴) ·N (2nd𝐵)))
2017, 19opeq12d 3557 . . 3 (𝑦 = 𝐵 → ⟨((1st𝐴) ·N (1st𝑦)), ((2nd𝐴) ·N (2nd𝑦))⟩ = ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩)
21 df-mpq 6443 . . 3 ·pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨((1st𝑥) ·N (1st𝑦)), ((2nd𝑥) ·N (2nd𝑦))⟩)
2215, 20, 21ovmpt2g 5635 . 2 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩ ∈ V) → (𝐴 ·pQ 𝐵) = ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩)
2310, 22mpd3an3 1233 1 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ·pQ 𝐵) = ⟨((1st𝐴) ·N (1st𝐵)), ((2nd𝐴) ·N (2nd𝐵))⟩)
 Colors of variables: wff set class Syntax hints:   → wi 4   ∧ wa 97   = wceq 1243   ∈ wcel 1393  Vcvv 2557  ⟨cop 3378   × cxp 4343  ‘cfv 4902  (class class class)co 5512  1st c1st 5765  2nd c2nd 5766  Ncnpi 6370   ·N cmi 6372   ·pQ cmpq 6375 This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311 This theorem depends on definitions:  df-bi 110  df-dc 743  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-id 4030  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-oadd 6005  df-omul 6006  df-ni 6402  df-mi 6404  df-mpq 6443 This theorem is referenced by:  mulpipq  6470
 Copyright terms: Public domain W3C validator