Theorem adderpqlem 10949

Description: Lemma for adderpq 10951. (Contributed by Mario Carneiro, 8-May-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
adderpqlem	⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (𝐴 +pQ 𝐶) ~Q (𝐵 +pQ 𝐶)))

Proof of Theorem adderpqlem

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

Step	Hyp	Ref	Expression
1		xp1st 8007	. . . . . 6 ⊢ (𝐴 ∈ (N × N) → (1st ‘𝐴) ∈ N)
2	1	3ad2ant1 1134	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (1st ‘𝐴) ∈ N)
3		xp2nd 8008	. . . . . 6 ⊢ (𝐶 ∈ (N × N) → (2nd ‘𝐶) ∈ N)
4	3	3ad2ant3 1136	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (2nd ‘𝐶) ∈ N)
5		mulclpi 10888	. . . . 5 ⊢ (((1st ‘𝐴) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((1st ‘𝐴) ·N (2nd ‘𝐶)) ∈ N)
6	2, 4, 5	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st ‘𝐴) ·N (2nd ‘𝐶)) ∈ N)
7		xp1st 8007	. . . . . 6 ⊢ (𝐶 ∈ (N × N) → (1st ‘𝐶) ∈ N)
8	7	3ad2ant3 1136	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (1st ‘𝐶) ∈ N)
9		xp2nd 8008	. . . . . 6 ⊢ (𝐴 ∈ (N × N) → (2nd ‘𝐴) ∈ N)
10	9	3ad2ant1 1134	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (2nd ‘𝐴) ∈ N)
11		mulclpi 10888	. . . . 5 ⊢ (((1st ‘𝐶) ∈ N ∧ (2nd ‘𝐴) ∈ N) → ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N)
12	8, 10, 11	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N)
13		addclpi 10887	. . . 4 ⊢ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) ∈ N ∧ ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ N) → (((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N)
14	6, 12, 13	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N)
15		mulclpi 10888	. . . 4 ⊢ (((2nd ‘𝐴) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((2nd ‘𝐴) ·N (2nd ‘𝐶)) ∈ N)
16	10, 4, 15	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((2nd ‘𝐴) ·N (2nd ‘𝐶)) ∈ N)
17		xp1st 8007	. . . . . 6 ⊢ (𝐵 ∈ (N × N) → (1st ‘𝐵) ∈ N)
18	17	3ad2ant2 1135	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (1st ‘𝐵) ∈ N)
19		mulclpi 10888	. . . . 5 ⊢ (((1st ‘𝐵) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
20	18, 4, 19	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
21		xp2nd 8008	. . . . . 6 ⊢ (𝐵 ∈ (N × N) → (2nd ‘𝐵) ∈ N)
22	21	3ad2ant2 1135	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (2nd ‘𝐵) ∈ N)
23		mulclpi 10888	. . . . 5 ⊢ (((1st ‘𝐶) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
24	8, 22, 23	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N)
25		addclpi 10887	. . . 4 ⊢ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) ∈ N ∧ ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N) → (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N)
26	20, 24, 25	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N)
27		mulclpi 10888	. . . 4 ⊢ (((2nd ‘𝐵) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
28	22, 4, 27	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)
29		enqbreq 10914	. . 3 ⊢ ((((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ∈ N ∧ ((2nd ‘𝐴) ·N (2nd ‘𝐶)) ∈ N) ∧ ((((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N ∧ ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ N)) → (⟨(((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐶))⟩ ~Q ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩ ↔ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))))))
30	14, 16, 26, 28, 29	syl22anc 838	. 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (⟨(((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐶))⟩ ~Q ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩ ↔ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))))))
31		addpipq2 10931	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 +pQ 𝐶) = ⟨(((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐶))⟩)
32	31	3adant2 1132	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 +pQ 𝐶) = ⟨(((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐶))⟩)
33		addpipq2 10931	. . . 4 ⊢ ((𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐵 +pQ 𝐶) = ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩)
34	33	3adant1 1131	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐵 +pQ 𝐶) = ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩)
35	32, 34	breq12d 5162	. 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((𝐴 +pQ 𝐶) ~Q (𝐵 +pQ 𝐶) ↔ ⟨(((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))), ((2nd ‘𝐴) ·N (2nd ‘𝐶))⟩ ~Q ⟨(((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))), ((2nd ‘𝐵) ·N (2nd ‘𝐶))⟩))
36		enqbreq2 10915	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) = ((1st ‘𝐵) ·N (2nd ‘𝐴))))
37	36	3adant3 1133	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) = ((1st ‘𝐵) ·N (2nd ‘𝐴))))
38		mulclpi 10888	. . . . 5 ⊢ (((2nd ‘𝐶) ∈ N ∧ (2nd ‘𝐶) ∈ N) → ((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N)
39	4, 4, 38	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N)
40		mulclpi 10888	. . . . 5 ⊢ (((1st ‘𝐴) ∈ N ∧ (2nd ‘𝐵) ∈ N) → ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N)
41	2, 22, 40	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N)
42		mulcanpi 10895	. . . 4 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N ∧ ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N) → ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) = ((1st ‘𝐵) ·N (2nd ‘𝐴))))
43	39, 41, 42	syl2anc 585	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ↔ ((1st ‘𝐴) ·N (2nd ‘𝐵)) = ((1st ‘𝐵) ·N (2nd ‘𝐴))))
44		mulclpi 10888	. . . . . 6 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ∈ N ∧ ((1st ‘𝐶) ·N (2nd ‘𝐵)) ∈ N) → (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N)
45	16, 24, 44	syl2anc 585	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N)
46		mulclpi 10888	. . . . . 6 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ∈ N ∧ ((1st ‘𝐴) ·N (2nd ‘𝐵)) ∈ N) → (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) ∈ N)
47	39, 41, 46	syl2anc 585	. . . . 5 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) ∈ N)
48		addcanpi 10894	. . . . 5 ⊢ (((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) ∈ N ∧ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) ∈ N) → (((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) ↔ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))))
49	45, 47, 48	syl2anc 585	. . . 4 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) ↔ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))))
50		mulcompi 10891	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶)))
51		fvex 6905	. . . . . . . . 9 ⊢ (1st ‘𝐴) ∈ V
52		fvex 6905	. . . . . . . . 9 ⊢ (2nd ‘𝐵) ∈ V
53		fvex 6905	. . . . . . . . 9 ⊢ (2nd ‘𝐶) ∈ V
54		mulcompi 10891	. . . . . . . . 9 ⊢ (𝑥 ·N 𝑦) = (𝑦 ·N 𝑥)
55		mulasspi 10892	. . . . . . . . 9 ⊢ ((𝑥 ·N 𝑦) ·N 𝑧) = (𝑥 ·N (𝑦 ·N 𝑧))
56	51, 52, 53, 54, 55, 53	caov4 7638	. . . . . . . 8 ⊢ (((1st ‘𝐴) ·N (2nd ‘𝐵)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐶))) = (((1st ‘𝐴) ·N (2nd ‘𝐶)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
57	50, 56	eqtri 2761	. . . . . . 7 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((1st ‘𝐴) ·N (2nd ‘𝐶)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
58		fvex 6905	. . . . . . . . 9 ⊢ (2nd ‘𝐴) ∈ V
59		fvex 6905	. . . . . . . . 9 ⊢ (1st ‘𝐶) ∈ V
60	58, 53, 59, 54, 55, 52	caov4 7638	. . . . . . . 8 ⊢ (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) = (((2nd ‘𝐴) ·N (1st ‘𝐶)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵)))
61		mulcompi 10891	. . . . . . . . 9 ⊢ ((2nd ‘𝐴) ·N (1st ‘𝐶)) = ((1st ‘𝐶) ·N (2nd ‘𝐴))
62		mulcompi 10891	. . . . . . . . 9 ⊢ ((2nd ‘𝐶) ·N (2nd ‘𝐵)) = ((2nd ‘𝐵) ·N (2nd ‘𝐶))
63	61, 62	oveq12i 7421	. . . . . . . 8 ⊢ (((2nd ‘𝐴) ·N (1st ‘𝐶)) ·N ((2nd ‘𝐶) ·N (2nd ‘𝐵))) = (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
64	60, 63	eqtri 2761	. . . . . . 7 ⊢ (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) = (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
65	57, 64	oveq12i 7421	. . . . . 6 ⊢ ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵)))) = ((((1st ‘𝐴) ·N (2nd ‘𝐶)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))))
66		addcompi 10889	. . . . . 6 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))))
67		ovex 7442	. . . . . . 7 ⊢ ((1st ‘𝐴) ·N (2nd ‘𝐶)) ∈ V
68		ovex 7442	. . . . . . 7 ⊢ ((1st ‘𝐶) ·N (2nd ‘𝐴)) ∈ V
69		ovex 7442	. . . . . . 7 ⊢ ((2nd ‘𝐵) ·N (2nd ‘𝐶)) ∈ V
70		distrpi 10893	. . . . . . 7 ⊢ (𝑥 ·N (𝑦 +N 𝑧)) = ((𝑥 ·N 𝑦) +N (𝑥 ·N 𝑧))
71	67, 68, 69, 54, 70	caovdir 7641	. . . . . 6 ⊢ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) = ((((1st ‘𝐴) ·N (2nd ‘𝐶)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) +N (((1st ‘𝐶) ·N (2nd ‘𝐴)) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))))
72	65, 66, 71	3eqtr4i 2771	. . . . 5 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶)))
73		addcompi 10889	. . . . . 6 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶))) +N (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))))
74		mulasspi 10892	. . . . . . . 8 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = ((2nd ‘𝐶) ·N ((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))))
75		mulcompi 10891	. . . . . . . . . 10 ⊢ ((2nd ‘𝐶) ·N ((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = (((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶))
76		mulasspi 10892	. . . . . . . . . . . 12 ⊢ (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (1st ‘𝐵)) = ((2nd ‘𝐴) ·N ((2nd ‘𝐶) ·N (1st ‘𝐵)))
77		mulcompi 10891	. . . . . . . . . . . 12 ⊢ ((2nd ‘𝐴) ·N ((2nd ‘𝐶) ·N (1st ‘𝐵))) = (((2nd ‘𝐶) ·N (1st ‘𝐵)) ·N (2nd ‘𝐴))
78		mulasspi 10892	. . . . . . . . . . . 12 ⊢ (((2nd ‘𝐶) ·N (1st ‘𝐵)) ·N (2nd ‘𝐴)) = ((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))
79	76, 77, 78	3eqtrri 2766	. . . . . . . . . . 11 ⊢ ((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (1st ‘𝐵))
80	79	oveq1i 7419	. . . . . . . . . 10 ⊢ (((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ·N (2nd ‘𝐶)) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (1st ‘𝐵)) ·N (2nd ‘𝐶))
81	75, 80	eqtri 2761	. . . . . . . . 9 ⊢ ((2nd ‘𝐶) ·N ((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (1st ‘𝐵)) ·N (2nd ‘𝐶))
82		mulasspi 10892	. . . . . . . . 9 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (1st ‘𝐵)) ·N (2nd ‘𝐶)) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
83	81, 82	eqtri 2761	. . . . . . . 8 ⊢ ((2nd ‘𝐶) ·N ((2nd ‘𝐶) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
84	74, 83	eqtri 2761	. . . . . . 7 ⊢ (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶)))
85	84	oveq2i 7420	. . . . . 6 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶))))
86		distrpi 10893	. . . . . 6 ⊢ (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐶))) +N (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))))
87	73, 85, 86	3eqtr4i 2771	. . . . 5 ⊢ ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))))
88	72, 87	eqeq12i 2751	. . . 4 ⊢ (((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵)))) = ((((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐶) ·N (2nd ‘𝐵))) +N (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴)))) ↔ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵)))))
89	49, 88	bitr3di 286	. . 3 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → ((((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐴) ·N (2nd ‘𝐵))) = (((2nd ‘𝐶) ·N (2nd ‘𝐶)) ·N ((1st ‘𝐵) ·N (2nd ‘𝐴))) ↔ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))))))
90	37, 43, 89	3bitr2d 307	. 2 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ ((((1st ‘𝐴) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐴))) ·N ((2nd ‘𝐵) ·N (2nd ‘𝐶))) = (((2nd ‘𝐴) ·N (2nd ‘𝐶)) ·N (((1st ‘𝐵) ·N (2nd ‘𝐶)) +N ((1st ‘𝐶) ·N (2nd ‘𝐵))))))
91	30, 35, 90	3bitr4rd 312	1 ⊢ ((𝐴 ∈ (N × N) ∧ 𝐵 ∈ (N × N) ∧ 𝐶 ∈ (N × N)) → (𝐴 ~Q 𝐵 ↔ (𝐴 +pQ 𝐶) ~Q (𝐵 +pQ 𝐶)))

Syntax hints:   → wi 4   ↔ wb 205   ∧ w3a 1088   = wceq 1542   ∈ wcel 2107  ⟨cop 4635   class class class wbr 5149   × cxp 5675  ‘cfv 6544  (class class class)co 7409  1^st c1st 7973  2^nd c2nd 7974  Ncnpi 10839   +_N cpli 10840   ·_N cmi 10841   +_pQ cplpq 10843   ~_Q ceq 10846

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428  ax-un 7725

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3or 1089  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2942  df-ral 3063  df-rex 3072  df-reu 3378  df-rab 3434  df-v 3477  df-sbc 3779  df-csb 3895  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-pss 3968  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4910  df-iun 5000  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5575  df-eprel 5581  df-po 5589  df-so 5590  df-fr 5632  df-we 5634  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-res 5689  df-ima 5690  df-pred 6301  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6496  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551  df-fv 6552  df-ov 7412  df-oprab 7413  df-mpo 7414  df-om 7856  df-1st 7975  df-2nd 7976  df-frecs 8266  df-wrecs 8297  df-recs 8371  df-rdg 8410  df-oadd 8470  df-omul 8471  df-ni 10867  df-pli 10868  df-mi 10869  df-plpq 10903  df-enq 10906

This theorem is referenced by:  adderpq  10951