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

Theorem uzn0 9870
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 9856 . . 3  |-  ZZ>= : ZZ --> ~P ZZ
2 ffn 5508 . . 3  |-  ( ZZ>= : ZZ --> ~P ZZ  ->  ZZ>=  Fn  ZZ )
3 fvelrnb 5724 . . 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 9868 . . . . 5  |-  ( k  e.  ZZ  ->  k  e.  ( ZZ>= `  k )
)
6 ne0i 3515 . . . . 5  |-  ( k  e.  ( ZZ>= `  k
)  ->  ( ZZ>= `  k )  =/=  (/) )
75, 6syl 14 . . . 4  |-  ( k  e.  ZZ  ->  ( ZZ>=
`  k )  =/=  (/) )
8 neeq1 2425 . . . 4  |-  ( (
ZZ>= `  k )  =  M  ->  ( ( ZZ>=
`  k )  =/=  (/) 
<->  M  =/=  (/) ) )
97, 8syl5ibcom 155 . . 3  |-  ( k  e.  ZZ  ->  (
( ZZ>= `  k )  =  M  ->  M  =/=  (/) ) )
109rexlimiv 2654 . 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 1398    e. wcel 2203    =/= wne 2412   E.wrex 2521   (/)c0 3508   ~Pcpw 3669   ran crn 4750    Fn wfn 5347   -->wf 5348   ` cfv 5352   ZZcz 9577   ZZ>=cuz 9853
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-pre-ltirr 8239
This theorem depends on definitions:  df-bi 117  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-rab 2529  df-v 2815  df-sbc 3043  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-f 5356  df-fv 5360  df-ov 6053  df-pnf 8310  df-mnf 8311  df-xr 8312  df-ltxr 8313  df-le 8314  df-neg 8447  df-z 9578  df-uz 9854
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator