Theorem addpqnq 10950

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.

Step	Hyp	Ref	Expression
1		df-plq 10926	. . . . 5 ⊢ +Q = (([Q] ∘ +pQ ) ↾ (Q × Q))
2	1	fveq1i 6883	. . . 4 ⊢ ( +Q ‘⟨𝐴, 𝐵⟩) = ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩)
3	2	a1i 11	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ( +Q ‘⟨𝐴, 𝐵⟩) = ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩))
4		opelxpi 5696	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ⟨𝐴, 𝐵⟩ ∈ (Q × Q))
5	4	fvresd 6902	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ((([Q] ∘ +pQ ) ↾ (Q × Q))‘⟨𝐴, 𝐵⟩) = (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩))
6		df-plpq 10920	. . . . 5 ⊢ +pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
7		opex 5443	. . . . 5 ⊢ ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩ ∈ V
8	6, 7	fnmpoi 8070	. . . 4 ⊢ +pQ Fn ((N × N) × (N × N))
9		elpqn 10937	. . . . 5 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N))
10		elpqn 10937	. . . . 5 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N))
11		opelxpi 5696	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → ⟨𝐴, 𝐵⟩ ∈ ((N × N) × (N × N)))
12	9, 10, 11	syl2an 608	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ⟨𝐴, 𝐵⟩ ∈ ((N × N) × (N × N)))
13		fvco2 6979	. . . 4 ⊢ (( +pQ Fn ((N × N) × (N × N)) ∧ ⟨𝐴, 𝐵⟩ ∈ ((N × N) × (N × N))) → (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩)))
14	8, 12, 13	sylancr 599	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (([Q] ∘ +pQ )‘⟨𝐴, 𝐵⟩) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩)))
15	3, 5, 14	3eqtrd 2801	. 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → ( +Q ‘⟨𝐴, 𝐵⟩) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩)))
16		df-ov 7419	. 2 ⊢ (𝐴 +Q 𝐵) = ( +Q ‘⟨𝐴, 𝐵⟩)
17		df-ov 7419	. . 3 ⊢ (𝐴 +pQ 𝐵) = ( +pQ ‘⟨𝐴, 𝐵⟩)
18	17	fveq2i 6885	. 2 ⊢ ([Q]‘(𝐴 +pQ 𝐵)) = ([Q]‘( +pQ ‘⟨𝐴, 𝐵⟩))
19	15, 16, 18	3eqtr4g 2822	1 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4593   × cxp 5657   ↾ cres 5661   ∘ ccom 5663   Fn wfn 6532  ‘cfv 6537  (class class class)co 7416  1^st c1st 7987  2^nd c2nd 7988  Ncnpi 10856   +_N cpli 10857   ·_N cmi 10858   +_pQ cplpq 10860  Qcnq 10864  [Q]cerq 10866   +_Q cplq 10867

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-1st 7989  df-2nd 7990  df-plpq 10920  df-nq 10924  df-plq 10926

This theorem is used by:  addclnq  10957  addcomnq  10963  adderpq  10968  addassnq  10970  distrnq  10973  ltanq  10983  1lt2nq  10985  prlem934  11045