Theorem addpinq1 7831

Description: Addition of one to the numerator of a fraction whose denominator is one. (Contributed by Jim Kingdon, 26-Apr-2020.)

Assertion

Ref	Expression
addpinq1	⊢ (𝐴 ∈ N → [⟨(𝐴 +N 1o), 1o⟩] ~Q = ([⟨𝐴, 1o⟩] ~Q +Q 1Q))

Proof of Theorem addpinq1

Step	Hyp	Ref	Expression
1		df-1nqqs 7718	. . . . 5 ⊢ 1Q = [⟨1o, 1o⟩] ~Q
2	1	oveq2i 6096	. . . 4 ⊢ ([⟨𝐴, 1o⟩] ~Q +Q 1Q) = ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q )
3		1pi 7682	. . . . 5 ⊢ 1o ∈ N
4		addpipqqs 7737	. . . . . 6 ⊢ (((𝐴 ∈ N ∧ 1o ∈ N) ∧ (1o ∈ N ∧ 1o ∈ N)) → ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
5	3, 3, 4	mpanr12 443	. . . . 5 ⊢ ((𝐴 ∈ N ∧ 1o ∈ N) → ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
6	3, 5	mpan2 429	. . . 4 ⊢ (𝐴 ∈ N → ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
7	2, 6	eqtrid 2283	. . 3 ⊢ (𝐴 ∈ N → ([⟨𝐴, 1o⟩] ~Q +Q 1Q) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
8		mulidpi 7685	. . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o)
9	3, 8	ax-mp 5	. . . . . 6 ⊢ (1o ·N 1o) = 1o
10	9	oveq2i 6096	. . . . 5 ⊢ ((𝐴 ·N 1o) +N (1o ·N 1o)) = ((𝐴 ·N 1o) +N 1o)
11	10, 9	opeq12i 3909	. . . 4 ⊢ ⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩ = ⟨((𝐴 ·N 1o) +N 1o), 1o⟩
12		eceq1 6842	. . . 4 ⊢ (⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩ = ⟨((𝐴 ·N 1o) +N 1o), 1o⟩ → [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q = [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q )
13	11, 12	ax-mp 5	. . 3 ⊢ [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q = [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q
14	7, 13	eqtrdi 2287	. 2 ⊢ (𝐴 ∈ N → ([⟨𝐴, 1o⟩] ~Q +Q 1Q) = [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q )
15		mulidpi 7685	. . . . 5 ⊢ (𝐴 ∈ N → (𝐴 ·N 1o) = 𝐴)
16	15	oveq1d 6100	. . . 4 ⊢ (𝐴 ∈ N → ((𝐴 ·N 1o) +N 1o) = (𝐴 +N 1o))
17	16	opeq1d 3910	. . 3 ⊢ (𝐴 ∈ N → ⟨((𝐴 ·N 1o) +N 1o), 1o⟩ = ⟨(𝐴 +N 1o), 1o⟩)
18	17	eceq1d 6843	. 2 ⊢ (𝐴 ∈ N → [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q = [⟨(𝐴 +N 1o), 1o⟩] ~Q )
19	14, 18	eqtr2d 2272	1 ⊢ (𝐴 ∈ N → [⟨(𝐴 +N 1o), 1o⟩] ~Q = ([⟨𝐴, 1o⟩] ~Q +Q 1Q))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  ⟨cop 3712  (class class class)co 6085  1_oc1o 6680  [cec 6805  Ncnpi 7639   +_N cpli 7640   ·_N cmi 7641   ~_Q ceq 7646  1_Qc1q 7648   +_Q cplq 7649

This proof depends on 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 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735

This proof 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 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-1o 6687  df-oadd 6691  df-omul 6692  df-er 6807  df-ec 6809  df-qs 6813  df-ni 7671  df-pli 7672  df-mi 7673  df-plpq 7711  df-enq 7714  df-nqqs 7715  df-plqqs 7716  df-1nqqs 7718

This theorem is used by:  pitonnlem2  8214