![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > addclpi | Structured version Visualization version GIF version |
Description: Closure of addition of positive integers. (Contributed by NM, 18-Oct-1995.) (New usage is discouraged.) |
Ref | Expression |
---|---|
addclpi | ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) ∈ N) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | addpiord 10879 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) | |
2 | pinn 10873 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
3 | pinn 10873 | . . . . 5 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
4 | nnacl 8611 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) | |
5 | 3, 4 | sylan2 594 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ∈ ω) |
6 | elni2 10872 | . . . . 5 ⊢ (𝐵 ∈ N ↔ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) | |
7 | nnaordi 8618 | . . . . . . . 8 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
8 | ne0i 4335 | . . . . . . . 8 ⊢ ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
9 | 7, 8 | syl6 35 | . . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → (𝐴 +o 𝐵) ≠ ∅)) |
10 | 9 | expcom 415 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐵 ∈ ω → (∅ ∈ 𝐵 → (𝐴 +o 𝐵) ≠ ∅))) |
11 | 10 | imp32 420 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) → (𝐴 +o 𝐵) ≠ ∅) |
12 | 6, 11 | sylan2b 595 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ≠ ∅) |
13 | elni 10871 | . . . 4 ⊢ ((𝐴 +o 𝐵) ∈ N ↔ ((𝐴 +o 𝐵) ∈ ω ∧ (𝐴 +o 𝐵) ≠ ∅)) | |
14 | 5, 12, 13 | sylanbrc 584 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ∈ N) |
15 | 2, 14 | sylan 581 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ∈ N) |
16 | 1, 15 | eqeltrd 2834 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) ∈ N) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∈ wcel 2107 ≠ wne 2941 ∅c0 4323 (class class class)co 7409 ωcom 7855 +o coa 8463 Ncnpi 10839 +N cpli 10840 |
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-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-sep 5300 ax-nul 5307 ax-pr 5428 ax-un 7725 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-oadd 8470 df-ni 10867 df-pli 10868 |
This theorem is referenced by: addasspi 10890 distrpi 10893 addcanpi 10894 ltapi 10898 1lt2pi 10900 indpi 10902 addpqf 10939 adderpqlem 10949 addassnq 10953 distrnq 10956 1lt2nq 10968 archnq 10975 prlem934 11028 |
Copyright terms: Public domain | W3C validator |