| 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 9685 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | |
| 3 | 2 | 3ad2ant2 1050 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝑁 + 1) ∈ ℤ) |
| 4 | zre 9653 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 9653 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | letrp1 9181 | . . . . 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 9937 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) | |
| 11 | eluz2 9937 | . 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 4130 ‘cfv 5377 (class class class)co 6085 ℝcr 8179 1c1 8181 + caddc 8183 ≤ cle 8362 ℤcz 9649 ℤ≥cuz 9931 |
| 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 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8271 ax-resscn 8272 ax-1cn 8273 ax-1re 8274 ax-icn 8275 ax-addcl 8276 ax-addrcl 8277 ax-mulcl 8278 ax-addcom 8280 ax-addass 8282 ax-distr 8284 ax-i2m1 8285 ax-0lt1 8286 ax-0id 8288 ax-rnegex 8289 ax-cnre 8291 ax-pre-ltirr 8292 ax-pre-ltwlin 8293 ax-pre-lttrn 8294 ax-pre-ltadd 8296 |
| 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 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8363 df-mnf 8364 df-xr 8365 df-ltxr 8366 df-le 8367 df-sub 8501 df-neg 8502 df-inn 9308 df-n0 9569 df-z 9650 df-uz 9932 |
| This theorem is used by: peano2uzs 9994 peano2uzr 9995 uzaddcl 9996 fzsplit 10467 fzsplit3 10469 fzssp1 10484 fzsuc 10486 fzpred 10488 fzp1ss 10491 fzp1elp1 10493 fztp 10496 fzneuz 10519 fzosplitsnm1 10638 fzofzp1 10656 fzosplitsn 10662 fzosplitpr 10663 fzostep1 10667 zsupcllemstep 10673 infssuzex 10677 frec2uzuzd 10854 frecuzrdgrrn 10860 frec2uzrdg 10861 frecuzrdgrcl 10862 frecuzrdgsuc 10866 frecuzrdgrclt 10867 frecuzrdgg 10868 frecuzrdgsuctlem 10875 frecfzen2 10879 fzfig 10882 uzsinds 10896 iseqovex 10910 seq3val 10912 seqvalcd 10913 seqf 10916 seq3p1 10917 seq3split 10940 seqsplitg 10941 seqf1oglem1 10971 seqf1oglem2 10972 seq3homo 10979 seq3z 10980 ser3ge0 10988 faclbnd3 11197 bcm1k 11214 seq3coll 11310 swrds1 11456 pfxccatpfx2 11525 clim2ser 12122 clim2ser2 12123 serf0 12137 fsump1 12206 fsump1i 12219 fsumparts 12256 isum1p 12278 cvgratnnlemmn 12311 mertenslemi1 12321 clim2prod 12325 clim2divap 12326 fprodntrivap 12370 fprodp1 12386 fprodabs 12402 pcfac 13152 gzsumsplit1r 13767 gzsumconst 14195 dvply2g 15926 ppinprm 16189 chtnprm 16191 ppiublem1 16220 chtublem 16224 chtqub 16225 bposlem6 16245 |
| Copyright terms: Public domain | W3C validator |