ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uzennn Unicode version
Theorem uzennn 10822
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 9872 . . . . 5 |- ZZ>= = ( j e. ZZ |-> { k e. ZZ | j <_ k } )
2 zex 9603 . . . . . 6 |- ZZ e. _V
32mptex 5917 . . . . 5 |- ( j e. ZZ |-> { k e. ZZ | j <_ k } ) e. _V
41, 3eqeltri 2307 . . . 4 |- ZZ>= e. _V
5 fvexg 5694 . . . 4 |- ( ( ZZ>= e. _V /\ M e. ZZ ) -> ( ZZ>= ` M ) e. _V )
64, 5mpan 424 . . 3 |- ( M e. ZZ -> ( ZZ>= ` M ) e. _V )
7 nn0ex 9519 . . . 4 |- NN0 e. _V
87a1i 9 . . 3 |- ( M e. ZZ -> NN0 e. _V )
9 eluzelz 9881 . . . . . . 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 9723 . . . . 5 |- ( ( M e. ZZ /\ x e. ( ZZ>= ` M ) ) -> ( x - M ) e. ZZ )
13 eluzle 9884 . . . . . . 7 |- ( x e. ( ZZ>= ` M ) -> M <_ x )
1413adantl 277 . . . . . 6 |- ( ( M e. ZZ /\ x e. ( ZZ>= ` M ) ) -> M <_ x )
1510zred 9718 . . . . . . 7 |- ( ( M e. ZZ /\ x e. ( ZZ>= ` M ) ) -> x e. RR )
1611zred 9718 . . . . . . 7 |- ( ( M e. ZZ /\ x e. ( ZZ>= ` M ) ) -> M e. RR )
1715, 16subge0d 8826 . . . . . 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 9607 . . . . 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 9614 . . . . . . 7 |- ( y e. NN0 -> y e. ZZ )
2423adantl 277 . . . . . 6 |- ( ( M e. ZZ /\ y e. NN0 ) -> y e. ZZ )
2524, 22zaddcld 9722 . . . . 5 |- ( ( M e. ZZ /\ y e. NN0 ) -> ( y + M ) e. ZZ )
26 nn0ge0 9538 . . . . . . 7 |- ( y e. NN0 -> 0 <_ y )
2726adantl 277 . . . . . 6 |- ( ( M e. ZZ /\ y e. NN0 ) -> 0 <_ y )
2822zred 9718 . . . . . . 7 |- ( ( M e. ZZ /\ y e. NN0 ) -> M e. RR )
2924zred 9718 . . . . . . 7 |- ( ( M e. ZZ /\ y e. NN0 ) -> y e. RR )
3028, 29addge02d 8825 . . . . . 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 9877 . . . . 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 9719 . . . . . 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 9719 . . . . . 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 9572 . . . . . 6 |- ( ( M e. ZZ /\ ( x e. ( ZZ>= ` M ) /\ y e. NN0 ) ) -> y e. CC )
4136, 38, 40subadd2d 8619 . . . . 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 2236 . . . . . . 7 |- ( ( y + M ) = x <-> x = ( y + M ) )
44 eqcom 2236 . . . . . . 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 7021 . 2 |- ( M e. ZZ -> ( ZZ>= ` M ) ~~ NN0 )
50 nn0ennn 10819 . 2 |- NN0 ~~ NN
51 entr 7037 . 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 2205   {crab 2526   _Vcvv 2815   class class class wbr 4114   |-> cmpt 4176   ` cfv 5357  (class class class)co 6058   ~~ cen 6986   0cc0 8143   + caddc 8146   <_ cle 8325   - cmin 8460   NNcn 9254   NN0cn0 9513   ZZcz 9594   ZZ>=cuz 9871
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-er 6780  df-en 6989  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8462  df-neg 8463  df-inn 9255  df-n0 9514  df-z 9595  df-uz 9872
This theorem is referenced by:  xnn0nnen  10823  exmidunben  13261
  Copyright terms: Public domain W3C validator