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

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

Proof of Theorem addpipqqs
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 𝑢 𝑡 𝑠 𝑓 𝑔 ℎ 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 addpipqqslem 7743 . 2 (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ⟨((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)⟩ ∈ (N × N))
2 addpipqqslem 7743 . 2 (((𝑎 ∈ N ∧ 𝑏 ∈ N) ∧ (𝑔 ∈ N ∧ ℎ ∈ N)) → ⟨((𝑎 ·N ℎ) +N (𝑏 ·N 𝑔)), (𝑏 ·N ℎ)⟩ ∈ (N × N))
3 addpipqqslem 7743 . 2 (((𝑐 ∈ N ∧ 𝑑 ∈ N) ∧ (𝑡 ∈ N ∧ 𝑠 ∈ N)) → ⟨((𝑐 ·N 𝑠) +N (𝑑 ·N 𝑡)), (𝑑 ·N 𝑠)⟩ ∈ (N × N))
4 enqex 7734 . 2 ~Q ∈ V
5 enqer 7732 . 2 ~Q Er (N × N)
6 df-enq 7721 . 2 ~Q = {⟨𝑥, 𝑦⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑧∃𝑤∃𝑣∃𝑢((𝑥 = ⟨𝑧, 𝑤⟩ ∧ 𝑦 = ⟨𝑣, 𝑢⟩) ∧ (𝑧 ·N 𝑢) = (𝑤 ·N 𝑣)))}
7 oveq12 6097 . . . 4 ((𝑧 = 𝑎 ∧ 𝑢 = 𝑑) → (𝑧 ·N 𝑢) = (𝑎 ·N 𝑑))
8 oveq12 6097 . . . 4 ((𝑤 = 𝑏 ∧ 𝑣 = 𝑐) → (𝑤 ·N 𝑣) = (𝑏 ·N 𝑐))
97, 8eqeqan12d 2254 . . 3 (((𝑧 = 𝑎 ∧ 𝑢 = 𝑑) ∧ (𝑤 = 𝑏 ∧ 𝑣 = 𝑐)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑎 ·N 𝑑) = (𝑏 ·N 𝑐)))
109an42s 597 . 2 (((𝑧 = 𝑎 ∧ 𝑤 = 𝑏) ∧ (𝑣 = 𝑐 ∧ 𝑢 = 𝑑)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑎 ·N 𝑑) = (𝑏 ·N 𝑐)))
11 oveq12 6097 . . . 4 ((𝑧 = 𝑔 ∧ 𝑢 = 𝑠) → (𝑧 ·N 𝑢) = (𝑔 ·N 𝑠))
12 oveq12 6097 . . . 4 ((𝑤 = ℎ ∧ 𝑣 = 𝑡) → (𝑤 ·N 𝑣) = (ℎ ·N 𝑡))
1311, 12eqeqan12d 2254 . . 3 (((𝑧 = 𝑔 ∧ 𝑢 = 𝑠) ∧ (𝑤 = ℎ ∧ 𝑣 = 𝑡)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑔 ·N 𝑠) = (ℎ ·N 𝑡)))
1413an42s 597 . 2 (((𝑧 = 𝑔 ∧ 𝑤 = ℎ) ∧ (𝑣 = 𝑡 ∧ 𝑢 = 𝑠)) → ((𝑧 ·N 𝑢) = (𝑤 ·N 𝑣) ↔ (𝑔 ·N 𝑠) = (ℎ ·N 𝑡)))
15 dfplpq2 7728 . 2 +pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))}
16 oveq12 6097 . . . . 5 ((𝑤 = 𝑎 ∧ 𝑓 = ℎ) → (𝑤 ·N 𝑓) = (𝑎 ·N ℎ))
17 oveq12 6097 . . . . 5 ((𝑣 = 𝑏 ∧ 𝑢 = 𝑔) → (𝑣 ·N 𝑢) = (𝑏 ·N 𝑔))
1816, 17oveqan12d 6107 . . . 4 (((𝑤 = 𝑎 ∧ 𝑓 = ℎ) ∧ (𝑣 = 𝑏 ∧ 𝑢 = 𝑔)) → ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)) = ((𝑎 ·N ℎ) +N (𝑏 ·N 𝑔)))
1918an42s 597 . . 3 (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)) = ((𝑎 ·N ℎ) +N (𝑏 ·N 𝑔)))
20 oveq12 6097 . . . 4 ((𝑣 = 𝑏 ∧ 𝑓 = ℎ) → (𝑣 ·N 𝑓) = (𝑏 ·N ℎ))
2120ad2ant2l 512 . . 3 (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → (𝑣 ·N 𝑓) = (𝑏 ·N ℎ))
2219, 21opeq12d 3912 . 2 (((𝑤 = 𝑎 ∧ 𝑣 = 𝑏) ∧ (𝑢 = 𝑔 ∧ 𝑓 = ℎ)) → ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩ = ⟨((𝑎 ·N ℎ) +N (𝑏 ·N 𝑔)), (𝑏 ·N ℎ)⟩)
23 oveq12 6097 . . . . 5 ((𝑤 = 𝑐 ∧ 𝑓 = 𝑠) → (𝑤 ·N 𝑓) = (𝑐 ·N 𝑠))
24 oveq12 6097 . . . . 5 ((𝑣 = 𝑑 ∧ 𝑢 = 𝑡) → (𝑣 ·N 𝑢) = (𝑑 ·N 𝑡))
2523, 24oveqan12d 6107 . . . 4 (((𝑤 = 𝑐 ∧ 𝑓 = 𝑠) ∧ (𝑣 = 𝑑 ∧ 𝑢 = 𝑡)) → ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)) = ((𝑐 ·N 𝑠) +N (𝑑 ·N 𝑡)))
2625an42s 597 . . 3 (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)) = ((𝑐 ·N 𝑠) +N (𝑑 ·N 𝑡)))
27 oveq12 6097 . . . 4 ((𝑣 = 𝑑 ∧ 𝑓 = 𝑠) → (𝑣 ·N 𝑓) = (𝑑 ·N 𝑠))
2827ad2ant2l 512 . . 3 (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → (𝑣 ·N 𝑓) = (𝑑 ·N 𝑠))
2926, 28opeq12d 3912 . 2 (((𝑤 = 𝑐 ∧ 𝑣 = 𝑑) ∧ (𝑢 = 𝑡 ∧ 𝑓 = 𝑠)) → ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩ = ⟨((𝑐 ·N 𝑠) +N (𝑑 ·N 𝑡)), (𝑑 ·N 𝑠)⟩)
30 oveq12 6097 . . . . 5 ((𝑤 = 𝐴 ∧ 𝑓 = 𝐷) → (𝑤 ·N 𝑓) = (𝐴 ·N 𝐷))
31 oveq12 6097 . . . . 5 ((𝑣 = 𝐵 ∧ 𝑢 = 𝐶) → (𝑣 ·N 𝑢) = (𝐵 ·N 𝐶))
3230, 31oveqan12d 6107 . . . 4 (((𝑤 = 𝐴 ∧ 𝑓 = 𝐷) ∧ (𝑣 = 𝐵 ∧ 𝑢 = 𝐶)) → ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)) = ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)))
3332an42s 597 . . 3 (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)) = ((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)))
34 oveq12 6097 . . . 4 ((𝑣 = 𝐵 ∧ 𝑓 = 𝐷) → (𝑣 ·N 𝑓) = (𝐵 ·N 𝐷))
3534ad2ant2l 512 . . 3 (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → (𝑣 ·N 𝑓) = (𝐵 ·N 𝐷))
3633, 35opeq12d 3912 . 2 (((𝑤 = 𝐴 ∧ 𝑣 = 𝐵) ∧ (𝑢 = 𝐶 ∧ 𝑓 = 𝐷)) → ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩ = ⟨((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)⟩)
37 df-plqqs 7723 . 2 +Q = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ Q ∧ 𝑦 ∈ Q) ∧ ∃𝑎∃𝑏∃𝑐∃𝑑((𝑥 = [⟨𝑎, 𝑏⟩] ~Q ∧ 𝑦 = [⟨𝑐, 𝑑⟩] ~Q ) ∧ 𝑧 = [(⟨𝑎, 𝑏⟩ +pQ ⟨𝑐, 𝑑⟩)] ~Q ))}
38 df-nqqs 7722 . 2 Q = ((N × N) / ~Q )
39 addcmpblnq 7741 . 2 ((((𝑎 ∈ N ∧ 𝑏 ∈ N) ∧ (𝑐 ∈ N ∧ 𝑑 ∈ N)) ∧ ((𝑔 ∈ N ∧ ℎ ∈ N) ∧ (𝑡 ∈ N ∧ 𝑠 ∈ N))) → (((𝑎 ·N 𝑑) = (𝑏 ·N 𝑐) ∧ (𝑔 ·N 𝑠) = (ℎ ·N 𝑡)) → ⟨((𝑎 ·N ℎ) +N (𝑏 ·N 𝑔)), (𝑏 ·N ℎ)⟩ ~Q ⟨((𝑐 ·N 𝑠) +N (𝑑 ·N 𝑡)), (𝑑 ·N 𝑠)⟩))
401, 2, 3, 4, 5, 6, 10, 14, 15, 22, 29, 36, 37, 38, 39oviec 6919 1 (((𝐴 ∈ N ∧ 𝐵 ∈ N) ∧ (𝐶 ∈ N ∧ 𝐷 ∈ N)) → ([⟨𝐴, 𝐵⟩] ~Q +Q [⟨𝐶, 𝐷⟩] ~Q ) = [⟨((𝐴 ·N 𝐷) +N (𝐵 ·N 𝐶)), (𝐵 ·N 𝐷)⟩] ~Q )
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  ⟨cop 3712  (class class class)co 6088  [cec 6809  Ncnpi 7646   +N cpli 7647   ·N cmi 7648   +pQ cplpq 7650   ~Q ceq 7653  Qcnq 7654   +Q cplq 7656
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7678  df-pli 7679  df-mi 7680  df-plpq 7718  df-enq 7721  df-nqqs 7722  df-plqqs 7723
This theorem is used by:  addclnq  7749  addcomnqg  7755  addassnqg  7756  distrnqg  7761  ltanqg  7774  1lt2nq  7780  ltexnqq  7782  nqnq0a  7828  addpinq1  7838
  Copyright terms: Public domain W3C validator