MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  addpqnq Structured version   Visualization version   GIF version

Theorem addpqnq 9707
Description: Addition of positive fractions in terms of positive integers. (Contributed by NM, 28-Aug-1995.) (Revised by Mario Carneiro, 26-Dec-2014.) (New usage is discouraged.)
Assertion
Ref Expression
addpqnq ((𝐴Q𝐵Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵)))

Proof of Theorem addpqnq
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-plq 9683 . . . . 5 +Q = (([Q] ∘ +pQ ) ↾ (Q × Q))
21fveq1i 6151 . . . 4 ( +Q ‘⟨𝐴, 𝐵⟩) = ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩)
32a1i 11 . . 3 ((𝐴Q𝐵Q) → ( +Q ‘⟨𝐴, 𝐵⟩) = ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩))
4 opelxpi 5110 . . . 4 ((𝐴Q𝐵Q) → ⟨𝐴, 𝐵⟩ ∈ (Q × Q))
5 fvres 6166 . . . 4 (⟨𝐴, 𝐵⟩ ∈ (Q × Q) → ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩) = (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩))
64, 5syl 17 . . 3 ((𝐴Q𝐵Q) → ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩) = (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩))
7 df-plpq 9677 . . . . 5 +pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨(((1st𝑥) ·N (2nd𝑦)) +N ((1st𝑦) ·N (2nd𝑥))), ((2nd𝑥) ·N (2nd𝑦))⟩)
8 opex 4895 . . . . 5 ⟨(((1st𝑥) ·N (2nd𝑦)) +N ((1st𝑦) ·N (2nd𝑥))), ((2nd𝑥) ·N (2nd𝑦))⟩ ∈ V
97, 8fnmpt2i 7187 . . . 4 +pQ Fn ((N × N) × (N × N))
10 elpqn 9694 . . . . 5 (𝐴Q𝐴 ∈ (N × N))
11 elpqn 9694 . . . . 5 (𝐵Q𝐵 ∈ (N × N))
12 opelxpi 5110 . . . . 5 ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ⟨𝐴, 𝐵⟩ ∈ ((N × N) × (N × N)))
1310, 11, 12syl2an 494 . . . 4 ((𝐴Q𝐵Q) → ⟨𝐴, 𝐵⟩ ∈ ((N × N) × (N × N)))
14 fvco2 6232 . . . 4 (( +pQ Fn ((N × N) × (N × N)) ∧ ⟨𝐴, 𝐵⟩ ∈ ((N × N) × (N × N))) → (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩)))
159, 13, 14sylancr 694 . . 3 ((𝐴Q𝐵Q) → (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩)))
163, 6, 153eqtrd 2659 . 2 ((𝐴Q𝐵Q) → ( +Q ‘⟨𝐴, 𝐵⟩) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩)))
17 df-ov 6610 . 2 (𝐴 +Q 𝐵) = ( +Q ‘⟨𝐴, 𝐵⟩)
18 df-ov 6610 . . 3 (𝐴 +pQ 𝐵) = ( +pQ ‘⟨𝐴, 𝐵⟩)
1918fveq2i 6153 . 2 ([Q]‘(𝐴 +pQ 𝐵)) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩))
2016, 17, 193eqtr4g 2680 1 ((𝐴Q𝐵Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384   = wceq 1480  wcel 1987  cop 4156   × cxp 5074  cres 5078  ccom 5080   Fn wfn 5844  cfv 5849  (class class class)co 6607  1st c1st 7114  2nd c2nd 7115  Ncnpi 9613   +N cpli 9614   ·N cmi 9615   +pQ cplpq 9617  Qcnq 9621  [Q]cerq 9623   +Q cplq 9624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4743  ax-nul 4751  ax-pow 4805  ax-pr 4869  ax-un 6905
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3188  df-sbc 3419  df-csb 3516  df-dif 3559  df-un 3561  df-in 3563  df-ss 3570  df-nul 3894  df-if 4061  df-sn 4151  df-pr 4153  df-op 4157  df-uni 4405  df-iun 4489  df-br 4616  df-opab 4676  df-mpt 4677  df-id 4991  df-xp 5082  df-rel 5083  df-cnv 5084  df-co 5085  df-dm 5086  df-rn 5087  df-res 5088  df-ima 5089  df-iota 5812  df-fun 5851  df-fn 5852  df-f 5853  df-fv 5857  df-ov 6610  df-oprab 6611  df-mpt2 6612  df-1st 7116  df-2nd 7117  df-plpq 9677  df-nq 9681  df-plq 9683
This theorem is referenced by:  addclnq  9714  addcomnq  9720  adderpq  9725  addassnq  9727  distrnq  9730  ltanq  9740  1lt2nq  9742  prlem934  9802
  Copyright terms: Public domain W3C validator