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

Theorem uzennn 10761
Description: An upper integer set is equinumerous to the set of natural numbers. (Contributed by Jim Kingdon, 30-Jul-2023.)
Assertion
Ref Expression
uzennn  |-  ( M  e.  ZZ  ->  ( ZZ>=
`  M )  ~~  NN )

Proof of Theorem uzennn
Dummy variables  x  y  j  k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-uz 9817 . . . . 5  |-  ZZ>=  =  ( j  e.  ZZ  |->  { k  e.  ZZ  | 
j  <_  k }
)
2 zex 9549 . . . . . 6  |-  ZZ  e.  _V
32mptex 5890 . . . . 5  |-  ( j  e.  ZZ  |->  { k  e.  ZZ  |  j  <_  k } )  e.  _V
41, 3eqeltri 2304 . . . 4  |-  ZZ>=  e.  _V
5 fvexg 5667 . . . 4  |-  ( (
ZZ>=  e.  _V  /\  M  e.  ZZ )  ->  ( ZZ>=
`  M )  e. 
_V )
64, 5mpan 424 . . 3  |-  ( M  e.  ZZ  ->  ( ZZ>=
`  M )  e. 
_V )
7 nn0ex 9467 . . . 4  |-  NN0  e.  _V
87a1i 9 . . 3  |-  ( M  e.  ZZ  ->  NN0  e.  _V )
9 eluzelz 9826 . . . . . . 7  |-  ( x  e.  ( ZZ>= `  M
)  ->  x  e.  ZZ )
109adantl 277 . . . . . 6  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  ->  x  e.  ZZ )
11 simpl 109 . . . . . 6  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  ->  M  e.  ZZ )
1210, 11zsubcld 9668 . . . . 5  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  -> 
( x  -  M
)  e.  ZZ )
13 eluzle 9829 . . . . . . 7  |-  ( x  e.  ( ZZ>= `  M
)  ->  M  <_  x )
1413adantl 277 . . . . . 6  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  ->  M  <_  x )
1510zred 9663 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  ->  x  e.  RR )
1611zred 9663 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  ->  M  e.  RR )
1715, 16subge0d 8774 . . . . . 6  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  -> 
( 0  <_  (
x  -  M )  <-> 
M  <_  x )
)
1814, 17mpbird 167 . . . . 5  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  -> 
0  <_  ( x  -  M ) )
19 elnn0z 9553 . . . . 5  |-  ( ( x  -  M )  e.  NN0  <->  ( ( x  -  M )  e.  ZZ  /\  0  <_ 
( x  -  M
) ) )
2012, 18, 19sylanbrc 417 . . . 4  |-  ( ( M  e.  ZZ  /\  x  e.  ( ZZ>= `  M ) )  -> 
( x  -  M
)  e.  NN0 )
2120ex 115 . . 3  |-  ( M  e.  ZZ  ->  (
x  e.  ( ZZ>= `  M )  ->  (
x  -  M )  e.  NN0 ) )
22 simpl 109 . . . . 5  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  ->  M  e.  ZZ )
23 nn0z 9560 . . . . . . 7  |-  ( y  e.  NN0  ->  y  e.  ZZ )
2423adantl 277 . . . . . 6  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  -> 
y  e.  ZZ )
2524, 22zaddcld 9667 . . . . 5  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  -> 
( y  +  M
)  e.  ZZ )
26 nn0ge0 9486 . . . . . . 7  |-  ( y  e.  NN0  ->  0  <_ 
y )
2726adantl 277 . . . . . 6  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  -> 
0  <_  y )
2822zred 9663 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  ->  M  e.  RR )
2924zred 9663 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  -> 
y  e.  RR )
3028, 29addge02d 8773 . . . . . 6  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  -> 
( 0  <_  y  <->  M  <_  ( y  +  M ) ) )
3127, 30mpbid 147 . . . . 5  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  ->  M  <_  ( y  +  M ) )
32 eluz2 9822 . . . . 5  |-  ( ( y  +  M )  e.  ( ZZ>= `  M
)  <->  ( M  e.  ZZ  /\  ( y  +  M )  e.  ZZ  /\  M  <_ 
( y  +  M
) ) )
3322, 25, 31, 32syl3anbrc 1208 . . . 4  |-  ( ( M  e.  ZZ  /\  y  e.  NN0 )  -> 
( y  +  M
)  e.  ( ZZ>= `  M ) )
3433ex 115 . . 3  |-  ( M  e.  ZZ  ->  (
y  e.  NN0  ->  ( y  +  M )  e.  ( ZZ>= `  M
) ) )
359ad2antrl 490 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  x  e.  ZZ )
3635zcnd 9664 . . . . . 6  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  x  e.  CC )
37 simpl 109 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  M  e.  ZZ )
3837zcnd 9664 . . . . . 6  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  M  e.  CC )
39 simprr 533 . . . . . . 7  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  y  e.  NN0 )
4039nn0cnd 9518 . . . . . 6  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  y  e.  CC )
4136, 38, 40subadd2d 8568 . . . . 5  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  ( ( x  -  M )  =  y  <->  ( y  +  M )  =  x ) )
42 bicom 140 . . . . . 6  |-  ( ( ( x  -  M
)  =  y  <->  ( y  +  M )  =  x )  <->  ( ( y  +  M )  =  x  <->  ( x  -  M )  =  y ) )
43 eqcom 2233 . . . . . . 7  |-  ( ( y  +  M )  =  x  <->  x  =  ( y  +  M
) )
44 eqcom 2233 . . . . . . 7  |-  ( ( x  -  M )  =  y  <->  y  =  ( x  -  M
) )
4543, 44bibi12i 229 . . . . . 6  |-  ( ( ( y  +  M
)  =  x  <->  ( x  -  M )  =  y )  <->  ( x  =  ( y  +  M
)  <->  y  =  ( x  -  M ) ) )
4642, 45bitri 184 . . . . 5  |-  ( ( ( x  -  M
)  =  y  <->  ( y  +  M )  =  x )  <->  ( x  =  ( y  +  M
)  <->  y  =  ( x  -  M ) ) )
4741, 46sylib 122 . . . 4  |-  ( ( M  e.  ZZ  /\  ( x  e.  ( ZZ>=
`  M )  /\  y  e.  NN0 ) )  ->  ( x  =  ( y  +  M
)  <->  y  =  ( x  -  M ) ) )
4847ex 115 . . 3  |-  ( M  e.  ZZ  ->  (
( x  e.  (
ZZ>= `  M )  /\  y  e.  NN0 )  -> 
( x  =  ( y  +  M )  <-> 
y  =  ( x  -  M ) ) ) )
496, 8, 21, 34, 48en3d 6985 . 2  |-  ( M  e.  ZZ  ->  ( ZZ>=
`  M )  ~~  NN0 )
50 nn0ennn 10758 . 2  |-  NN0  ~~  NN
51 entr 7001 . 2  |-  ( ( ( ZZ>= `  M )  ~~  NN0  /\  NN0  ~~  NN )  ->  ( ZZ>= `  M
)  ~~  NN )
5249, 50, 51sylancl 413 1  |-  ( M  e.  ZZ  ->  ( ZZ>=
`  M )  ~~  NN )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   {crab 2515   _Vcvv 2803   class class class wbr 4093    |-> cmpt 4155   ` cfv 5333  (class class class)co 6028    ~~ cen 6950   0cc0 8092    + caddc 8095    <_ cle 8274    - cmin 8409   NNcn 9202   NN0cn0 9461   ZZcz 9540   ZZ>=cuz 9816
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 2204  ax-14 2205  ax-ext 2213  ax-coll 4209  ax-sep 4212  ax-pow 4270  ax-pr 4305  ax-un 4536  ax-setind 4641  ax-cnex 8183  ax-resscn 8184  ax-1cn 8185  ax-1re 8186  ax-icn 8187  ax-addcl 8188  ax-addrcl 8189  ax-mulcl 8190  ax-addcom 8192  ax-addass 8194  ax-distr 8196  ax-i2m1 8197  ax-0lt1 8198  ax-0id 8200  ax-rnegex 8201  ax-cnre 8203  ax-pre-ltirr 8204  ax-pre-ltwlin 8205  ax-pre-lttrn 8206  ax-pre-ltadd 8208
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 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ne 2404  df-nel 2499  df-ral 2516  df-rex 2517  df-reu 2518  df-rab 2520  df-v 2805  df-sbc 3033  df-csb 3129  df-dif 3203  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-int 3934  df-iun 3977  df-br 4094  df-opab 4156  df-mpt 4157  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-f 5337  df-f1 5338  df-fo 5339  df-f1o 5340  df-fv 5341  df-riota 5981  df-ov 6031  df-oprab 6032  df-mpo 6033  df-er 6745  df-en 6953  df-pnf 8275  df-mnf 8276  df-xr 8277  df-ltxr 8278  df-le 8279  df-sub 8411  df-neg 8412  df-inn 9203  df-n0 9462  df-z 9541  df-uz 9817
This theorem is referenced by:  xnn0nnen  10762  exmidunben  13127
  Copyright terms: Public domain W3C validator