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

Theorem uzn0 9365
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 9353 . . 3  |-  ZZ>= : ZZ --> ~P ZZ
2 ffn 5280 . . 3  |-  ( ZZ>= : ZZ --> ~P ZZ  ->  ZZ>=  Fn  ZZ )
3 fvelrnb 5477 . . 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 9364 . . . . 5  |-  ( k  e.  ZZ  ->  k  e.  ( ZZ>= `  k )
)
6 ne0i 3374 . . . . 5  |-  ( k  e.  ( ZZ>= `  k
)  ->  ( ZZ>= `  k )  =/=  (/) )
75, 6syl 14 . . . 4  |-  ( k  e.  ZZ  ->  ( ZZ>=
`  k )  =/=  (/) )
8 neeq1 2322 . . . 4  |-  ( (
ZZ>= `  k )  =  M  ->  ( ( ZZ>=
`  k )  =/=  (/) 
<->  M  =/=  (/) ) )
97, 8syl5ibcom 154 . . 3  |-  ( k  e.  ZZ  ->  (
( ZZ>= `  k )  =  M  ->  M  =/=  (/) ) )
109rexlimiv 2546 . 2  |-  ( E. k  e.  ZZ  ( ZZ>=
`  k )  =  M  ->  M  =/=  (/) )
114, 10sylbi 120 1  |-  ( M  e.  ran  ZZ>=  ->  M  =/=  (/) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 104    = wceq 1332    e. wcel 1481    =/= wne 2309   E.wrex 2418   (/)c0 3368   ~Pcpw 3515   ran crn 4548    Fn wfn 5126   -->wf 5127   ` cfv 5131   ZZcz 9078   ZZ>=cuz 9350
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-13 1492  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139  ax-un 4363  ax-setind 4460  ax-cnex 7735  ax-resscn 7736  ax-pre-ltirr 7756
This theorem depends on definitions:  df-bi 116  df-3or 964  df-3an 965  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ne 2310  df-nel 2405  df-ral 2422  df-rex 2423  df-rab 2426  df-v 2691  df-sbc 2914  df-dif 3078  df-un 3080  df-in 3082  df-ss 3089  df-nul 3369  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-uni 3745  df-br 3938  df-opab 3998  df-mpt 3999  df-id 4223  df-xp 4553  df-rel 4554  df-cnv 4555  df-co 4556  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560  df-iota 5096  df-fun 5133  df-fn 5134  df-f 5135  df-fv 5139  df-ov 5785  df-pnf 7826  df-mnf 7827  df-xr 7828  df-ltxr 7829  df-le 7830  df-neg 7960  df-z 9079  df-uz 9351
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator