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

Theorem strext 12556
Description: Extending the upper range of a structure. This works because when we say that a structure has components in  A ... C we are not saying that every slot in that range is present, just that all the slots that are present are within that range. (Contributed by Jim Kingdon, 26-Feb-2025.)
Hypotheses
Ref Expression
strext.f  |-  ( ph  ->  F Struct  <. A ,  B >. )
strext.c  |-  ( ph  ->  C  e.  ( ZZ>= `  B ) )
Assertion
Ref Expression
strext  |-  ( ph  ->  F Struct  <. A ,  C >. )

Proof of Theorem strext
StepHypRef Expression
1 strext.f . . . . 5  |-  ( ph  ->  F Struct  <. A ,  B >. )
2 isstructim 12468 . . . . 5  |-  ( F Struct  <. A ,  B >.  -> 
( ( A  e.  NN  /\  B  e.  NN  /\  A  <_  B )  /\  Fun  ( F  \  { (/) } )  /\  dom  F  C_  ( A ... B
) ) )
31, 2syl 14 . . . 4  |-  ( ph  ->  ( ( A  e.  NN  /\  B  e.  NN  /\  A  <_  B )  /\  Fun  ( F  \  { (/) } )  /\  dom  F  C_  ( A ... B
) ) )
43simp1d 1009 . . 3  |-  ( ph  ->  ( A  e.  NN  /\  B  e.  NN  /\  A  <_  B ) )
54simp1d 1009 . 2  |-  ( ph  ->  A  e.  NN )
64simp2d 1010 . . 3  |-  ( ph  ->  B  e.  NN )
7 strext.c . . 3  |-  ( ph  ->  C  e.  ( ZZ>= `  B ) )
8 eluznn 9596 . . 3  |-  ( ( B  e.  NN  /\  C  e.  ( ZZ>= `  B ) )  ->  C  e.  NN )
96, 7, 8syl2anc 411 . 2  |-  ( ph  ->  C  e.  NN )
105nnred 8928 . . 3  |-  ( ph  ->  A  e.  RR )
116nnred 8928 . . 3  |-  ( ph  ->  B  e.  RR )
129nnred 8928 . . 3  |-  ( ph  ->  C  e.  RR )
134simp3d 1011 . . 3  |-  ( ph  ->  A  <_  B )
14 eluzle 9536 . . . 4  |-  ( C  e.  ( ZZ>= `  B
)  ->  B  <_  C )
157, 14syl 14 . . 3  |-  ( ph  ->  B  <_  C )
1610, 11, 12, 13, 15letrd 8077 . 2  |-  ( ph  ->  A  <_  C )
173simp2d 1010 . 2  |-  ( ph  ->  Fun  ( F  \  { (/) } ) )
18 structex 12466 . . 3  |-  ( F Struct  <. A ,  B >.  ->  F  e.  _V )
191, 18syl 14 . 2  |-  ( ph  ->  F  e.  _V )
203simp3d 1011 . . 3  |-  ( ph  ->  dom  F  C_  ( A ... B ) )
21 fzss2 10059 . . . 4  |-  ( C  e.  ( ZZ>= `  B
)  ->  ( A ... B )  C_  ( A ... C ) )
227, 21syl 14 . . 3  |-  ( ph  ->  ( A ... B
)  C_  ( A ... C ) )
2320, 22sstrd 3165 . 2  |-  ( ph  ->  dom  F  C_  ( A ... C ) )
24 isstructr 12469 . 2  |-  ( ( ( A  e.  NN  /\  C  e.  NN  /\  A  <_  C )  /\  ( Fun  ( F  \  { (/) } )  /\  F  e.  _V  /\  dom  F 
C_  ( A ... C ) ) )  ->  F Struct  <. A ,  C >. )
255, 9, 16, 17, 19, 23, 24syl33anc 1253 1  |-  ( ph  ->  F Struct  <. A ,  C >. )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ w3a 978    e. wcel 2148   _Vcvv 2737    \ cdif 3126    C_ wss 3129   (/)c0 3422   {csn 3592   <.cop 3595   class class class wbr 4002   dom cdm 4625   Fun wfun 5209   ` cfv 5215  (class class class)co 5872    <_ cle 7989   NNcn 8915   ZZ>=cuz 9524   ...cfz 10004   Struct cstr 12450
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 4120  ax-pow 4173  ax-pr 4208  ax-un 4432  ax-setind 4535  ax-cnex 7899  ax-resscn 7900  ax-1cn 7901  ax-1re 7902  ax-icn 7903  ax-addcl 7904  ax-addrcl 7905  ax-mulcl 7906  ax-addcom 7908  ax-addass 7910  ax-distr 7912  ax-i2m1 7913  ax-0lt1 7914  ax-0id 7916  ax-rnegex 7917  ax-cnre 7919  ax-pre-ltirr 7920  ax-pre-ltwlin 7921  ax-pre-lttrn 7922  ax-pre-ltadd 7924
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 2739  df-sbc 2963  df-dif 3131  df-un 3133  df-in 3135  df-ss 3142  df-pw 3577  df-sn 3598  df-pr 3599  df-op 3601  df-uni 3810  df-int 3845  df-br 4003  df-opab 4064  df-mpt 4065  df-id 4292  df-xp 4631  df-rel 4632  df-cnv 4633  df-co 4634  df-dm 4635  df-rn 4636  df-res 4637  df-ima 4638  df-iota 5177  df-fun 5217  df-fn 5218  df-f 5219  df-fv 5223  df-riota 5828  df-ov 5875  df-oprab 5876  df-mpo 5877  df-pnf 7990  df-mnf 7991  df-xr 7992  df-ltxr 7993  df-le 7994  df-sub 8126  df-neg 8127  df-inn 8916  df-z 9250  df-uz 9525  df-fz 10005  df-struct 12456
This theorem is referenced by:  cnfldstr  13326
  Copyright terms: Public domain W3C validator