Theorem mulidnq 7750

Description: Multiplication identity element for positive fractions. (Contributed by NM, 3-Mar-1996.)

Assertion

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

Proof of Theorem mulidnq

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

Step	Hyp	Ref	Expression
1		df-nqqs 7709	. 2 ⊢ Q = ((N × N) / ~Q )
2		oveq1 6086	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = (𝐴 ·Q 1Q))
3		id 19	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → [⟨𝑥, 𝑦⟩] ~Q = 𝐴)
4	2, 3	eqeq12d 2253	. 2 ⊢ ([⟨𝑥, 𝑦⟩] ~Q = 𝐴 → (([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = [⟨𝑥, 𝑦⟩] ~Q ↔ (𝐴 ·Q 1Q) = 𝐴))
5		df-1nqqs 7712	. . . . 5 ⊢ 1Q = [⟨1o, 1o⟩] ~Q
6	5	oveq2i 6090	. . . 4 ⊢ ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = ([⟨𝑥, 𝑦⟩] ~Q ·Q [⟨1o, 1o⟩] ~Q )
7		1pi 7676	. . . . 5 ⊢ 1o ∈ N
8		mulpipqqs 7734	. . . . 5 ⊢ (((𝑥 ∈ N ∧ 𝑦 ∈ N) ∧ (1o ∈ N ∧ 1o ∈ N)) → ([⟨𝑥, 𝑦⟩] ~Q ·Q [⟨1o, 1o⟩] ~Q ) = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
9	7, 7, 8	mpanr12 443	. . . 4 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ([⟨𝑥, 𝑦⟩] ~Q ·Q [⟨1o, 1o⟩] ~Q ) = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
10	6, 9	eqtrid 2283	. . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
11		mulcompig 7692	. . . . . . 7 ⊢ ((1o ∈ N ∧ 𝑥 ∈ N) → (1o ·N 𝑥) = (𝑥 ·N 1o))
12	7, 11	mpan 428	. . . . . 6 ⊢ (𝑥 ∈ N → (1o ·N 𝑥) = (𝑥 ·N 1o))
13	12	adantr 276	. . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → (1o ·N 𝑥) = (𝑥 ·N 1o))
14		mulcompig 7692	. . . . . . 7 ⊢ ((1o ∈ N ∧ 𝑦 ∈ N) → (1o ·N 𝑦) = (𝑦 ·N 1o))
15	7, 14	mpan 428	. . . . . 6 ⊢ (𝑦 ∈ N → (1o ·N 𝑦) = (𝑦 ·N 1o))
16	15	adantl 277	. . . . 5 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → (1o ·N 𝑦) = (𝑦 ·N 1o))
17	13, 16	opeq12d 3910	. . . 4 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩ = ⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩)
18	17	eceq1d 6837	. . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → [⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩] ~Q = [⟨(𝑥 ·N 1o), (𝑦 ·N 1o)⟩] ~Q )
19		mulcanenqec 7747	. . . 4 ⊢ ((1o ∈ N ∧ 𝑥 ∈ N ∧ 𝑦 ∈ N) → [⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩] ~Q = [⟨𝑥, 𝑦⟩] ~Q )
20	7, 19	mp3an1 1365	. . 3 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → [⟨(1o ·N 𝑥), (1o ·N 𝑦)⟩] ~Q = [⟨𝑥, 𝑦⟩] ~Q )
21	10, 18, 20	3eqtr2d 2277	. 2 ⊢ ((𝑥 ∈ N ∧ 𝑦 ∈ N) → ([⟨𝑥, 𝑦⟩] ~Q ·Q 1Q) = [⟨𝑥, 𝑦⟩] ~Q )
22	1, 4, 21	ecoptocl 6890	1 ⊢ (𝐴 ∈ Q → (𝐴 ·Q 1Q) = 𝐴)

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ⟨cop 3711  (class class class)co 6079  1_oc1o 6674  [cec 6799  Ncnpi 7633   ·_N cmi 7635   ~_Q ceq 7640  Qcnq 7641  1_Qc1q 7642   ·_Q cmq 7644

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-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733

This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-id 4436  df-iord 4509  df-on 4511  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-irdg 6635  df-1o 6681  df-oadd 6685  df-omul 6686  df-er 6801  df-ec 6803  df-qs 6807  df-ni 7665  df-mi 7667  df-mpq 7706  df-enq 7708  df-nqqs 7709  df-mqqs 7711  df-1nqqs 7712

This theorem is referenced by:  recmulnqg  7752  rec1nq  7756  ltaddnq  7768  halfnqq  7771  prarloclemarch  7779  ltrnqg  7781  addnqprllem  7888  addnqprulem  7889  addnqprl  7890  addnqpru  7891  appdivnq  7924  prmuloc2  7928  mulnqprl  7929  mulnqpru  7930  1idprl  7951  1idpru  7952  recexprlem1ssl  7994  recexprlem1ssu  7995