ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  uzaddcl Unicode version
Theorem uzaddcl 9589
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 5886 . . . . 5 |- ( j = 0 -> ( N + j ) = ( N + 0 ) )
21eleq1d 2246 . . . 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 5886 . . . . 5 |- ( j = k -> ( N + j ) = ( N + k ) )
54eleq1d 2246 . . . 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 5886 . . . . 5 |- ( j = ( k + 1 ) -> ( N + j ) = ( N + ( k + 1 ) ) )
87eleq1d 2246 . . . 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 5886 . . . . 5 |- ( j = K -> ( N + j ) = ( N + K ) )
1110eleq1d 2246 . . . 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 9542 . . . . . 6 |- ( N e. ( ZZ>= ` M ) -> N e. CC )
1413addid1d 8109 . . . . 5 |- ( N e. ( ZZ>= ` M ) -> ( N + 0 ) = N )
1514eleq1d 2246 . . . 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 9189 . . . . . . . 8 |- ( k e. NN0 -> k e. CC )
18 ax-1cn 7907 . . . . . . . . 9 |- 1 e. CC
19 addass 7944 . . . . . . . . 9 |- ( ( N e. CC /\ k e. CC /\ 1 e. CC ) -> ( ( N + k ) + 1 ) = ( N + ( k + 1 ) ) )
2018, 19mp3an3 1326 . . . . . . . 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 9586 . . . . . . 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 2255 . . . . 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 9370 . 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
Syntax hints:   -> wi 4   /\ wa 104   = wceq 1353   e. wcel 2148   ` cfv 5218  (class class class)co 5878   CCcc 7812   0cc0 7814   1c1 7815   + caddc 7817   NN0cn0 9179   ZZ>=cuz 9531
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 614  ax-in2 615  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-setind 4538  ax-cnex 7905  ax-resscn 7906  ax-1cn 7907  ax-1re 7908  ax-icn 7909  ax-addcl 7910  ax-addrcl 7911  ax-mulcl 7912  ax-addcom 7914  ax-addass 7916  ax-distr 7918  ax-i2m1 7919  ax-0lt1 7920  ax-0id 7922  ax-rnegex 7923  ax-cnre 7925  ax-pre-ltirr 7926  ax-pre-ltwlin 7927  ax-pre-lttrn 7928  ax-pre-ltadd 7930
This theorem depends on definitions:  df-bi 117  df-3or 979  df-3an 980  df-tru 1356  df-fal 1359  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ne 2348  df-nel 2443  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-dif 3133  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-fv 5226  df-riota 5834  df-ov 5881  df-oprab 5882  df-mpo 5883  df-pnf 7997  df-mnf 7998  df-xr 7999  df-ltxr 8000  df-le 8001  df-sub 8133  df-neg 8134  df-inn 8923  df-n0 9180  df-z 9257  df-uz 9532
This theorem is referenced by:  elfz0add  10123  zpnn0elfzo  10210  mertenslemi1  11546  eftlub  11701
  Copyright terms: Public domain W3C validator