ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uzn0 Unicode version

Theorem uzn0 9608
Description: The upper integers are all nonempty. (Contributed by Mario Carneiro, 16-Jan-2014.)
Assertion
Ref Expression
uzn0  |-  ( M  e.  ran  ZZ>=  ->  M  =/=  (/) )

Proof of Theorem uzn0
Dummy variable  k is distinct from all other variables.
StepHypRef Expression
1 uzf 9595 . . 3  |-  ZZ>= : ZZ --> ~P ZZ
2 ffn 5403 . . 3  |-  ( ZZ>= : ZZ --> ~P ZZ  ->  ZZ>=  Fn  ZZ )
3 fvelrnb 5604 . . 3  |-  ( ZZ>=  Fn  ZZ  ->  ( M  e.  ran  ZZ>= 
<->  E. k  e.  ZZ  ( ZZ>= `  k )  =  M ) )
41, 2, 3mp2b 8 . 2  |-  ( M  e.  ran  ZZ>=  <->  E. k  e.  ZZ  ( ZZ>= `  k
)  =  M )
5 uzid 9606 . . . . 5  |-  ( k  e.  ZZ  ->  k  e.  ( ZZ>= `  k )
)
6 ne0i 3453 . . . . 5  |-  ( k  e.  ( ZZ>= `  k
)  ->  ( ZZ>= `  k )  =/=  (/) )
75, 6syl 14 . . . 4  |-  ( k  e.  ZZ  ->  ( ZZ>=
`  k )  =/=  (/) )
8 neeq1 2377 . . . 4  |-  ( (
ZZ>= `  k )  =  M  ->  ( ( ZZ>=
`  k )  =/=  (/) 
<->  M  =/=  (/) ) )
97, 8syl5ibcom 155 . . 3  |-  ( k  e.  ZZ  ->  (
( ZZ>= `  k )  =  M  ->  M  =/=  (/) ) )
109rexlimiv 2605 . 2  |-  ( E. k  e.  ZZ  ( ZZ>=
`  k )  =  M  ->  M  =/=  (/) )
114, 10sylbi 121 1  |-  ( M  e.  ran  ZZ>=  ->  M  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105    = wceq 1364    e. wcel 2164    =/= wne 2364   E.wrex 2473   (/)c0 3446   ~Pcpw 3601   ran crn 4660    Fn wfn 5249   -->wf 5250   ` cfv 5254   ZZcz 9317   ZZ>=cuz 9592
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-setind 4569  ax-cnex 7963  ax-resscn 7964  ax-pre-ltirr 7984
This theorem depends on definitions:  df-bi 117  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-fv 5262  df-ov 5921  df-pnf 8056  df-mnf 8057  df-xr 8058  df-ltxr 8059  df-le 8060  df-neg 8193  df-z 9318  df-uz 9593
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator