![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > addpiord | Structured version Visualization version GIF version |
Description: Positive integer addition in terms of ordinal addition. (Contributed by NM, 27-Aug-1995.) (New usage is discouraged.) |
Ref | Expression |
---|---|
addpiord | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | opelxpi 5726 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 〈𝐴, 𝐵〉 ∈ (N × N)) | |
2 | fvres 6926 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (N × N) → (( +o ↾ (N × N))‘〈𝐴, 𝐵〉) = ( +o ‘〈𝐴, 𝐵〉)) | |
3 | df-ov 7434 | . . . 4 ⊢ (𝐴 +N 𝐵) = ( +N ‘〈𝐴, 𝐵〉) | |
4 | df-pli 10911 | . . . . 5 ⊢ +N = ( +o ↾ (N × N)) | |
5 | 4 | fveq1i 6908 | . . . 4 ⊢ ( +N ‘〈𝐴, 𝐵〉) = (( +o ↾ (N × N))‘〈𝐴, 𝐵〉) |
6 | 3, 5 | eqtri 2763 | . . 3 ⊢ (𝐴 +N 𝐵) = (( +o ↾ (N × N))‘〈𝐴, 𝐵〉) |
7 | df-ov 7434 | . . 3 ⊢ (𝐴 +o 𝐵) = ( +o ‘〈𝐴, 𝐵〉) | |
8 | 2, 6, 7 | 3eqtr4g 2800 | . 2 ⊢ (〈𝐴, 𝐵〉 ∈ (N × N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) |
9 | 1, 8 | syl 17 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2106 〈cop 4637 × cxp 5687 ↾ cres 5691 ‘cfv 6563 (class class class)co 7431 +o coa 8502 Ncnpi 10882 +N cpli 10883 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-br 5149 df-opab 5211 df-xp 5695 df-res 5701 df-iota 6516 df-fv 6571 df-ov 7434 df-pli 10911 |
This theorem is referenced by: addclpi 10930 addcompi 10932 addasspi 10933 distrpi 10936 addcanpi 10937 addnidpi 10939 ltexpi 10940 ltapi 10941 1lt2pi 10943 indpi 10945 |
Copyright terms: Public domain | W3C validator |