| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > addpinq1 | GIF version | ||
| Description: Addition of one to the numerator of a fraction whose denominator is one. (Contributed by Jim Kingdon, 26-Apr-2020.) |
| Ref | Expression |
|---|---|
| addpinq1 | ⊢ (𝐴 ∈ N → [〈(𝐴 +N 1o), 1o〉] ~Q = ([〈𝐴, 1o〉] ~Q +Q 1Q)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-1nqqs 7682 | . . . . 5 ⊢ 1Q = [〈1o, 1o〉] ~Q | |
| 2 | 1 | oveq2i 6069 | . . . 4 ⊢ ([〈𝐴, 1o〉] ~Q +Q 1Q) = ([〈𝐴, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) |
| 3 | 1pi 7646 | . . . . 5 ⊢ 1o ∈ N | |
| 4 | addpipqqs 7701 | . . . . . 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 439 | . . . . 5 ⊢ ((𝐴 ∈ N ∧ 1o ∈ N) → ([〈𝐴, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) = [〈((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ) |
| 6 | 3, 5 | mpan2 425 | . . . 4 ⊢ (𝐴 ∈ N → ([〈𝐴, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) = [〈((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ) |
| 7 | 2, 6 | eqtrid 2279 | . . 3 ⊢ (𝐴 ∈ N → ([〈𝐴, 1o〉] ~Q +Q 1Q) = [〈((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ) |
| 8 | mulidpi 7649 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
| 9 | 3, 8 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
| 10 | 9 | oveq2i 6069 | . . . . 5 ⊢ ((𝐴 ·N 1o) +N (1o ·N 1o)) = ((𝐴 ·N 1o) +N 1o) |
| 11 | 10, 9 | opeq12i 3893 | . . . 4 ⊢ 〈((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 = 〈((𝐴 ·N 1o) +N 1o), 1o〉 |
| 12 | eceq1 6815 | . . . 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 2283 | . 2 ⊢ (𝐴 ∈ N → ([〈𝐴, 1o〉] ~Q +Q 1Q) = [〈((𝐴 ·N 1o) +N 1o), 1o〉] ~Q ) |
| 15 | mulidpi 7649 | . . . . 5 ⊢ (𝐴 ∈ N → (𝐴 ·N 1o) = 𝐴) | |
| 16 | 15 | oveq1d 6073 | . . . 4 ⊢ (𝐴 ∈ N → ((𝐴 ·N 1o) +N 1o) = (𝐴 +N 1o)) |
| 17 | 16 | opeq1d 3894 | . . 3 ⊢ (𝐴 ∈ N → 〈((𝐴 ·N 1o) +N 1o), 1o〉 = 〈(𝐴 +N 1o), 1o〉) |
| 18 | 17 | eceq1d 6816 | . 2 ⊢ (𝐴 ∈ N → [〈((𝐴 ·N 1o) +N 1o), 1o〉] ~Q = [〈(𝐴 +N 1o), 1o〉] ~Q ) |
| 19 | 14, 18 | eqtr2d 2268 | 1 ⊢ (𝐴 ∈ N → [〈(𝐴 +N 1o), 1o〉] ~Q = ([〈𝐴, 1o〉] ~Q +Q 1Q)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1398 ∈ wcel 2205 〈cop 3697 (class class class)co 6058 1oc1o 6653 [cec 6778 Ncnpi 7603 +N cpli 7604 ·N cmi 7605 ~Q ceq 7610 1Qc1q 7612 +Q cplq 7613 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-iinf 4715 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-ral 2527 df-rex 2528 df-reu 2529 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-tr 4214 df-id 4419 df-iord 4492 df-on 4494 df-suc 4497 df-iom 4718 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-recs 6549 df-irdg 6614 df-1o 6660 df-oadd 6664 df-omul 6665 df-er 6780 df-ec 6782 df-qs 6786 df-ni 7635 df-pli 7636 df-mi 7637 df-plpq 7675 df-enq 7678 df-nqqs 7679 df-plqqs 7680 df-1nqqs 7682 |
| This theorem is referenced by: pitonnlem2 8178 |
| Copyright terms: Public domain | W3C validator |