ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uzaddcl Unicode version
Theorem uzaddcl 9996
Description: Addition closure law for an upper set of integers. (Contributed by NM, 4-Jun-2006.)
Assertion
Ref Expression
uzaddcl |- ( ( N e. ( ZZ>= ` M ) /\ K e. NN0 ) -> ( N + K ) e. ( ZZ>= ` M ) )
Proof of Theorem uzaddcl
Dummy variables j k are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 oveq2 6093 . . . . 5 |- ( j = 0 -> ( N + j ) = ( N + 0 ) )
21eleq1d 2307 . . . 4 |- ( j = 0 -> ( ( N + j ) e. ( ZZ>= ` M ) <-> ( N + 0 ) e. ( ZZ>= ` M ) ) )
32imbi2d 230 . . 3 |- ( j = 0 -> ( ( N e. ( ZZ>= ` M ) -> ( N + j ) e. ( ZZ>= ` M ) ) <-> ( N e. ( ZZ>= ` M ) -> ( N + 0 ) e. ( ZZ>= ` M ) ) ) )
4 oveq2 6093 . . . . 5 |- ( j = k -> ( N + j ) = ( N + k ) )
54eleq1d 2307 . . . 4 |- ( j = k -> ( ( N + j ) e. ( ZZ>= ` M ) <-> ( N + k ) e. ( ZZ>= ` M ) ) )
65imbi2d 230 . . 3 |- ( j = k -> ( ( N e. ( ZZ>= ` M ) -> ( N + j ) e. ( ZZ>= ` M ) ) <-> ( N e. ( ZZ>= ` M ) -> ( N + k ) e. ( ZZ>= ` M ) ) ) )
7 oveq2 6093 . . . . 5 |- ( j = ( k + 1 ) -> ( N + j ) = ( N + ( k + 1 ) ) )
87eleq1d 2307 . . . 4 |- ( j = ( k + 1 ) -> ( ( N + j ) e. ( ZZ>= ` M ) <-> ( N + ( k + 1 ) ) e. ( ZZ>= ` M ) ) )
98imbi2d 230 . . 3 |- ( j = ( k + 1 ) -> ( ( N e. ( ZZ>= ` M ) -> ( N + j ) e. ( ZZ>= ` M ) ) <-> ( N e. ( ZZ>= ` M ) -> ( N + ( k + 1 ) ) e. ( ZZ>= ` M ) ) ) )
10 oveq2 6093 . . . . 5 |- ( j = K -> ( N + j ) = ( N + K ) )
1110eleq1d 2307 . . . 4 |- ( j = K -> ( ( N + j ) e. ( ZZ>= ` M ) <-> ( N + K ) e. ( ZZ>= ` M ) ) )
1211imbi2d 230 . . 3 |- ( j = K -> ( ( N e. ( ZZ>= ` M ) -> ( N + j ) e. ( ZZ>= ` M ) ) <-> ( N e. ( ZZ>= ` M ) -> ( N + K ) e. ( ZZ>= ` M ) ) ) )
13 eluzelcn 9943 . . . . . 6 |- ( N e. ( ZZ>= ` M ) -> N e. CC )
1413addridd 8477 . . . . 5 |- ( N e. ( ZZ>= ` M ) -> ( N + 0 ) = N )
1514eleq1d 2307 . . . 4 |- ( N e. ( ZZ>= ` M ) -> ( ( N + 0 ) e. ( ZZ>= ` M ) <-> N e. ( ZZ>= ` M ) ) )
1615ibir 177 . . 3 |- ( N e. ( ZZ>= ` M ) -> ( N + 0 ) e. ( ZZ>= ` M ) )
17 nn0cn 9578 . . . . . . . 8 |- ( k e. NN0 -> k e. CC )
18 ax-1cn 8273 . . . . . . . . 9 |- 1 e. CC
19 addass 8310 . . . . . . . . 9 |- ( ( N e. CC /\ k e. CC /\ 1 e. CC ) -> ( ( N + k ) + 1 ) = ( N + ( k + 1 ) ) )
2018, 19mp3an3 1367 . . . . . . . 8 |- ( ( N e. CC /\ k e. CC ) -> ( ( N + k ) + 1 ) = ( N + ( k + 1 ) ) )
2113, 17, 20syl2anr 290 . . . . . . 7 |- ( ( k e. NN0 /\ N e. ( ZZ>= ` M ) ) -> ( ( N + k ) + 1 ) = ( N + ( k + 1 ) ) )
2221adantr 276 . . . . . 6 |- ( ( ( k e. NN0 /\ N e. ( ZZ>= ` M ) ) /\ ( N + k ) e. ( ZZ>= ` M ) ) -> ( ( N + k ) + 1 ) = ( N + ( k + 1 ) ) )
23 peano2uz 9993 . . . . . . 7 |- ( ( N + k ) e. ( ZZ>= ` M ) -> ( ( N + k ) + 1 ) e. ( ZZ>= ` M ) )
2423adantl 277 . . . . . 6 |- ( ( ( k e. NN0 /\ N e. ( ZZ>= ` M ) ) /\ ( N + k ) e. ( ZZ>= ` M ) ) -> ( ( N + k ) + 1 ) e. ( ZZ>= ` M ) )
2522, 24eqeltrrd 2316 . . . . 5 |- ( ( ( k e. NN0 /\ N e. ( ZZ>= ` M ) ) /\ ( N + k ) e. ( ZZ>= ` M ) ) -> ( N + ( k + 1 ) ) e. ( ZZ>= ` M ) )
2625exp31 364 . . . 4 |- ( k e. NN0 -> ( N e. ( ZZ>= ` M ) -> ( ( N + k ) e. ( ZZ>= ` M ) -> ( N + ( k + 1 ) ) e. ( ZZ>= ` M ) ) ) )
2726a2d 26 . . 3 |- ( k e. NN0 -> ( ( N e. ( ZZ>= ` M ) -> ( N + k ) e. ( ZZ>= ` M ) ) -> ( N e. ( ZZ>= ` M ) -> ( N + ( k + 1 ) ) e. ( ZZ>= ` M ) ) ) )
283, 6, 9, 12, 16, 27nn0ind 9765 . 2 |- ( K e. NN0 -> ( N e. ( ZZ>= ` M ) -> ( N + K ) e. ( ZZ>= ` M ) ) )
2928impcom 125 1 |- ( ( N e. ( ZZ>= ` M ) /\ K e. NN0 ) -> ( N + K ) e. ( ZZ>= ` M ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:   -> wi 4   /\ wa 104   = wceq 1402   e. wcel 2209   ` cfv 5377  (class class class)co 6085   CCcc 8178   0cc0 8180   1c1 8181   + caddc 8183   NN0cn0 9568   ZZ>=cuz 9931
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-ltadd 8296
This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-inn 9308  df-n0 9569  df-z 9650  df-uz 9932
This theorem is used by:  elfz0add  10538  zpnn0elfzo  10636  ccatass  11392  ccatrn  11393  swrdccat2  11459  pfxccat1  11490  mertenslemi1  12321  eftlub  12476
  Copyright terms: Public domain W3C validator