Theorem mulpipqqs 7174

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.

Step	Hyp	Ref	Expression
1		mulclpi 7129	. . . 4 ⊢ ((𝐴 ∈ N ∧ 𝐶 ∈ N) → (𝐴 ·N 𝐶) ∈ N)
2		mulclpi 7129	. . . 4 ⊢ ((𝐵 ∈ N ∧ 𝐷 ∈ N) → (𝐵 ·N 𝐷) ∈ N)
3		opelxpi 4566	. . . 4 ⊢ (((𝐴 ·N 𝐶) ∈ N ∧ (𝐵 ·N 𝐷) ∈ N) → ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
4	1, 2, 3	syl2an 287	. . 3 ⊢ (((𝐴 ∈ N ∧ 𝐶 ∈ N) ∧ (𝐵 ∈ N ∧ 𝐷 ∈ N)) → ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
5	4	an4s 577	. 2 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
6		mulclpi 7129	. . . 4 ⊢ ((𝑎 ∈ N ∧ 𝑔 ∈ N) → (𝑎 ·N 𝑔) ∈ N)
7		mulclpi 7129	. . . 4 ⊢ ((𝑏 ∈ N ∧ ℎ ∈ N) → (𝑏 ·N ℎ) ∈ N)
8		opelxpi 4566	. . . 4 ⊢ (((𝑎 ·N 𝑔) ∈ N ∧ (𝑏 ·N ℎ) ∈ N) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N ℎ)⟩ ∈ (N × N))
9	6, 7, 8	syl2an 287	. . 3 ⊢ (((𝑎 ∈ N ∧ 𝑔 ∈ N) ∧ (𝑏 ∈ N ∧ ℎ ∈ N)) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N ℎ)⟩ ∈ (N × N))
10	9	an4s 577	. 2 ⊢ (((𝑎 ∈ N ∧ 𝑏 ∈ N) ∧ (𝑔 ∈ N ∧ ℎ ∈ N)) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N ℎ)⟩ ∈ (N × N))
11		mulclpi 7129	. . . 4 ⊢ ((𝑐 ∈ N ∧ 𝑡 ∈ N) → (𝑐 ·N 𝑡) ∈ N)
12		mulclpi 7129	. . . 4 ⊢ ((𝑑 ∈ N ∧ 𝑠 ∈ N) → (𝑑 ·N 𝑠) ∈ N)
13		opelxpi 4566	. . . 4 ⊢ (((𝑐 ·N 𝑡) ∈ N ∧ (𝑑 ·N 𝑠) ∈ N) → ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
14	11, 12, 13	syl2an 287	. . 3 ⊢ (((𝑐 ∈ N ∧ 𝑡 ∈ N) ∧ (𝑑 ∈ N ∧ 𝑠 ∈ N)) → ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
15	14	an4s 577	. 2 ⊢ (((𝑐 ∈ N ∧ 𝑑 ∈ N) ∧ (𝑡 ∈ N ∧ 𝑠 ∈ N)) → ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
16		enqex 7161	. 2 ⊢ ~Q ∈ V
17		enqer 7159	. 2 ⊢ ~Q Er (N × N)
18		df-enq 7148	. 2 ⊢ ~Q = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·N 𝑢) = (𝑤 ·N 𝑣)))}
19		simpll 518	. . . 4 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → 𝑧 = 𝑎)
20		simprr 521	. . . 4 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → 𝑢 = 𝑑)
21	19, 20	oveq12d 5785	. . 3 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → (𝑧 ·N 𝑢) = (𝑎 ·N 𝑑))
22		simplr 519	. . . 4 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → 𝑤 = 𝑏)
23		simprl 520	. . . 4 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → 𝑣 = 𝑐)
24	22, 23	oveq12d 5785	. . 3 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → (𝑤 ·N 𝑣) = (𝑏 ·N 𝑐))
25	21, 24	eqeq12d 2152	. 2 ⊢ (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑎 ·N 𝑑) = (𝑏 ·N 𝑐)))
26		simpll 518	. . . 4 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → 𝑧 = 𝑔)
27		simprr 521	. . . 4 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → 𝑢 = 𝑠)
28	26, 27	oveq12d 5785	. . 3 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → (𝑧 ·N 𝑢) = (𝑔 ·N 𝑠))
29		simplr 519	. . . 4 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → 𝑤 = ℎ)
30		simprl 520	. . . 4 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → 𝑣 = 𝑡)
31	29, 30	oveq12d 5785	. . 3 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → (𝑤 ·N 𝑣) = (ℎ ·N 𝑡))
32	28, 31	eqeq12d 2152	. 2 ⊢ (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑔 ·N 𝑠) = (ℎ ·N 𝑡)))
33		dfmpq2 7156	. 2 ⊢ ·pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))}
34		simpll 518	. . . 4 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → 𝑤 = 𝑎)
35		simprl 520	. . . 4 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → 𝑢 = 𝑔)
36	34, 35	oveq12d 5785	. . 3 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → (𝑤 ·N 𝑢) = (𝑎 ·N 𝑔))
37		simplr 519	. . . 4 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → 𝑣 = 𝑏)
38		simprr 521	. . . 4 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → 𝑓 = ℎ)
39	37, 38	oveq12d 5785	. . 3 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → (𝑣 ·N 𝑓) = (𝑏 ·N ℎ))
40	36, 39	opeq12d 3708	. 2 ⊢ (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨(𝑎 ·N 𝑔), (𝑏 ·N ℎ)⟩)
41		simpll 518	. . . 4 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → 𝑤 = 𝑐)
42		simprl 520	. . . 4 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → 𝑢 = 𝑡)
43	41, 42	oveq12d 5785	. . 3 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → (𝑤 ·N 𝑢) = (𝑐 ·N 𝑡))
44		simplr 519	. . . 4 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → 𝑣 = 𝑑)
45		simprr 521	. . . 4 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → 𝑓 = 𝑠)
46	44, 45	oveq12d 5785	. . 3 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → (𝑣 ·N 𝑓) = (𝑑 ·N 𝑠))
47	43, 46	opeq12d 3708	. 2 ⊢ (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩)
48		simpll 518	. . . 4 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → 𝑤 = 𝐴)
49		simprl 520	. . . 4 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → 𝑢 = 𝐶)
50	48, 49	oveq12d 5785	. . 3 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → (𝑤 ·N 𝑢) = (𝐴 ·N 𝐶))
51		simplr 519	. . . 4 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → 𝑣 = 𝐵)
52		simprr 521	. . . 4 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → 𝑓 = 𝐷)
53	51, 52	oveq12d 5785	. . 3 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → (𝑣 ·N 𝑓) = (𝐵 ·N 𝐷))
54	50, 53	opeq12d 3708	. 2 ⊢ (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩)
55		df-mqqs 7151	. 2 ⊢ ·Q = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑎∃𝑏∃𝑐∃𝑑((𝑥 = [⟨𝑎, 𝑏⟩] ~Q ∧ 𝑦 = [⟨𝑐, 𝑑⟩] ~Q ) ∧ 𝑧 = [(⟨𝑎, 𝑏⟩ ·pQ ⟨𝑐, 𝑑⟩)] ~Q ))}
56		df-nqqs 7149	. 2 ⊢ Q = ((N × N) / ~Q )
57		mulcmpblnq 7169	. 2 ⊢ ((((𝑎 ∈ N ∧ 𝑏 ∈ N) ∧ (𝑐 ∈ N ∧ 𝑑 ∈ N)) ∧ ((𝑔 ∈ N ∧ ℎ ∈ N) ∧ (𝑡 ∈ N ∧ 𝑠 ∈ N))) → (((𝑎 ·N 𝑑) = (𝑏 ·N 𝑐) ∧ (𝑔 ·N 𝑠) = (ℎ ·N 𝑡)) → ⟨(𝑎 ·N 𝑔), (𝑏 ·N ℎ)⟩ ~Q ⟨(𝑐 ·N 𝑡), (𝑑 ·N 𝑠)⟩))
58	5, 10, 15, 16, 17, 18, 25, 32, 33, 40, 47, 54, 55, 56, 57	oviec 6528	1 ⊢ (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ([⟨𝐴, 𝐵⟩] ~Q ·Q [⟨𝐶, 𝐷⟩] ~Q ) = [⟨(𝐴 ·N 𝐶), (𝐵 ·N 𝐷)⟩] ~Q )

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1331   ∈ wcel 1480  ⟨cop 3525   × cxp 4532  (class class class)co 5767  [cec 6420  Ncnpi 7073   ·_N cmi 7075   ·_pQ cmpq 7078   ~_Q ceq 7080  Qcnq 7081   ·_Q cmq 7084

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 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497

This theorem depends on definitions:  df-bi 116  df-dc 820  df-3or 963  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-oadd 6310  df-omul 6311  df-er 6422  df-ec 6424  df-qs 6428  df-ni 7105  df-mi 7107  df-mpq 7146  df-enq 7148  df-nqqs 7149  df-mqqs 7151

This theorem is referenced by:  mulclnq  7177  mulcomnqg  7184  mulassnqg  7185  distrnqg  7188  mulidnq  7190  recexnq  7191  ltmnqg  7202  nqnq0m  7256