| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > peano2uz | GIF version | ||
| Description: Second Peano postulate for an upper set of integers. (Contributed by NM, 7-Sep-2005.) |
| Ref | Expression |
|---|---|
| peano2uz | ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1028 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℤ) | |
| 2 | peano2z 9691 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | |
| 3 | 2 | 3ad2ant2 1050 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝑁 + 1) ∈ ℤ) |
| 4 | zre 9659 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 9659 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | letrp1 9186 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ (𝑁 + 1)) | |
| 7 | 5, 6 | syl3an2 1312 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ (𝑁 + 1)) |
| 8 | 4, 7 | syl3an1 1311 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ (𝑁 + 1)) |
| 9 | 1, 3, 8 | 3jca 1208 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝑀 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ ∧ 𝑀 ≤ (𝑁 + 1))) |
| 10 | eluz2 9943 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) | |
| 11 | eluz2 9943 | . 2 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ ∧ 𝑀 ≤ (𝑁 + 1))) | |
| 12 | 9, 10, 11 | 3imtr4i 201 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1009 ∈ wcel 2209 class class class wbr 4131 ‘cfv 5380 (class class class)co 6088 ℝcr 8184 1c1 8186 + caddc 8188 ≤ cle 8367 ℤcz 9655 ℤ≥cuz 9937 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8276 ax-resscn 8277 ax-1cn 8278 ax-1re 8279 ax-icn 8280 ax-addcl 8281 ax-addrcl 8282 ax-mulcl 8283 ax-addcom 8285 ax-addass 8287 ax-distr 8289 ax-i2m1 8290 ax-0lt1 8291 ax-0id 8293 ax-rnegex 8294 ax-cnre 8296 ax-pre-ltirr 8297 ax-pre-ltwlin 8298 ax-pre-lttrn 8299 ax-pre-ltadd 8301 |
| This proof depends on definitions: df-bi 117 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8368 df-mnf 8369 df-xr 8370 df-ltxr 8371 df-le 8372 df-sub 8506 df-neg 8507 df-inn 9314 df-n0 9575 df-z 9656 df-uz 9938 |
| This theorem is used by: peano2uzs 10000 peano2uzr 10001 uzaddcl 10002 fzsplit 10473 fzsplit3 10475 fzssp1 10490 fzsuc 10492 fzpred 10494 fzp1ss 10497 fzp1elp1 10499 fztp 10502 fzneuz 10525 fzosplitsnm1 10644 fzofzp1 10662 fzosplitsn 10668 fzosplitpr 10669 fzostep1 10673 zsupcllemstep 10679 infssuzex 10683 frec2uzuzd 10860 frecuzrdgrrn 10866 frec2uzrdg 10867 frecuzrdgrcl 10868 frecuzrdgsuc 10872 frecuzrdgrclt 10873 frecuzrdgg 10874 frecuzrdgsuctlem 10881 frecfzen2 10885 fzfig 10888 uzsinds 10902 iseqovex 10916 seq3val 10918 seqvalcd 10919 seqf 10922 seq3p1 10923 seq3split 10946 seqsplitg 10947 seqf1oglem1 10977 seqf1oglem2 10978 seq3homo 10985 seq3z 10986 ser3ge0 10994 faclbnd3 11203 bcm1k 11220 seq3coll 11316 swrds1 11462 pfxccatpfx2 11531 clim2ser 12128 clim2ser2 12129 serf0 12143 fsump1 12212 fsump1i 12225 fsumparts 12262 isum1p 12284 cvgratnnlemmn 12317 mertenslemi1 12327 clim2prod 12331 clim2divap 12332 fprodntrivap 12376 fprodp1 12392 fprodabs 12408 pcfac 13158 gzsumsplit1r 13774 gzsumconst 14233 dvply2g 15992 ppinprm 16260 chtnprm 16262 ppiublem1 16291 chtublem 16295 chtqub 16296 bposlem6 16316 |
| Copyright terms: Public domain | W3C validator |