ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  addpinq1 GIF version

Theorem addpinq1 7825
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
StepHypRef Expression
1 df-1nqqs 7712 . . . . 5 1Q = [⟨1o, 1o⟩] ~Q
21oveq2i 6090 . . . 4 ([⟨𝐴, 1o⟩] ~Q +Q 1Q) = ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q )
3 1pi 7676 . . . . 5 1oN
4 addpipqqs 7731 . . . . . 6 (((𝐴N ∧ 1oN) ∧ (1oN ∧ 1oN)) → ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
53, 3, 4mpanr12 443 . . . . 5 ((𝐴N ∧ 1oN) → ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
63, 5mpan2 429 . . . 4 (𝐴N → ([⟨𝐴, 1o⟩] ~Q +Q [⟨1o, 1o⟩] ~Q ) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
72, 6eqtrid 2283 . . 3 (𝐴N → ([⟨𝐴, 1o⟩] ~Q +Q 1Q) = [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q )
8 mulidpi 7679 . . . . . . 7 (1oN → (1o ·N 1o) = 1o)
93, 8ax-mp 5 . . . . . 6 (1o ·N 1o) = 1o
109oveq2i 6090 . . . . 5 ((𝐴 ·N 1o) +N (1o ·N 1o)) = ((𝐴 ·N 1o) +N 1o)
1110, 9opeq12i 3907 . . . 4 ⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩ = ⟨((𝐴 ·N 1o) +N 1o), 1o
12 eceq1 6836 . . . 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 )
1311, 12ax-mp 5 . . 3 [⟨((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)⟩] ~Q = [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q
147, 13eqtrdi 2287 . 2 (𝐴N → ([⟨𝐴, 1o⟩] ~Q +Q 1Q) = [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q )
15 mulidpi 7679 . . . . 5 (𝐴N → (𝐴 ·N 1o) = 𝐴)
1615oveq1d 6094 . . . 4 (𝐴N → ((𝐴 ·N 1o) +N 1o) = (𝐴 +N 1o))
1716opeq1d 3908 . . 3 (𝐴N → ⟨((𝐴 ·N 1o) +N 1o), 1o⟩ = ⟨(𝐴 +N 1o), 1o⟩)
1817eceq1d 6837 . 2 (𝐴N → [⟨((𝐴 ·N 1o) +N 1o), 1o⟩] ~Q = [⟨(𝐴 +N 1o), 1o⟩] ~Q )
1914, 18eqtr2d 2272 1 (𝐴N → [⟨(𝐴 +N 1o), 1o⟩] ~Q = ([⟨𝐴, 1o⟩] ~Q +Q 1Q))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wcel 2209  cop 3711  (class class class)co 6079  1oc1o 6674  [cec 6799  Ncnpi 7633   +N cpli 7634   ·N cmi 7635   ~Q ceq 7640  1Qc1q 7642   +Q cplq 7643
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-pli 7666  df-mi 7667  df-plpq 7705  df-enq 7708  df-nqqs 7709  df-plqqs 7710  df-1nqqs 7712
This theorem is referenced by:  pitonnlem2  8208
  Copyright terms: Public domain W3C validator