![]() |
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 5709 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → 〈𝐴, 𝐵〉 ∈ (N × N)) | |
2 | fvres 6900 | . . 3 ⊢ (〈𝐴, 𝐵〉 ∈ (N × N) → (( +o ↾ (N × N))‘〈𝐴, 𝐵〉) = ( +o ‘〈𝐴, 𝐵〉)) | |
3 | df-ov 7399 | . . . 4 ⊢ (𝐴 +N 𝐵) = ( +N ‘〈𝐴, 𝐵〉) | |
4 | df-pli 10855 | . . . . 5 ⊢ +N = ( +o ↾ (N × N)) | |
5 | 4 | fveq1i 6882 | . . . 4 ⊢ ( +N ‘〈𝐴, 𝐵〉) = (( +o ↾ (N × N))‘〈𝐴, 𝐵〉) |
6 | 3, 5 | eqtri 2761 | . . 3 ⊢ (𝐴 +N 𝐵) = (( +o ↾ (N × N))‘〈𝐴, 𝐵〉) |
7 | df-ov 7399 | . . 3 ⊢ (𝐴 +o 𝐵) = ( +o ‘〈𝐴, 𝐵〉) | |
8 | 2, 6, 7 | 3eqtr4g 2798 | . 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 397 = wceq 1542 ∈ wcel 2107 〈cop 4630 × cxp 5670 ↾ cres 5674 ‘cfv 6535 (class class class)co 7396 +o coa 8450 Ncnpi 10826 +N cpli 10827 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 ax-sep 5295 ax-nul 5302 ax-pr 5423 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3063 df-rex 3072 df-rab 3434 df-v 3477 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-nul 4321 df-if 4525 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4905 df-br 5145 df-opab 5207 df-xp 5678 df-res 5684 df-iota 6487 df-fv 6543 df-ov 7399 df-pli 10855 |
This theorem is referenced by: addclpi 10874 addcompi 10876 addasspi 10877 distrpi 10880 addcanpi 10881 addnidpi 10883 ltexpi 10884 ltapi 10885 1lt2pi 10887 indpi 10889 |
Copyright terms: Public domain | W3C validator |