| 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 9689 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | |
| 3 | 2 | 3ad2ant2 1050 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝑁 + 1) ∈ ℤ) |
| 4 | zre 9657 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 9657 | . . . . 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 9942 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) | |
| 11 | eluz2 9942 | . 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 9653 ℤ≥cuz 9936 |
| 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 9654 df-uz 9937 |
| This theorem is used by: peano2uzs 9999 peano2uzr 10000 uzaddcl 10001 fzsplit 10472 fzsplit3 10474 fzssp1 10489 fzsuc 10491 fzpred 10493 fzp1ss 10496 fzp1elp1 10498 fztp 10501 fzneuz 10524 fzosplitsnm1 10643 fzofzp1 10661 fzosplitsn 10667 fzosplitpr 10668 fzostep1 10672 zsupcllemstep 10678 infssuzex 10682 frec2uzuzd 10859 frecuzrdgrrn 10865 frec2uzrdg 10866 frecuzrdgrcl 10867 frecuzrdgsuc 10871 frecuzrdgrclt 10872 frecuzrdgg 10873 frecuzrdgsuctlem 10880 frecfzen2 10884 fzfig 10887 uzsinds 10901 iseqovex 10915 seq3val 10917 seqvalcd 10918 seqf 10921 seq3p1 10922 seq3split 10945 seqsplitg 10946 seqf1oglem1 10976 seqf1oglem2 10977 seq3homo 10984 seq3z 10985 ser3ge0 10993 faclbnd3 11202 bcm1k 11219 seq3coll 11315 swrds1 11461 pfxccatpfx2 11530 clim2ser 12127 clim2ser2 12128 serf0 12142 fsump1 12211 fsump1i 12224 fsumparts 12261 isum1p 12283 cvgratnnlemmn 12316 mertenslemi1 12326 clim2prod 12330 clim2divap 12331 fprodntrivap 12375 fprodp1 12391 fprodabs 12407 pcfac 13157 gzsumsplit1r 13773 gzsumconst 14232 dvply2g 16009 ppinprm 16277 chtnprm 16279 ppiublem1 16308 chtublem 16312 chtqub 16313 bposlem6 16333 |
| Copyright terms: Public domain | W3C validator |