Theorem addassnq 11014

Description: Addition of positive fractions is associative. (Contributed by NM, 2-Sep-1995.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
addassnq	⊢ ((𝐴 +Q 𝐵) +Q 𝐶) = (𝐴 +Q (𝐵 +Q 𝐶))

Proof of Theorem addassnq

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		addasspi 10951	. . . . . . . 8 ⊢ ((((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶))) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))) = (((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))))
2		ovex 7441	. . . . . . . . . . 11 ⊢ ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ V
3		ovex 7441	. . . . . . . . . . 11 ⊢ ((1st ‘𝐵) ·N (2nd ‘𝐴)) ∈ V
4		fvex 6886	. . . . . . . . . . 11 ⊢ (2nd ‘𝐶) ∈ V
5		mulcompi 10952	. . . . . . . . . . 11 ⊢ (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
6		distrpi 10954	. . . . . . . . . . 11 ⊢ (𝑥 ·N (𝑦 +N 𝑧)) = ((𝑥 ·N 𝑦) +N (𝑥 ·N 𝑧))
7	2, 3, 4, 5, 6	caovdir 7643	. . . . . . . . . 10 ⊢ ((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) = ((((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶)) +N (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)))
8		mulasspi 10953	. . . . . . . . . . 11 ⊢ (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶)) = ((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
9	8	oveq1i 7418	. . . . . . . . . 10 ⊢ ((((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶)) +N (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶))) = (((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)))
10	7, 9	eqtri 2783	. . . . . . . . 9 ⊢ ((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) = (((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)))
11	10	oveq1i 7418	. . . . . . . 8 ⊢ (((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))) = ((((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶))) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵))))
12		ovex 7441	. . . . . . . . . . 11 ⊢ ((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ V
13		ovex 7441	. . . . . . . . . . 11 ⊢ ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ V
14		fvex 6886	. . . . . . . . . . 11 ⊢ (2nd ‘𝐴) ∈ V
15	12, 13, 14, 5, 6	caovdir 7643	. . . . . . . . . 10 ⊢ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴)) = ((((1st ‘𝐵) ·N (2nd ‘𝐶)) ·N (2nd ‘𝐴)) +N (((1st ‘𝐶) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐴)))
16		fvex 6886	. . . . . . . . . . . 12 ⊢ (1st ‘𝐵) ∈ V
17		mulasspi 10953	. . . . . . . . . . . 12 ⊢ ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
18	16, 4, 14, 5, 17	caov32 7636	. . . . . . . . . . 11 ⊢ (((1st ‘𝐵) ·N (2nd ‘𝐶)) ·N (2nd ‘𝐴)) = (((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶))
19		mulasspi 10953	. . . . . . . . . . . 12 ⊢ (((1st ‘𝐶) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐴)) = ((1st ‘𝐶) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐴)))
20		mulcompi 10952	. . . . . . . . . . . . 13 ⊢ ((2nd ‘𝐵) ·N (2nd ‘𝐴)) = ((2nd ‘𝐴) ·N (2nd ‘𝐵))
21	20	oveq2i 7419	. . . . . . . . . . . 12 ⊢ ((1st ‘𝐶) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐴))) = ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))
22	19, 21	eqtri 2783	. . . . . . . . . . 11 ⊢ (((1st ‘𝐶) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐴)) = ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))
23	18, 22	oveq12i 7420	. . . . . . . . . 10 ⊢ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) ·N (2nd ‘𝐴)) +N (((1st ‘𝐶) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐴))) = ((((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵))))
24	15, 23	eqtri 2783	. . . . . . . . 9 ⊢ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴)) = ((((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵))))
25	24	oveq2i 7419	. . . . . . . 8 ⊢ (((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴))) = (((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐴)) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))))
26	1, 11, 25	3eqtr4i 2793	. . . . . . 7 ⊢ (((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))) = (((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴)))
27		mulasspi 10953	. . . . . . 7 ⊢ (((2nd ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶)) = ((2nd ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
28	26, 27	opeq12i 4837	. . . . . 6 ⊢ ⟨(((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))), (((2nd ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶))⟩ = ⟨(((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))⟩
29		elpqn 10981	. . . . . . . . . 10 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N))
30	29	3ad2ant1 1151	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐴 ∈ (N × N))
31		elpqn 10981	. . . . . . . . . 10 ⊢ (𝐵 ∈ Q → 𝐵 ∈ (N × N))
32	31	3ad2ant2 1152	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐵 ∈ (N × N))
33		addpipq2 10992	. . . . . . . . 9 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 +pQ 𝐵) = ⟨(((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩)
34	30, 32, 33	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 +pQ 𝐵) = ⟨(((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩)
35		relxp 5665	. . . . . . . . 9 ⊢ Rel (N × N)
36		elpqn 10981	. . . . . . . . . 10 ⊢ (𝐶 ∈ Q → 𝐶 ∈ (N × N))
37	36	3ad2ant3 1153	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐶 ∈ (N × N))
38		1st2nd 8033	. . . . . . . . 9 ⊢ ((Rel (N × N) ∧ 𝐶 ∈ (N × N)) → 𝐶 = ⟨(1st ‘𝐶), (2nd ‘𝐶)⟩)
39	35, 37, 38	sylancr 599	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐶 = ⟨(1st ‘𝐶), (2nd ‘𝐶)⟩)
40	34, 39	oveq12d 7426	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐴 +pQ 𝐵) +pQ 𝐶) = (⟨(((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩ +pQ ⟨(1st ‘𝐶), (2nd ‘𝐶)⟩))
41		xp1st 8016	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (N × N) → (1st ‘𝐴) ∈ N)
42	30, 41	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (1st ‘𝐴) ∈ N)
43		xp2nd 8017	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (N × N) → (2nd ‘𝐵) ∈ N)
44	32, 43	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐵) ∈ N)
45		mulclpi 10949	. . . . . . . . . 10 ⊢ (((1st ‘𝐴) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N)
46	42, 44, 45	syl2anc 596	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N)
47		xp1st 8016	. . . . . . . . . . 11 ⊢ (𝐵 ∈ (N × N) → (1st ‘𝐵) ∈ N)
48	32, 47	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (1st ‘𝐵) ∈ N)
49		xp2nd 8017	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (N × N) → (2nd ‘𝐴) ∈ N)
50	30, 49	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐴) ∈ N)
51		mulclpi 10949	. . . . . . . . . 10 ⊢ (((1st ‘𝐵) ∈ N ∧ (2nd ‘𝐴) ∈ N) → ((1st ‘𝐵) ·N (2nd ‘𝐴)) ∈ N)
52	48, 50, 51	syl2anc 596	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((1st ‘𝐵) ·N (2nd ‘𝐴)) ∈ N)
53		addclpi 10948	. . . . . . . . 9 ⊢ ((((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N ∧ ((1st ‘𝐵) ·N (2nd ‘𝐴)) ∈ N) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ∈ N)
54	46, 52, 53	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ∈ N)
55		mulclpi 10949	. . . . . . . . 9 ⊢ (((2nd ‘𝐴) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((2nd ‘𝐴) ·N (2nd ‘𝐵)) ∈ N)
56	50, 44, 55	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((2nd ‘𝐴) ·N (2nd ‘𝐵)) ∈ N)
57		xp1st 8016	. . . . . . . . 9 ⊢ (𝐶 ∈ (N × N) → (1st ‘𝐶) ∈ N)
58	37, 57	syl 18	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (1st ‘𝐶) ∈ N)
59		xp2nd 8017	. . . . . . . . 9 ⊢ (𝐶 ∈ (N × N) → (2nd ‘𝐶) ∈ N)
60	37, 59	syl 18	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (2nd ‘𝐶) ∈ N)
61		addpipq 10993	. . . . . . . 8 ⊢ ((((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ∈ N ∧ ((2nd ‘𝐴) ·N (2nd ‘𝐵)) ∈ N) ∧ ((1st ‘𝐶) ∈ N ∧ (2nd ‘𝐶) ∈ N)) → (⟨(((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩ +pQ ⟨(1st ‘𝐶), (2nd ‘𝐶)⟩) = ⟨(((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))), (((2nd ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶))⟩)
62	54, 56, 58, 60, 61	syl22anc 852	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (⟨(((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐵))⟩ +pQ ⟨(1st ‘𝐶), (2nd ‘𝐶)⟩) = ⟨(((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))), (((2nd ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶))⟩)
63	40, 62	eqtrd 2795	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐴 +pQ 𝐵) +pQ 𝐶) = ⟨(((((1st ‘𝐴) ·N (2nd ‘𝐵)) +N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N ((2nd ‘𝐴) ·N (2nd ‘𝐵)))), (((2nd ‘𝐴) ·N (2nd ‘𝐵)) ·N (2nd ‘𝐶))⟩)
64		1st2nd 8033	. . . . . . . . 9 ⊢ ((Rel (N × N) ∧ 𝐴 ∈ (N × N)) → 𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
65	35, 30, 64	sylancr 599	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
66		addpipq2 10992	. . . . . . . . 9 ⊢ ((𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐵 +pQ 𝐶) = ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩)
67	32, 37, 66	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐵 +pQ 𝐶) = ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩)
68	65, 67	oveq12d 7426	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 +pQ (𝐵 +pQ 𝐶)) = (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ +pQ ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩))
69		mulclpi 10949	. . . . . . . . . 10 ⊢ (((1st ‘𝐵) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
70	48, 60, 69	syl2anc 596	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
71		mulclpi 10949	. . . . . . . . . 10 ⊢ (((1st ‘𝐶) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
72	58, 44, 71	syl2anc 596	. . . . . . . . 9 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
73		addclpi 10948	. . . . . . . . 9 ⊢ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ N ∧ ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N) → (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N)
74	70, 72, 73	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N)
75		mulclpi 10949	. . . . . . . . 9 ⊢ (((2nd ‘𝐵) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
76	44, 60, 75	syl2anc 596	. . . . . . . 8 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
77		addpipq 10993	. . . . . . . 8 ⊢ ((((1st ‘𝐴) ∈ N ∧ (2nd ‘𝐴) ∈ N) ∧ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N ∧ ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)) → (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ +pQ ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩) = ⟨(((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))⟩)
78	42, 50, 74, 76, 77	syl22anc 852	. . . . . . 7 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ +pQ ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩) = ⟨(((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))⟩)
79	68, 78	eqtrd 2795	. . . . . 6 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 +pQ (𝐵 +pQ 𝐶)) = ⟨(((1st ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))⟩)
80	28, 63, 79	3eqtr4a 2821	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐴 +pQ 𝐵) +pQ 𝐶) = (𝐴 +pQ (𝐵 +pQ 𝐶)))
81	80	fveq2d 6877	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ([Q]‘((𝐴 +pQ 𝐵) +pQ 𝐶)) = ([Q]‘(𝐴 +pQ (𝐵 +pQ 𝐶))))
82		adderpq 11012	. . . 4 ⊢ (([Q]‘(𝐴 +pQ 𝐵)) +Q ([Q]‘𝐶)) = ([Q]‘((𝐴 +pQ 𝐵) +pQ 𝐶))
83		adderpq 11012	. . . 4 ⊢ (([Q]‘𝐴) +Q ([Q]‘(𝐵 +pQ 𝐶))) = ([Q]‘(𝐴 +pQ (𝐵 +pQ 𝐶)))
84	81, 82, 83	3eqtr4g 2820	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (([Q]‘(𝐴 +pQ 𝐵)) +Q ([Q]‘𝐶)) = (([Q]‘𝐴) +Q ([Q]‘(𝐵 +pQ 𝐶))))
85		addpqnq 10994	. . . . 5 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵)))
86	85	3adant3 1150	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 +Q 𝐵) = ([Q]‘(𝐴 +pQ 𝐵)))
87		nqerid 10989	. . . . . 6 ⊢ (𝐶 ∈ Q → ([Q]‘𝐶) = 𝐶)
88	87	eqcomd 2766	. . . . 5 ⊢ (𝐶 ∈ Q → 𝐶 = ([Q]‘𝐶))
89	88	3ad2ant3 1153	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐶 = ([Q]‘𝐶))
90	86, 89	oveq12d 7426	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐴 +Q 𝐵) +Q 𝐶) = (([Q]‘(𝐴 +pQ 𝐵)) +Q ([Q]‘𝐶)))
91		nqerid 10989	. . . . . 6 ⊢ (𝐴 ∈ Q → ([Q]‘𝐴) = 𝐴)
92	91	eqcomd 2766	. . . . 5 ⊢ (𝐴 ∈ Q → 𝐴 = ([Q]‘𝐴))
93	92	3ad2ant1 1151	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → 𝐴 = ([Q]‘𝐴))
94		addpqnq 10994	. . . . 5 ⊢ ((𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐵 +Q 𝐶) = ([Q]‘(𝐵 +pQ 𝐶)))
95	94	3adant1 1148	. . . 4 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐵 +Q 𝐶) = ([Q]‘(𝐵 +pQ 𝐶)))
96	93, 95	oveq12d 7426	. . 3 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → (𝐴 +Q (𝐵 +Q 𝐶)) = (([Q]‘𝐴) +Q ([Q]‘(𝐵 +pQ 𝐶))))
97	84, 90, 96	3eqtr4d 2805	. 2 ⊢ ((𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐴 +Q 𝐵) +Q 𝐶) = (𝐴 +Q (𝐵 +Q 𝐶)))
98		addnqf 11004	. . . 4 ⊢ +Q :(Q × Q)⟶Q
99	98	fdmi 6709	. . 3 ⊢ dom +Q = (Q × Q)
100		0nnq 10980	. . 3 ⊢ ¬ ∅ ∈ Q
101	99, 100	ndmovass 7597	. 2 ⊢ (¬ (𝐴 ∈ Q ∧ 𝐵 ∈ Q ∧ 𝐶 ∈ Q) → ((𝐴 +Q 𝐵) +Q 𝐶) = (𝐴 +Q (𝐵 +Q 𝐶)))
102	97, 101	pm2.61i 184	1 ⊢ ((𝐴 +Q 𝐵) +Q 𝐶) = (𝐴 +Q (𝐵 +Q 𝐶))

This proof depends on syntax axioms:   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ⟨cop 4589   × cxp 5645  Rel wrel 5652  ‘cfv 6527  (class class class)co 7408  1^st c1st 7982  2^nd c2nd 7983  Ncnpi 10900   +_N cpli 10901   ·_N cmi 10902   +_pQ cplpq 10904  Qcnq 10908  [Q]cerq 10910   +_Q cplq 10911

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 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6293  df-ord 6354  df-on 6355  df-lim 6356  df-suc 6357  df-iota 6483  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-fv 6535  df-ov 7411  df-oprab 7412  df-mpo 7413  df-om 7861  df-1st 7984  df-2nd 7985  df-frecs 8277  df-wrecs 8308  df-recs 8357  df-rdg 8396  df-1o 8454  df-oadd 8458  df-omul 8459  df-er 8695  df-ni 10928  df-pli 10929  df-mi 10930  df-lti 10931  df-plpq 10964  df-enq 10967  df-nq 10968  df-erq 10969  df-plq 10970  df-1nq 10972

This theorem is used by:  ltaddnq  11030  addasspr  11078  prlem934  11089  ltexprlem7  11098