| 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 1021 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ∈ ℤ) | |
| 2 | peano2z 9508 | . . . 4 ⊢ (𝑁 ∈ ℤ → (𝑁 + 1) ∈ ℤ) | |
| 3 | 2 | 3ad2ant2 1043 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝑁 + 1) ∈ ℤ) |
| 4 | zre 9476 | . . . 4 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ) | |
| 5 | zre 9476 | . . . . 5 ⊢ (𝑁 ∈ ℤ → 𝑁 ∈ ℝ) | |
| 6 | letrp1 9021 | . . . . 5 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℝ ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ (𝑁 + 1)) | |
| 7 | 5, 6 | syl3an2 1305 | . . . 4 ⊢ ((𝑀 ∈ ℝ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ (𝑁 + 1)) |
| 8 | 4, 7 | syl3an1 1304 | . . 3 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → 𝑀 ≤ (𝑁 + 1)) |
| 9 | 1, 3, 8 | 3jca 1201 | . 2 ⊢ ((𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁) → (𝑀 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ ∧ 𝑀 ≤ (𝑁 + 1))) |
| 10 | eluz2 9754 | . 2 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ≤ 𝑁)) | |
| 11 | eluz2 9754 | . 2 ⊢ ((𝑁 + 1) ∈ (ℤ≥‘𝑀) ↔ (𝑀 ∈ ℤ ∧ (𝑁 + 1) ∈ ℤ ∧ 𝑀 ≤ (𝑁 + 1))) | |
| 12 | 9, 10, 11 | 3imtr4i 201 | 1 ⊢ (𝑁 ∈ (ℤ≥‘𝑀) → (𝑁 + 1) ∈ (ℤ≥‘𝑀)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1002 ∈ wcel 2200 class class class wbr 4086 ‘cfv 5324 (class class class)co 6013 ℝcr 8024 1c1 8026 + caddc 8028 ≤ cle 8208 ℤcz 9472 ℤ≥cuz 9748 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-addcom 8125 ax-addass 8127 ax-distr 8129 ax-i2m1 8130 ax-0lt1 8131 ax-0id 8133 ax-rnegex 8134 ax-cnre 8136 ax-pre-ltirr 8137 ax-pre-ltwlin 8138 ax-pre-lttrn 8139 ax-pre-ltadd 8141 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-pnf 8209 df-mnf 8210 df-xr 8211 df-ltxr 8212 df-le 8213 df-sub 8345 df-neg 8346 df-inn 9137 df-n0 9396 df-z 9473 df-uz 9749 |
| This theorem is referenced by: peano2uzs 9811 peano2uzr 9812 uzaddcl 9813 fzsplit 10279 fzssp1 10295 fzsuc 10297 fzpred 10298 fzp1ss 10301 fzp1elp1 10303 fztp 10306 fzneuz 10329 fzosplitsnm1 10447 fzofzp1 10465 fzosplitsn 10471 fzosplitpr 10472 fzostep1 10476 zsupcllemstep 10482 infssuzex 10486 frec2uzuzd 10657 frecuzrdgrrn 10663 frec2uzrdg 10664 frecuzrdgrcl 10665 frecuzrdgsuc 10669 frecuzrdgrclt 10670 frecuzrdgg 10671 frecuzrdgsuctlem 10678 frecfzen2 10682 fzfig 10685 uzsinds 10699 iseqovex 10713 seq3val 10715 seqvalcd 10716 seqf 10719 seq3p1 10720 seq3split 10743 seqsplitg 10744 seqf1oglem1 10774 seqf1oglem2 10775 seq3homo 10782 seq3z 10783 ser3ge0 10791 faclbnd3 10998 bcm1k 11015 seq3coll 11099 swrds1 11242 pfxccatpfx2 11311 clim2ser 11891 clim2ser2 11892 serf0 11906 fsump1 11974 fsump1i 11987 fsumparts 12024 isum1p 12046 cvgratnnlemmn 12079 mertenslemi1 12089 clim2prod 12093 clim2divap 12094 fprodntrivap 12138 fprodp1 12154 fprodabs 12170 pcfac 12916 gsumsplit1r 13474 gsumprval 13475 gsumfzconst 13921 gsumfzfsumlemm 14594 dvply2g 15483 |
| Copyright terms: Public domain | W3C validator |