Theorem dfplpq2 7155

Description: Alternate definition of pre-addition on positive fractions. (Contributed by Jim Kingdon, 12-Sep-2019.)

Assertion

Ref	Expression
dfplpq2	⊢ +pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))}

Distinct variable group:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝑓

Proof of Theorem dfplpq2

Step	Hyp	Ref	Expression
1		df-mpo 5772	. 2 ⊢ (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)}
2		df-plpq 7145	. 2 ⊢ +pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
3		1st2nd2 6066	. . . . . . . . . 10 ⊢ (𝑥 ∈ (N × N) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
4	3	eqeq1d 2146	. . . . . . . . 9 ⊢ (𝑥 ∈ (N × N) → (𝑥 = ⟨𝑤, 𝑣⟩ ↔ ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩))
5		1st2nd2 6066	. . . . . . . . . 10 ⊢ (𝑦 ∈ (N × N) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
6	5	eqeq1d 2146	. . . . . . . . 9 ⊢ (𝑦 ∈ (N × N) → (𝑦 = ⟨𝑢, 𝑓⟩ ↔ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩))
7	4, 6	bi2anan9 595	. . . . . . . 8 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ↔ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩)))
8	7	anbi1d 460	. . . . . . 7 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩)))
9		xp1st 6056	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (N × N) → (1st ‘𝑦) ∈ N)
10	9	ad2antlr 480	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (1st ‘𝑦) ∈ N)
11	7	biimpa 294	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩))
12	11	simprd 113	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩)
13		vex 2684	. . . . . . . . . . . . . . . . 17 ⊢ 𝑢 ∈ V
14		vex 2684	. . . . . . . . . . . . . . . . 17 ⊢ 𝑓 ∈ V
15	13, 14	opth2 4157	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩ ↔ ((1st ‘𝑦) = 𝑢 ∧ (2nd ‘𝑦) = 𝑓))
16	15	simplbi 272	. . . . . . . . . . . . . . 15 ⊢ (⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩ → (1st ‘𝑦) = 𝑢)
17	16	eleq1d 2206	. . . . . . . . . . . . . 14 ⊢ (⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩ → ((1st ‘𝑦) ∈ N ↔ 𝑢 ∈ N))
18	12, 17	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ((1st ‘𝑦) ∈ N ↔ 𝑢 ∈ N))
19	10, 18	mpbid 146	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → 𝑢 ∈ N)
20		xp2nd 6057	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (N × N) → (2nd ‘𝑥) ∈ N)
21	20	ad2antrr 479	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (2nd ‘𝑥) ∈ N)
22	11	simpld 111	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩)
23		vex 2684	. . . . . . . . . . . . . . . . 17 ⊢ 𝑤 ∈ V
24		vex 2684	. . . . . . . . . . . . . . . . 17 ⊢ 𝑣 ∈ V
25	23, 24	opth2 4157	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ↔ ((1st ‘𝑥) = 𝑤 ∧ (2nd ‘𝑥) = 𝑣))
26	25	simprbi 273	. . . . . . . . . . . . . . 15 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ → (2nd ‘𝑥) = 𝑣)
27	26	eleq1d 2206	. . . . . . . . . . . . . 14 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ → ((2nd ‘𝑥) ∈ N ↔ 𝑣 ∈ N))
28	22, 27	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ((2nd ‘𝑥) ∈ N ↔ 𝑣 ∈ N))
29	21, 28	mpbid 146	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → 𝑣 ∈ N)
30		mulcompig 7132	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ N ∧ 𝑣 ∈ N) → (𝑢 ·N 𝑣) = (𝑣 ·N 𝑢))
31	19, 29, 30	syl2anc 408	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (𝑢 ·N 𝑣) = (𝑣 ·N 𝑢))
32	31	oveq2d 5783	. . . . . . . . . 10 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)) = ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)))
33	32	opeq1d 3706	. . . . . . . . 9 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)
34	33	eqeq2d 2149	. . . . . . . 8 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ ↔ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))
35	34	pm5.32da 447	. . . . . . 7 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)))
36	8, 35	bitr3d 189	. . . . . 6 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)))
37	36	4exbidv 1842	. . . . 5 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)))
38		xp1st 6056	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → (1st ‘𝑥) ∈ N)
39	38, 20	jca 304	. . . . . 6 ⊢ (𝑥 ∈ (N × N) → ((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N))
40		xp2nd 6057	. . . . . . 7 ⊢ (𝑦 ∈ (N × N) → (2nd ‘𝑦) ∈ N)
41	9, 40	jca 304	. . . . . 6 ⊢ (𝑦 ∈ (N × N) → ((1st ‘𝑦) ∈ N ∧ (2nd ‘𝑦) ∈ N))
42		simpll 518	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑤 = (1st ‘𝑥))
43		simprr 521	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑓 = (2nd ‘𝑦))
44	42, 43	oveq12d 5785	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑤 ·N 𝑓) = ((1st ‘𝑥) ·N (2nd ‘𝑦)))
45		simprl 520	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑢 = (1st ‘𝑦))
46		simplr 519	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑣 = (2nd ‘𝑥))
47	45, 46	oveq12d 5785	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑢 ·N 𝑣) = ((1st ‘𝑦) ·N (2nd ‘𝑥)))
48	44, 47	oveq12d 5785	. . . . . . . . 9 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → ((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)) = (((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))))
49	46, 43	oveq12d 5785	. . . . . . . . 9 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑣 ·N 𝑓) = ((2nd ‘𝑥) ·N (2nd ‘𝑦)))
50	48, 49	opeq12d 3708	. . . . . . . 8 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
51	50	eqeq2d 2149	. . . . . . 7 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ ↔ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
52	51	copsex4g 4164	. . . . . 6 ⊢ ((((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N) ∧ ((1st ‘𝑦) ∈ N ∧ (2nd ‘𝑦) ∈ N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
53	39, 41, 52	syl2an 287	. . . . 5 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
54	37, 53	bitr3d 189	. . . 4 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
55	54	pm5.32i 449	. . 3 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)) ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
56	55	oprabbii 5819	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)}
57	1, 2, 56	3eqtr4i 2168	1 ⊢ +pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))}

Syntax hints:   ∧ wa 103   ↔ wb 104   = wceq 1331  ∃wex 1468   ∈ wcel 1480  ⟨cop 3525   × cxp 4532  ‘cfv 5118  (class class class)co 5767  {coprab 5768   ∈ cmpo 5769  1^st c1st 6029  2^nd c2nd 6030  Ncnpi 7073   +_N cpli 7074   ·_N cmi 7075   +_pQ cplpq 7077

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2119  ax-coll 4038  ax-sep 4041  ax-nul 4049  ax-pow 4093  ax-pr 4126  ax-un 4350  ax-setind 4447  ax-iinf 4497

This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2000  df-mo 2001  df-clab 2124  df-cleq 2130  df-clel 2133  df-nfc 2268  df-ne 2307  df-ral 2419  df-rex 2420  df-reu 2421  df-rab 2423  df-v 2683  df-sbc 2905  df-csb 2999  df-dif 3068  df-un 3070  df-in 3072  df-ss 3079  df-nul 3359  df-pw 3507  df-sn 3528  df-pr 3529  df-op 3531  df-uni 3732  df-int 3767  df-iun 3810  df-br 3925  df-opab 3985  df-mpt 3986  df-tr 4022  df-id 4210  df-iord 4283  df-on 4285  df-suc 4288  df-iom 4500  df-xp 4540  df-rel 4541  df-cnv 4542  df-co 4543  df-dm 4544  df-rn 4545  df-res 4546  df-ima 4547  df-iota 5083  df-fun 5120  df-fn 5121  df-f 5122  df-f1 5123  df-fo 5124  df-f1o 5125  df-fv 5126  df-ov 5770  df-oprab 5771  df-mpo 5772  df-1st 6031  df-2nd 6032  df-recs 6195  df-irdg 6260  df-oadd 6310  df-omul 6311  df-ni 7105  df-mi 7107  df-plpq 7145

This theorem is referenced by:  addpipqqs  7171