Theorem strext 13519

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

Step	Hyp	Ref	Expression
1		strext.f	. . . . 5 |- ( ph -> F Struct <. A , B >. )
2		isstructim 13425	. . . . 5 |- ( F Struct <. A , B >. -> ( ( A e. NN /\ B e. NN /\ A <_ B ) /\ Fun ( F \ { (/) } ) /\ dom F C_ ( A ... B ) ) )
3	1, 2	syl 14	. . . 4 |- ( ph -> ( ( A e. NN /\ B e. NN /\ A <_ B ) /\ Fun ( F \ { (/) } ) /\ dom F C_ ( A ... B ) ) )
4	3	simp1d 1040	. . 3 |- ( ph -> ( A e. NN /\ B e. NN /\ A <_ B ) )
5	4	simp1d 1040	. 2 |- ( ph -> A e. NN )
6	4	simp2d 1041	. . 3 |- ( ph -> B e. NN )
7		strext.c	. . 3 |- ( ph -> C e. ( ZZ>= ` B ) )
8		eluznn 10017	. . 3 |- ( ( B e. NN /\ C e. ( ZZ>= ` B ) ) -> C e. NN )
9	6, 7, 8	syl2anc 415	. 2 |- ( ph -> C e. NN )
10	5	nnred 9327	. . 3 |- ( ph -> A e. RR )
11	6	nnred 9327	. . 3 |- ( ph -> B e. RR )
12	9	nnred 9327	. . 3 |- ( ph -> C e. RR )
13	4	simp3d 1042	. . 3 |- ( ph -> A <_ B )
14		eluzle 9951	. . . 4 |- ( C e. ( ZZ>= ` B ) -> B <_ C )
15	7, 14	syl 14	. . 3 |- ( ph -> B <_ C )
16	10, 11, 12, 13, 15	letrd 8458	. 2 |- ( ph -> A <_ C )
17	3	simp2d 1041	. 2 |- ( ph -> Fun ( F \ { (/) } ) )
18		structex 13423	. . 3 |- ( F Struct <. A , B >. -> F e. _V )
19	1, 18	syl 14	. 2 |- ( ph -> F e. _V )
20	3	simp3d 1042	. . 3 |- ( ph -> dom F C_ ( A ... B ) )
21		fzss2 10488	. . . 4 |- ( C e. ( ZZ>= ` B ) -> ( A ... B ) C_ ( A ... C ) )
22	7, 21	syl 14	. . 3 |- ( ph -> ( A ... B ) C_ ( A ... C ) )
23	20, 22	sstrd 3258	. 2 |- ( ph -> dom F C_ ( A ... C ) )
24		isstructr 13426	. 2 |- ( ( ( A e. NN /\ C e. NN /\ A <_ C ) /\ ( Fun ( F \ { (/) } ) /\ F e. _V /\ dom F C_ ( A ... C ) ) ) -> F Struct <. A , C >. )
25	5, 9, 16, 17, 19, 23, 24	syl33anc 1293	1 |- ( ph -> F Struct <. A , C >. )

This proof depends on syntax axioms:   -> wi 4   /\ w3a 1009   e. wcel 2209   _Vcvv 2821   \ cdif 3217   C_ wss 3220   (/)c0 3520   {csn 3709   <.cop 3712   class class class wbr 4131   dom cdm 4776   Fun wfun 5374   ` cfv 5380  (class class class)co 6088   <_ cle 8368   NNcn 9314   ZZ>=cuz 9938   ...cfz 10429   Struct cstr 13407

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 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-addcom 8286  ax-addass 8288  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-0id 8294  ax-rnegex 8295  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-ltadd 8302

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 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-fv 5388  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-inn 9315  df-z 9657  df-uz 9939  df-fz 10430  df-struct 13413

This theorem is used by: (None)