Theorem dfmpq2 7345

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

Assertion

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

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

Proof of Theorem dfmpq2

Step	Hyp	Ref	Expression
1		df-mpo 5874	. 2 ⊢ (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)}
2		df-mpq 7335	. 2 ⊢ ·pQ = (𝑥 ∈ (N × N), 𝑦 ∈ (N × N) ↦ ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
3		1st2nd2 6170	. . . . . . . . . 10 ⊢ (𝑥 ∈ (N × N) → 𝑥 = ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩)
4	3	eqeq1d 2186	. . . . . . . . 9 ⊢ (𝑥 ∈ (N × N) → (𝑥 = ⟨𝑤, 𝑣⟩ ↔ ⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩))
5		1st2nd2 6170	. . . . . . . . . 10 ⊢ (𝑦 ∈ (N × N) → 𝑦 = ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩)
6	5	eqeq1d 2186	. . . . . . . . 9 ⊢ (𝑦 ∈ (N × N) → (𝑦 = ⟨𝑢, 𝑓⟩ ↔ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩))
7	4, 6	bi2anan9 606	. . . . . . . 8 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ↔ (⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩)))
8	7	anbi1d 465	. . . . . . 7 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ ((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)))
9	8	bicomd 141	. . . . . 6 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ ((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)))
10	9	4exbidv 1870	. . . . 5 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)))
11		xp1st 6160	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → (1st ‘𝑥) ∈ N)
12		xp2nd 6161	. . . . . . 7 ⊢ (𝑥 ∈ (N × N) → (2nd ‘𝑥) ∈ N)
13	11, 12	jca 306	. . . . . 6 ⊢ (𝑥 ∈ (N × N) → ((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N))
14		xp1st 6160	. . . . . . 7 ⊢ (𝑦 ∈ (N × N) → (1st ‘𝑦) ∈ N)
15		xp2nd 6161	. . . . . . 7 ⊢ (𝑦 ∈ (N × N) → (2nd ‘𝑦) ∈ N)
16	14, 15	jca 306	. . . . . 6 ⊢ (𝑦 ∈ (N × N) → ((1st ‘𝑦) ∈ N ∧ (2nd ‘𝑦) ∈ N))
17		simpll 527	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑤 = (1st ‘𝑥))
18		simprl 529	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑢 = (1st ‘𝑦))
19	17, 18	oveq12d 5887	. . . . . . . . 9 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑤 ·N 𝑢) = ((1st ‘𝑥) ·N (1st ‘𝑦)))
20		simplr 528	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑣 = (2nd ‘𝑥))
21		simprr 531	. . . . . . . . . 10 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → 𝑓 = (2nd ‘𝑦))
22	20, 21	oveq12d 5887	. . . . . . . . 9 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑣 ·N 𝑓) = ((2nd ‘𝑥) ·N (2nd ‘𝑦)))
23	19, 22	opeq12d 3784	. . . . . . . 8 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)
24	23	eqeq2d 2189	. . . . . . 7 ⊢ (((𝑤 = (1st ‘𝑥) ∧ 𝑣 = (2nd ‘𝑥)) ∧ (𝑢 = (1st ‘𝑦) ∧ 𝑓 = (2nd ‘𝑦))) → (𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩ ↔ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
25	24	copsex4g 4244	. . . . . 6 ⊢ ((((1st ‘𝑥) ∈ N ∧ (2nd ‘𝑥) ∈ N) ∧ ((1st ‘𝑦) ∈ N ∧ (2nd ‘𝑦) ∈ N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
26	13, 16, 25	syl2an 289	. . . . 5 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((⟨(1st ‘𝑥), (2nd ‘𝑥)⟩ = ⟨𝑤, 𝑣⟩ ∧ ⟨(1st ‘𝑦), (2nd ‘𝑦)⟩ = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
27	10, 26	bitr3d 190	. . . 4 ⊢ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) → (∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩) ↔ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
28	27	pm5.32i 454	. . 3 ⊢ (((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩)) ↔ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩))
29	28	oprabbii 5924	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ 𝑧 = ⟨((1st ‘𝑥) ·N (1st ‘𝑦)), ((2nd ‘𝑥) ·N (2nd ‘𝑦))⟩)}
30	1, 2, 29	3eqtr4i 2208	1 ⊢ ·pQ = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ (N × N) ∧ 𝑦 ∈ (N × N)) ∧ ∃𝑤∃𝑣∃𝑢∃𝑓((𝑥 = ⟨𝑤, 𝑣⟩ ∧ 𝑦 = ⟨𝑢, 𝑓⟩) ∧ 𝑧 = ⟨(𝑤 ·N 𝑢), (𝑣 ·N 𝑓)⟩))}

Syntax hints:   ∧ wa 104   ↔ wb 105   = wceq 1353  ∃wex 1492   ∈ wcel 2148  ⟨cop 3594   × cxp 4621  ‘cfv 5212  (class class class)co 5869  {coprab 5870   ∈ cmpo 5871  1^st c1st 6133  2^nd c2nd 6134  Ncnpi 7262   ·_N cmi 7264   ·_pQ cmpq 7267

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4118  ax-pow 4171  ax-pr 4206  ax-un 4430

This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-v 2739  df-sbc 2963  df-un 3133  df-in 3135  df-ss 3142  df-pw 3576  df-sn 3597  df-pr 3598  df-op 3600  df-uni 3808  df-br 4001  df-opab 4062  df-mpt 4063  df-id 4290  df-xp 4629  df-rel 4630  df-cnv 4631  df-co 4632  df-dm 4633  df-rn 4634  df-iota 5174  df-fun 5214  df-fv 5220  df-ov 5872  df-oprab 5873  df-mpo 5874  df-1st 6135  df-2nd 6136  df-mpq 7335

This theorem is referenced by:  mulpipqqs  7363