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

Theorem mulpipqqs 7314
Description: Multiplication of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.)
Assertion
Ref Expression
mulpipqqs (((𝐴N𝐵N) ∧ (𝐶N𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q ·Q [⟨𝐶, 𝐷⟩] ~Q ) = [⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩] ~Q )

Proof of Theorem mulpipqqs
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑡 𝑠 𝑓 𝑔 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 mulclpi 7269 . . . 4 ((𝐴N𝐶N) → (𝐴 ·N 𝐶) ∈ N)
2 mulclpi 7269 . . . 4 ((𝐵N𝐷N) → (𝐵 ·N 𝐷) ∈ N)
3 opelxpi 4636 . . . 4 (((𝐴 ·N 𝐶) ∈ N ∧ (𝐵 ·N 𝐷) ∈ N) → ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
41, 2, 3syl2an 287 . . 3 (((𝐴N𝐶N) ∧ (𝐵N𝐷N)) → ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
54an4s 578 . 2 (((𝐴N𝐵N) ∧ (𝐶N𝐷N)) → ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
6 mulclpi 7269 . . . 4 ((𝑎N𝑔N) → (𝑎 ·N 𝑔) ∈ N)
7 mulclpi 7269 . . . 4 ((𝑏NN) → (𝑏 ·N ) ∈ N)
8 opelxpi 4636 . . . 4 (((𝑎 ·N 𝑔) ∈ N ∧ (𝑏 ·N ) ∈ N) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N )⟩ ∈ (N × N))
96, 7, 8syl2an 287 . . 3 (((𝑎N𝑔N) ∧ (𝑏NN)) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N )⟩ ∈ (N × N))
109an4s 578 . 2 (((𝑎N𝑏N) ∧ (𝑔NN)) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N )⟩ ∈ (N × N))
11 mulclpi 7269 . . . 4 ((𝑐N𝑡N) → (𝑐 ·N 𝑡) ∈ N)
12 mulclpi 7269 . . . 4 ((𝑑N𝑠N) → (𝑑 ·N 𝑠) ∈ N)
13 opelxpi 4636 . . . 4 (((𝑐 ·N 𝑡) ∈ N ∧ (𝑑 ·N 𝑠) ∈ N) → ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
1411, 12, 13syl2an 287 . . 3 (((𝑐N𝑡N) ∧ (𝑑N𝑠N)) → ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
1514an4s 578 . 2 (((𝑐N𝑑N) ∧ (𝑡N𝑠N)) → ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
16 enqex 7301 . 2 ~Q ∈ V
17 enqer 7299 . 2 ~Q Er (N × N)
18 df-enq 7288 . 2 ~Q = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑧𝑤𝑣𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·N 𝑢) = (𝑤 ·N 𝑣)))}
19 simpll 519 . . . 4 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → 𝑧 = 𝑎)
20 simprr 522 . . . 4 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → 𝑢 = 𝑑)
2119, 20oveq12d 5860 . . 3 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → (𝑧 ·N 𝑢) = (𝑎 ·N 𝑑))
22 simplr 520 . . . 4 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → 𝑤 = 𝑏)
23 simprl 521 . . . 4 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → 𝑣 = 𝑐)
2422, 23oveq12d 5860 . . 3 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → (𝑤 ·N 𝑣) = (𝑏 ·N 𝑐))
2521, 24eqeq12d 2180 . 2 (((𝑧 = 𝑎𝑤 = 𝑏) ∧ (𝑣 = 𝑐𝑢 = 𝑑)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑎 ·N 𝑑) = (𝑏 ·N 𝑐)))
26 simpll 519 . . . 4 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → 𝑧 = 𝑔)
27 simprr 522 . . . 4 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → 𝑢 = 𝑠)
2826, 27oveq12d 5860 . . 3 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → (𝑧 ·N 𝑢) = (𝑔 ·N 𝑠))
29 simplr 520 . . . 4 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → 𝑤 = )
30 simprl 521 . . . 4 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → 𝑣 = 𝑡)
3129, 30oveq12d 5860 . . 3 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → (𝑤 ·N 𝑣) = ( ·N 𝑡))
3228, 31eqeq12d 2180 . 2 (((𝑧 = 𝑔𝑤 = ) ∧ (𝑣 = 𝑡𝑢 = 𝑠)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑔 ·N 𝑠) = ( ·N 𝑡)))
33 dfmpq2 7296 . 2 ·pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤𝑣𝑢𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))}
34 simpll 519 . . . 4 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → 𝑤 = 𝑎)
35 simprl 521 . . . 4 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → 𝑢 = 𝑔)
3634, 35oveq12d 5860 . . 3 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → (𝑤 ·N 𝑢) = (𝑎 ·N 𝑔))
37 simplr 520 . . . 4 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → 𝑣 = 𝑏)
38 simprr 522 . . . 4 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → 𝑓 = )
3937, 38oveq12d 5860 . . 3 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → (𝑣 ·N 𝑓) = (𝑏 ·N ))
4036, 39opeq12d 3766 . 2 (((𝑤 = 𝑎𝑣 = 𝑏) ∧ (𝑢 = 𝑔𝑓 = )) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨(𝑎 ·N 𝑔), (𝑏 ·N )⟩)
41 simpll 519 . . . 4 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → 𝑤 = 𝑐)
42 simprl 521 . . . 4 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → 𝑢 = 𝑡)
4341, 42oveq12d 5860 . . 3 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → (𝑤 ·N 𝑢) = (𝑐 ·N 𝑡))
44 simplr 520 . . . 4 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → 𝑣 = 𝑑)
45 simprr 522 . . . 4 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → 𝑓 = 𝑠)
4644, 45oveq12d 5860 . . 3 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → (𝑣 ·N 𝑓) = (𝑑 ·N 𝑠))
4743, 46opeq12d 3766 . 2 (((𝑤 = 𝑐𝑣 = 𝑑) ∧ (𝑢 = 𝑡𝑓 = 𝑠)) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩)
48 simpll 519 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑤 = 𝐴)
49 simprl 521 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑢 = 𝐶)
5048, 49oveq12d 5860 . . 3 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → (𝑤 ·N 𝑢) = (𝐴 ·N 𝐶))
51 simplr 520 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑣 = 𝐵)
52 simprr 522 . . . 4 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → 𝑓 = 𝐷)
5351, 52oveq12d 5860 . . 3 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → (𝑣 ·N 𝑓) = (𝐵 ·N 𝐷))
5450, 53opeq12d 3766 . 2 (((𝑤 = 𝐴𝑣 = 𝐵) ∧ (𝑢 = 𝐶𝑓 = 𝐷)) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩)
55 df-mqqs 7291 . 2 ·Q = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥Q𝑦Q) ∧ ∃𝑎𝑏𝑐𝑑((𝑥 = [⟨𝑎, 𝑏⟩] ~Q𝑦 = [⟨𝑐, 𝑑⟩] ~Q ) ∧ 𝑧 = [(⟨𝑎, 𝑏⟩ ·pQ𝑐, 𝑑⟩)] ~Q ))}
56 df-nqqs 7289 . 2 Q = ((N × N) / ~Q )
57 mulcmpblnq 7309 . 2 ((((𝑎N𝑏N) ∧ (𝑐N𝑑N)) ∧ ((𝑔NN) ∧ (𝑡N𝑠N))) → (((𝑎 ·N 𝑑) = (𝑏 ·N 𝑐) ∧ (𝑔 ·N 𝑠) = ( ·N 𝑡)) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N )⟩ ~Q ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩))
585, 10, 15, 16, 17, 18, 25, 32, 33, 40, 47, 54, 55, 56, 57oviec 6607 1 (((𝐴N𝐵N) ∧ (𝐶N𝐷N)) → ([⟨𝐴, 𝐵⟩] ~Q ·Q [⟨𝐶, 𝐷⟩] ~Q ) = [⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩] ~Q )
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103   = wceq 1343  wcel 2136  cop 3579   × cxp 4602  (class class class)co 5842  [cec 6499  Ncnpi 7213   ·N cmi 7215   ·pQ cmpq 7218   ~Q ceq 7220  Qcnq 7221   ·Q cmq 7224
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-13 2138  ax-14 2139  ax-ext 2147  ax-coll 4097  ax-sep 4100  ax-nul 4108  ax-pow 4153  ax-pr 4187  ax-un 4411  ax-setind 4514  ax-iinf 4565
This theorem depends on definitions:  df-bi 116  df-dc 825  df-3or 969  df-3an 970  df-tru 1346  df-fal 1349  df-nf 1449  df-sb 1751  df-eu 2017  df-mo 2018  df-clab 2152  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ne 2337  df-ral 2449  df-rex 2450  df-reu 2451  df-rab 2453  df-v 2728  df-sbc 2952  df-csb 3046  df-dif 3118  df-un 3120  df-in 3122  df-ss 3129  df-nul 3410  df-pw 3561  df-sn 3582  df-pr 3583  df-op 3585  df-uni 3790  df-int 3825  df-iun 3868  df-br 3983  df-opab 4044  df-mpt 4045  df-tr 4081  df-id 4271  df-iord 4344  df-on 4346  df-suc 4349  df-iom 4568  df-xp 4610  df-rel 4611  df-cnv 4612  df-co 4613  df-dm 4614  df-rn 4615  df-res 4616  df-ima 4617  df-iota 5153  df-fun 5190  df-fn 5191  df-f 5192  df-f1 5193  df-fo 5194  df-f1o 5195  df-fv 5196  df-ov 5845  df-oprab 5846  df-mpo 5847  df-1st 6108  df-2nd 6109  df-recs 6273  df-irdg 6338  df-oadd 6388  df-omul 6389  df-er 6501  df-ec 6503  df-qs 6507  df-ni 7245  df-mi 7247  df-mpq 7286  df-enq 7288  df-nqqs 7289  df-mqqs 7291
This theorem is referenced by:  mulclnq  7317  mulcomnqg  7324  mulassnqg  7325  distrnqg  7328  mulidnq  7330  recexnq  7331  ltmnqg  7342  nqnq0m  7396
  Copyright terms: Public domain W3C validator