Theorem mulidnq 10877

Description: Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996.) (Revised by Mario Carneiro, 28-Apr-2013.) (New usage is discouraged.)

Assertion

Ref	Expression
mulidnq	⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴)

Proof of Theorem mulidnq

Step	Hyp	Ref	Expression
1		1nq 10842	. . 3 ⊢ 1Q ∈ Q
2		mulpqnq 10855	. . 3 ⊢ ((𝐴 ∈ Q ∧ 1Q ∈ Q) → (𝐴 ·Q 1Q) = ([Q]‘(𝐴 ·pQ 1Q)))
3	1, 2	mpan2 692	. 2 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = ([Q]‘(𝐴 ·pQ 1Q)))
4		relxp 5642	. . . . . . 7 ⊢ Rel (N × N)
5		elpqn 10839	. . . . . . 7 ⊢ (𝐴 ∈ Q → 𝐴 ∈ (N × N))
6		1st2nd 7985	. . . . . . 7 ⊢ ((Rel (N × N) ∧ 𝐴 ∈ (N × N)) → 𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
7	4, 5, 6	sylancr 588	. . . . . 6 ⊢ (𝐴 ∈ Q → 𝐴 = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
8		df-1nq 10830	. . . . . . 7 ⊢ 1Q = ⟨1o, 1o⟩
9	8	a1i 11	. . . . . 6 ⊢ (𝐴 ∈ Q → 1Q = ⟨1o, 1o⟩)
10	7, 9	oveq12d 7378	. . . . 5 ⊢ (𝐴 ∈ Q → (𝐴 ·pQ 1Q) = (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ·pQ ⟨1o, 1o⟩))
11		xp1st 7967	. . . . . . 7 ⊢ (𝐴 ∈ (N × N) → (1st ‘𝐴) ∈ N)
12	5, 11	syl 17	. . . . . 6 ⊢ (𝐴 ∈ Q → (1st ‘𝐴) ∈ N)
13		xp2nd 7968	. . . . . . 7 ⊢ (𝐴 ∈ (N × N) → (2nd ‘𝐴) ∈ N)
14	5, 13	syl 17	. . . . . 6 ⊢ (𝐴 ∈ Q → (2nd ‘𝐴) ∈ N)
15		1pi 10797	. . . . . . 7 ⊢ 1o ∈ N
16	15	a1i 11	. . . . . 6 ⊢ (𝐴 ∈ Q → 1o ∈ N)
17		mulpipq 10854	. . . . . 6 ⊢ ((((1st ‘𝐴) ∈ N ∧ (2nd ‘𝐴) ∈ N) ∧ (1o ∈ N ∧ 1o ∈ N)) → (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ·pQ ⟨1o, 1o⟩) = ⟨((1st ‘𝐴) ·N 1o), ((2nd ‘𝐴) ·N 1o)⟩)
18	12, 14, 16, 16, 17	syl22anc 839	. . . . 5 ⊢ (𝐴 ∈ Q → (⟨(1st ‘𝐴), (2nd ‘𝐴)⟩ ·pQ ⟨1o, 1o⟩) = ⟨((1st ‘𝐴) ·N 1o), ((2nd ‘𝐴) ·N 1o)⟩)
19		mulidpi 10800	. . . . . . . 8 ⊢ ((1st ‘𝐴) ∈ N → ((1st ‘𝐴) ·N 1o) = (1st ‘𝐴))
20	11, 19	syl 17	. . . . . . 7 ⊢ (𝐴 ∈ (N × N) → ((1st ‘𝐴) ·N 1o) = (1st ‘𝐴))
21		mulidpi 10800	. . . . . . . 8 ⊢ ((2nd ‘𝐴) ∈ N → ((2nd ‘𝐴) ·N 1o) = (2nd ‘𝐴))
22	13, 21	syl 17	. . . . . . 7 ⊢ (𝐴 ∈ (N × N) → ((2nd ‘𝐴) ·N 1o) = (2nd ‘𝐴))
23	20, 22	opeq12d 4825	. . . . . 6 ⊢ (𝐴 ∈ (N × N) → ⟨((1st ‘𝐴) ·N 1o), ((2nd ‘𝐴) ·N 1o)⟩ = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
24	5, 23	syl 17	. . . . 5 ⊢ (𝐴 ∈ Q → ⟨((1st ‘𝐴) ·N 1o), ((2nd ‘𝐴) ·N 1o)⟩ = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
25	10, 18, 24	3eqtrd 2776	. . . 4 ⊢ (𝐴 ∈ Q → (𝐴 ·pQ 1Q) = ⟨(1st ‘𝐴), (2nd ‘𝐴)⟩)
26	25, 7	eqtr4d 2775	. . 3 ⊢ (𝐴 ∈ Q → (𝐴 ·pQ 1Q) = 𝐴)
27	26	fveq2d 6838	. 2 ⊢ (𝐴 ∈ Q → ([Q]‘(𝐴 ·pQ 1Q)) = ([Q]‘𝐴))
28		nqerid 10847	. 2 ⊢ (𝐴 ∈ Q → ([Q]‘𝐴) = 𝐴)
29	3, 27, 28	3eqtrd 2776	1 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴)

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  ⟨cop 4574   × cxp 5622  Rel wrel 5629  ‘cfv 6492  (class class class)co 7360  1^st c1st 7933  2^nd c2nd 7934  1_oc1o 8391  Ncnpi 10758   ·_N cmi 10760   ·_pQ cmpq 10763  Qcnq 10766  1_Qc1q 10767  [Q]cerq 10768   ·_Q cmq 10770

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5370  ax-un 7682

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-1st 7935  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-1o 8398  df-oadd 8402  df-omul 8403  df-er 8636  df-ni 10786  df-mi 10788  df-lti 10789  df-mpq 10823  df-enq 10825  df-nq 10826  df-erq 10827  df-mq 10829  df-1nq 10830

This theorem is referenced by:  recmulnq  10878  ltaddnq  10888  halfnq  10890  ltrnq  10893  addclprlem1  10930  addclprlem2  10931  mulclprlem  10933  1idpr  10943  prlem934  10947  prlem936  10961  reclem3pr  10963