Theorem dfplpq2 6452

Description: Alternative 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-mpt2 5517	. 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 6442	. 2 ⊢ +pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
3		1st2nd2 5801	. . . . . . . . . 10 ⊢ (𝑥 ∈ (N × N) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
4	3	eqeq1d 2048	. . . . . . . . 9 ⊢ (𝑥 ∈ (N × N) → (𝑥 = ⟨𝑤, 𝑣⟩ ↔ ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩))
5		1st2nd2 5801	. . . . . . . . . 10 ⊢ (𝑦 ∈ (N × N) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
6	5	eqeq1d 2048	. . . . . . . . 9 ⊢ (𝑦 ∈ (N × N) → (𝑦 = ⟨𝑢, 𝑓⟩ ↔ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩))
7	4, 6	bi2anan9 538	. . . . . . . 8 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ↔ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩)))
8	7	anbi1d 438	. . . . . . 7 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩)))
9		xp1st 5792	. . . . . . . . . . . . . 14 ⊢ (𝑦 ∈ (N × N) → (1st ‘𝑦) ∈ N)
10	9	ad2antlr 458	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (1st ‘𝑦) ∈ N)
11	7	biimpa 280	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩))
12	11	simprd 107	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩)
13		vex 2560	. . . . . . . . . . . . . . . . 17 ⊢ 𝑢 ∈ V
14		vex 2560	. . . . . . . . . . . . . . . . 17 ⊢ 𝑓 ∈ V
15	13, 14	opth2 3977	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩ ↔ ((1st ‘𝑦) = 𝑢 ∧ (2nd ‘𝑦) = 𝑓))
16	15	simplbi 259	. . . . . . . . . . . . . . 15 ⊢ (⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩ → (1st ‘𝑦) = 𝑢)
17	16	eleq1d 2106	. . . . . . . . . . . . . 14 ⊢ (⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩ → ((1st ‘𝑦) ∈ N ↔ 𝑢 ∈ N))
18	12, 17	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ((1st ‘𝑦) ∈ N ↔ 𝑢 ∈ N))
19	10, 18	mpbid 135	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → 𝑢 ∈ N)
20		xp2nd 5793	. . . . . . . . . . . . . 14 ⊢ (𝑥 ∈ (N × N) → (2nd ‘𝑥) ∈ N)
21	20	ad2antrr 457	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (2nd ‘𝑥) ∈ N)
22	11	simpld 105	. . . . . . . . . . . . . 14 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩)
23		vex 2560	. . . . . . . . . . . . . . . . 17 ⊢ 𝑤 ∈ V
24		vex 2560	. . . . . . . . . . . . . . . . 17 ⊢ 𝑣 ∈ V
25	23, 24	opth2 3977	. . . . . . . . . . . . . . . 16 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ↔ ((1st ‘𝑥) = 𝑤 ∧ (2nd ‘𝑥) = 𝑣))
26	25	simprbi 260	. . . . . . . . . . . . . . 15 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ → (2nd ‘𝑥) = 𝑣)
27	26	eleq1d 2106	. . . . . . . . . . . . . 14 ⊢ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ → ((2nd ‘𝑥) ∈ N ↔ 𝑣 ∈ N))
28	22, 27	syl 14	. . . . . . . . . . . . 13 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ((2nd ‘𝑥) ∈ N ↔ 𝑣 ∈ N))
29	21, 28	mpbid 135	. . . . . . . . . . . 12 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → 𝑣 ∈ N)
30		mulcompig 6429	. . . . . . . . . . . 12 ⊢ ((𝑢 ∈ N ∧ 𝑣 ∈ N) → (𝑢 ·N 𝑣) = (𝑣 ·N 𝑢))
31	19, 29, 30	syl2anc 391	. . . . . . . . . . 11 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (𝑢 ·N 𝑣) = (𝑣 ·N 𝑢))
32	31	oveq2d 5528	. . . . . . . . . 10 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)) = ((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)))
33	32	opeq1d 3555	. . . . . . . . 9 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)
34	33	eqeq2d 2051	. . . . . . . 8 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ (𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩)) → (𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ ↔ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))
35	34	pm5.32da 425	. . . . . . 7 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)))
36	8, 35	bitr3d 179	. . . . . 6 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)))
37	36	4exbidv 1750	. . . . 5 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩) ↔ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩)))
38		xp1st 5792	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → (1st ‘𝑥) ∈ N)
39	38, 20	jca 290	. . . . . 6 ⊢ (𝑥 ∈ (N × N) → ((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N))
40		xp2nd 5793	. . . . . . 7 ⊢ (𝑦 ∈ (N × N) → (2nd ‘𝑦) ∈ N)
41	9, 40	jca 290	. . . . . 6 ⊢ (𝑦 ∈ (N × N) → ((1st ‘𝑦) ∈ N ∧ (2nd ‘𝑦) ∈ N))
42		simpll 481	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑤 = (1st ‘𝑥))
43		simprr 484	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑓 = (2nd ‘𝑦))
44	42, 43	oveq12d 5530	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑤 ·N 𝑓) = ((1st ‘𝑥) ·N (2nd ‘𝑦)))
45		simprl 483	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑢 = (1st ‘𝑦))
46		simplr 482	. . . . . . . . . . 11 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑣 = (2nd ‘𝑥))
47	45, 46	oveq12d 5530	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑢 ·N 𝑣) = ((1st ‘𝑦) ·N (2nd ‘𝑥)))
48	44, 47	oveq12d 5530	. . . . . . . . 9 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → ((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)) = (((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))))
49	46, 43	oveq12d 5530	. . . . . . . . 9 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑣 ·N 𝑓) = ((2nd ‘𝑥) ·N (2nd ‘𝑦)))
50	48, 49	opeq12d 3557	. . . . . . . 8 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
51	50	eqeq2d 2051	. . . . . . 7 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑢 ·N 𝑣)), (𝑣 ·N 𝑓)⟩ ↔ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
52	51	copsex4g 3984	. . . . . 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 273	. . . . 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 179	. . . 4 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨(((1st ‘𝑥) ·N (2nd ‘𝑦)) +N ((1st ‘𝑦) ·N (2nd ‘𝑥))), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
55	54	pm5.32i 427	. . 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 5560	. 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 2070	1 ⊢ +pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨((𝑤 ·N 𝑓) +N (𝑣 ·N 𝑢)), (𝑣 ·N 𝑓)⟩))}

Syntax hints:   ∧ wa 97   ↔ wb 98   = wceq 1243  ∃wex 1381   ∈ wcel 1393  ⟨cop 3378   × cxp 4343  ‘cfv 4902  (class class class)co 5512  {coprab 5513   ↦ cmpt2 5514  1^st c1st 5765  2^nd c2nd 5766  Ncnpi 6370   +_N cpli 6371   ·_N cmi 6372   +_pQ cplpq 6374

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-in1 544  ax-in2 545  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-13 1404  ax-14 1405  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022  ax-coll 3872  ax-sep 3875  ax-nul 3883  ax-pow 3927  ax-pr 3944  ax-un 4170  ax-setind 4262  ax-iinf 4311

This theorem depends on definitions:  df-bi 110  df-3an 887  df-tru 1246  df-fal 1249  df-nf 1350  df-sb 1646  df-eu 1903  df-mo 1904  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-ne 2206  df-ral 2311  df-rex 2312  df-reu 2313  df-rab 2315  df-v 2559  df-sbc 2765  df-csb 2853  df-dif 2920  df-un 2922  df-in 2924  df-ss 2931  df-nul 3225  df-pw 3361  df-sn 3381  df-pr 3382  df-op 3384  df-uni 3581  df-int 3616  df-iun 3659  df-br 3765  df-opab 3819  df-mpt 3820  df-tr 3855  df-id 4030  df-iord 4103  df-on 4105  df-suc 4108  df-iom 4314  df-xp 4351  df-rel 4352  df-cnv 4353  df-co 4354  df-dm 4355  df-rn 4356  df-res 4357  df-ima 4358  df-iota 4867  df-fun 4904  df-fn 4905  df-f 4906  df-f1 4907  df-fo 4908  df-f1o 4909  df-fv 4910  df-ov 5515  df-oprab 5516  df-mpt2 5517  df-1st 5767  df-2nd 5768  df-recs 5920  df-irdg 5957  df-oadd 6005  df-omul 6006  df-ni 6402  df-mi 6404  df-plpq 6442

This theorem is referenced by:  addpipqqs  6468