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 10344 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) = (𝐴 +o 𝐵)) | |
2 | pinn 10338 | . . 3 ⊢ (𝐴 ∈ N → 𝐴 ∈ ω) | |
3 | pinn 10338 | . . . . 5 ⊢ (𝐵 ∈ N → 𝐵 ∈ ω) | |
4 | nnacl 8247 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ ω) → (𝐴 +o 𝐵) ∈ ω) | |
5 | 3, 4 | sylan2 595 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ∈ ω) |
6 | elni2 10337 | . . . . 5 ⊢ (𝐵 ∈ N ↔ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) | |
7 | nnaordi 8254 | . . . . . . . 8 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → (𝐴 +o ∅) ∈ (𝐴 +o 𝐵))) | |
8 | ne0i 4233 | . . . . . . . 8 ⊢ ((𝐴 +o ∅) ∈ (𝐴 +o 𝐵) → (𝐴 +o 𝐵) ≠ ∅) | |
9 | 7, 8 | syl6 35 | . . . . . . 7 ⊢ ((𝐵 ∈ ω ∧ 𝐴 ∈ ω) → (∅ ∈ 𝐵 → (𝐴 +o 𝐵) ≠ ∅)) |
10 | 9 | expcom 417 | . . . . . 6 ⊢ (𝐴 ∈ ω → (𝐵 ∈ ω → (∅ ∈ 𝐵 → (𝐴 +o 𝐵) ≠ ∅))) |
11 | 10 | imp32 422 | . . . . 5 ⊢ ((𝐴 ∈ ω ∧ (𝐵 ∈ ω ∧ ∅ ∈ 𝐵)) → (𝐴 +o 𝐵) ≠ ∅) |
12 | 6, 11 | sylan2b 596 | . . . 4 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ≠ ∅) |
13 | elni 10336 | . . . 4 ⊢ ((𝐴 +o 𝐵) ∈ N ↔ ((𝐴 +o 𝐵) ∈ ω ∧ (𝐴 +o 𝐵) ≠ ∅)) | |
14 | 5, 12, 13 | sylanbrc 586 | . . 3 ⊢ ((𝐴 ∈ ω ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ∈ N) |
15 | 2, 14 | sylan 583 | . 2 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +o 𝐵) ∈ N) |
16 | 1, 15 | eqeltrd 2852 | 1 ⊢ ((𝐴 ∈ N ∧ 𝐵 ∈ N) → (𝐴 +N 𝐵) ∈ N) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∈ wcel 2111 ≠ wne 2951 ∅c0 4225 (class class class)co 7150 ωcom 7579 +o coa 8109 Ncnpi 10304 +N cpli 10305 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2729 ax-sep 5169 ax-nul 5176 ax-pr 5298 ax-un 7459 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2557 df-eu 2588 df-clab 2736 df-cleq 2750 df-clel 2830 df-nfc 2901 df-ne 2952 df-ral 3075 df-rex 3076 df-reu 3077 df-rab 3079 df-v 3411 df-sbc 3697 df-csb 3806 df-dif 3861 df-un 3863 df-in 3865 df-ss 3875 df-pss 3877 df-nul 4226 df-if 4421 df-pw 4496 df-sn 4523 df-pr 4525 df-tp 4527 df-op 4529 df-uni 4799 df-iun 4885 df-br 5033 df-opab 5095 df-mpt 5113 df-tr 5139 df-id 5430 df-eprel 5435 df-po 5443 df-so 5444 df-fr 5483 df-we 5485 df-xp 5530 df-rel 5531 df-cnv 5532 df-co 5533 df-dm 5534 df-rn 5535 df-res 5536 df-ima 5537 df-pred 6126 df-ord 6172 df-on 6173 df-lim 6174 df-suc 6175 df-iota 6294 df-fun 6337 df-fn 6338 df-f 6339 df-f1 6340 df-fo 6341 df-f1o 6342 df-fv 6343 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7580 df-wrecs 7957 df-recs 8018 df-rdg 8056 df-oadd 8116 df-ni 10332 df-pli 10333 |
This theorem is referenced by: addasspi 10355 distrpi 10358 addcanpi 10359 ltapi 10363 1lt2pi 10365 indpi 10367 addpqf 10404 adderpqlem 10414 addassnq 10418 distrnq 10421 1lt2nq 10433 archnq 10440 prlem934 10493 |
Copyright terms: Public domain | W3C validator |