| 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 7435 | . . . . 5 ⊢ 1Q = [〈1o, 1o〉] ~Q | |
| 2 | 1 | oveq2i 5936 | . . . 4 ⊢ ([〈𝐴, 1o〉] ~Q +Q 1Q) = ([〈𝐴, 1o〉] ~Q +Q [〈1o, 1o〉] ~Q ) |
| 3 | 1pi 7399 | . . . . 5 ⊢ 1o ∈ N | |
| 4 | addpipqqs 7454 | . . . . . 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 2241 | . . 3 ⊢ (𝐴 ∈ N → ([〈𝐴, 1o〉] ~Q +Q 1Q) = [〈((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉] ~Q ) |
| 8 | mulidpi 7402 | . . . . . . 7 ⊢ (1o ∈ N → (1o ·N 1o) = 1o) | |
| 9 | 3, 8 | ax-mp 5 | . . . . . 6 ⊢ (1o ·N 1o) = 1o |
| 10 | 9 | oveq2i 5936 | . . . . 5 ⊢ ((𝐴 ·N 1o) +N (1o ·N 1o)) = ((𝐴 ·N 1o) +N 1o) |
| 11 | 10, 9 | opeq12i 3814 | . . . 4 ⊢ 〈((𝐴 ·N 1o) +N (1o ·N 1o)), (1o ·N 1o)〉 = 〈((𝐴 ·N 1o) +N 1o), 1o〉 |
| 12 | eceq1 6636 | . . . 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 2245 | . 2 ⊢ (𝐴 ∈ N → ([〈𝐴, 1o〉] ~Q +Q 1Q) = [〈((𝐴 ·N 1o) +N 1o), 1o〉] ~Q ) |
| 15 | mulidpi 7402 | . . . . 5 ⊢ (𝐴 ∈ N → (𝐴 ·N 1o) = 𝐴) | |
| 16 | 15 | oveq1d 5940 | . . . 4 ⊢ (𝐴 ∈ N → ((𝐴 ·N 1o) +N 1o) = (𝐴 +N 1o)) |
| 17 | 16 | opeq1d 3815 | . . 3 ⊢ (𝐴 ∈ N → 〈((𝐴 ·N 1o) +N 1o), 1o〉 = 〈(𝐴 +N 1o), 1o〉) |
| 18 | 17 | eceq1d 6637 | . 2 ⊢ (𝐴 ∈ N → [〈((𝐴 ·N 1o) +N 1o), 1o〉] ~Q = [〈(𝐴 +N 1o), 1o〉] ~Q ) |
| 19 | 14, 18 | eqtr2d 2230 | 1 ⊢ (𝐴 ∈ N → [〈(𝐴 +N 1o), 1o〉] ~Q = ([〈𝐴, 1o〉] ~Q +Q 1Q)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2167 〈cop 3626 (class class class)co 5925 1oc1o 6476 [cec 6599 Ncnpi 7356 +N cpli 7357 ·N cmi 7358 ~Q ceq 7363 1Qc1q 7365 +Q cplq 7366 |
| 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 615 ax-in2 616 ax-io 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-coll 4149 ax-sep 4152 ax-nul 4160 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-iinf 4625 |
| This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-ral 2480 df-rex 2481 df-reu 2482 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-iun 3919 df-br 4035 df-opab 4096 df-mpt 4097 df-tr 4133 df-id 4329 df-iord 4402 df-on 4404 df-suc 4407 df-iom 4628 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-f 5263 df-f1 5264 df-fo 5265 df-f1o 5266 df-fv 5267 df-ov 5928 df-oprab 5929 df-mpo 5930 df-1st 6207 df-2nd 6208 df-recs 6372 df-irdg 6437 df-1o 6483 df-oadd 6487 df-omul 6488 df-er 6601 df-ec 6603 df-qs 6607 df-ni 7388 df-pli 7389 df-mi 7390 df-plpq 7428 df-enq 7431 df-nqqs 7432 df-plqqs 7433 df-1nqqs 7435 |
| This theorem is referenced by: pitonnlem2 7931 |
| Copyright terms: Public domain | W3C validator |