Theorem strleund 12565

Description: Combine two structures into one. (Contributed by Mario Carneiro, 29-Aug-2015.) (Revised by Jim Kingdon, 27-Jan-2023.)

Hypotheses

Ref	Expression
strleund.f	|- ( ph -> F Struct <. A , B >. )
strleund.g	|- ( ph -> G Struct <. C , D >. )
strleund.l	|- ( ph -> B < C )

Assertion

Ref	Expression
strleund	|- ( ph -> ( F u. G ) Struct <. A , D >. )

Proof of Theorem strleund

Step	Hyp	Ref	Expression
1		strleund.f	. . . . 5 |- ( ph -> F Struct <. A , B >. )
2		isstructim 12479	. . . . 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 1009	. . 3 |- ( ph -> ( A e. NN /\ B e. NN /\ A <_ B ) )
5	4	simp1d 1009	. 2 |- ( ph -> A e. NN )
6		strleund.g	. . . . 5 |- ( ph -> G Struct <. C , D >. )
7		isstructim 12479	. . . . 5 |- ( G Struct <. C , D >. -> ( ( C e. NN /\ D e. NN /\ C <_ D ) /\ Fun ( G \ { (/) } ) /\ dom G C_ ( C ... D ) ) )
8	6, 7	syl 14	. . . 4 |- ( ph -> ( ( C e. NN /\ D e. NN /\ C <_ D ) /\ Fun ( G \ { (/) } ) /\ dom G C_ ( C ... D ) ) )
9	8	simp1d 1009	. . 3 |- ( ph -> ( C e. NN /\ D e. NN /\ C <_ D ) )
10	9	simp2d 1010	. 2 |- ( ph -> D e. NN )
11	5	nnred 8935	. . 3 |- ( ph -> A e. RR )
12	9	simp1d 1009	. . . 4 |- ( ph -> C e. NN )
13	12	nnred 8935	. . 3 |- ( ph -> C e. RR )
14	10	nnred 8935	. . 3 |- ( ph -> D e. RR )
15	4	simp2d 1010	. . . . 5 |- ( ph -> B e. NN )
16	15	nnred 8935	. . . 4 |- ( ph -> B e. RR )
17	4	simp3d 1011	. . . 4 |- ( ph -> A <_ B )
18		strleund.l	. . . . 5 |- ( ph -> B < C )
19	16, 13, 18	ltled 8079	. . . 4 |- ( ph -> B <_ C )
20	11, 16, 13, 17, 19	letrd 8084	. . 3 |- ( ph -> A <_ C )
21	9	simp3d 1011	. . 3 |- ( ph -> C <_ D )
22	11, 13, 14, 20, 21	letrd 8084	. 2 |- ( ph -> A <_ D )
23	3	simp2d 1010	. . . 4 |- ( ph -> Fun ( F \ { (/) } ) )
24	8	simp2d 1010	. . . 4 |- ( ph -> Fun ( G \ { (/) } ) )
25		difss 3263	. . . . . . . 8 |- ( F \ { (/) } ) C_ F
26		dmss 4828	. . . . . . . 8 |- ( ( F \ { (/) } ) C_ F -> dom ( F \ { (/) } ) C_ dom F )
27	25, 26	mp1i 10	. . . . . . 7 |- ( ph -> dom ( F \ { (/) } ) C_ dom F )
28	3	simp3d 1011	. . . . . . 7 |- ( ph -> dom F C_ ( A ... B ) )
29	27, 28	sstrd 3167	. . . . . 6 |- ( ph -> dom ( F \ { (/) } ) C_ ( A ... B ) )
30		difss 3263	. . . . . . . 8 |- ( G \ { (/) } ) C_ G
31		dmss 4828	. . . . . . . 8 |- ( ( G \ { (/) } ) C_ G -> dom ( G \ { (/) } ) C_ dom G )
32	30, 31	mp1i 10	. . . . . . 7 |- ( ph -> dom ( G \ { (/) } ) C_ dom G )
33	8	simp3d 1011	. . . . . . 7 |- ( ph -> dom G C_ ( C ... D ) )
34	32, 33	sstrd 3167	. . . . . 6 |- ( ph -> dom ( G \ { (/) } ) C_ ( C ... D ) )
35		ss2in 3365	. . . . . 6 |- ( ( dom ( F \ { (/) } ) C_ ( A ... B ) /\ dom ( G \ { (/) } ) C_ ( C ... D ) ) -> ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) C_ ( ( A ... B ) i^i ( C ... D ) ) )
36	29, 34, 35	syl2anc 411	. . . . 5 |- ( ph -> ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) C_ ( ( A ... B ) i^i ( C ... D ) ) )
37		fzdisj 10055	. . . . . 6 |- ( B < C -> ( ( A ... B ) i^i ( C ... D ) ) = (/) )
38	18, 37	syl 14	. . . . 5 |- ( ph -> ( ( A ... B ) i^i ( C ... D ) ) = (/) )
39		sseq0 3466	. . . . 5 |- ( ( ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) C_ ( ( A ... B ) i^i ( C ... D ) ) /\ ( ( A ... B ) i^i ( C ... D ) ) = (/) ) -> ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) = (/) )
40	36, 38, 39	syl2anc 411	. . . 4 |- ( ph -> ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) = (/) )
41		funun 5262	. . . 4 |- ( ( ( Fun ( F \ { (/) } ) /\ Fun ( G \ { (/) } ) ) /\ ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) = (/) ) -> Fun ( ( F \ { (/) } ) u. ( G \ { (/) } ) ) )
42	23, 24, 40, 41	syl21anc 1237	. . 3 |- ( ph -> Fun ( ( F \ { (/) } ) u. ( G \ { (/) } ) ) )
43		difundir 3390	. . . 4 |- ( ( F u. G ) \ { (/) } ) = ( ( F \ { (/) } ) u. ( G \ { (/) } ) )
44	43	funeqi 5239	. . 3 |- ( Fun ( ( F u. G ) \ { (/) } ) <-> Fun ( ( F \ { (/) } ) u. ( G \ { (/) } ) ) )
45	42, 44	sylibr 134	. 2 |- ( ph -> Fun ( ( F u. G ) \ { (/) } ) )
46		structex 12477	. . . 4 |- ( F Struct <. A , B >. -> F e. _V )
47	1, 46	syl 14	. . 3 |- ( ph -> F e. _V )
48		structex 12477	. . . 4 |- ( G Struct <. C , D >. -> G e. _V )
49	6, 48	syl 14	. . 3 |- ( ph -> G e. _V )
50		unexg 4445	. . 3 |- ( ( F e. _V /\ G e. _V ) -> ( F u. G ) e. _V )
51	47, 49, 50	syl2anc 411	. 2 |- ( ph -> ( F u. G ) e. _V )
52		dmun 4836	. . 3 |- dom ( F u. G ) = ( dom F u. dom G )
53	15	nnzd 9377	. . . . . . 7 |- ( ph -> B e. ZZ )
54	10	nnzd 9377	. . . . . . 7 |- ( ph -> D e. ZZ )
55	16, 13, 14, 19, 21	letrd 8084	. . . . . . 7 |- ( ph -> B <_ D )
56		eluz2 9537	. . . . . . 7 |- ( D e. ( ZZ>= ` B ) <-> ( B e. ZZ /\ D e. ZZ /\ B <_ D ) )
57	53, 54, 55, 56	syl3anbrc 1181	. . . . . 6 |- ( ph -> D e. ( ZZ>= ` B ) )
58		fzss2 10067	. . . . . 6 |- ( D e. ( ZZ>= ` B ) -> ( A ... B ) C_ ( A ... D ) )
59	57, 58	syl 14	. . . . 5 |- ( ph -> ( A ... B ) C_ ( A ... D ) )
60	28, 59	sstrd 3167	. . . 4 |- ( ph -> dom F C_ ( A ... D ) )
61	5	nnzd 9377	. . . . . . 7 |- ( ph -> A e. ZZ )
62	12	nnzd 9377	. . . . . . 7 |- ( ph -> C e. ZZ )
63		eluz2 9537	. . . . . . 7 |- ( C e. ( ZZ>= ` A ) <-> ( A e. ZZ /\ C e. ZZ /\ A <_ C ) )
64	61, 62, 20, 63	syl3anbrc 1181	. . . . . 6 |- ( ph -> C e. ( ZZ>= ` A ) )
65		fzss1 10066	. . . . . 6 |- ( C e. ( ZZ>= ` A ) -> ( C ... D ) C_ ( A ... D ) )
66	64, 65	syl 14	. . . . 5 |- ( ph -> ( C ... D ) C_ ( A ... D ) )
67	33, 66	sstrd 3167	. . . 4 |- ( ph -> dom G C_ ( A ... D ) )
68	60, 67	unssd 3313	. . 3 |- ( ph -> ( dom F u. dom G ) C_ ( A ... D ) )
69	52, 68	eqsstrid 3203	. 2 |- ( ph -> dom ( F u. G ) C_ ( A ... D ) )
70		isstructr 12480	. 2 |- ( ( ( A e. NN /\ D e. NN /\ A <_ D ) /\ ( Fun ( ( F u. G ) \ { (/) } ) /\ ( F u. G ) e. _V /\ dom ( F u. G ) C_ ( A ... D ) ) ) -> ( F u. G ) Struct <. A , D >. )
71	5, 10, 22, 45, 51, 69, 70	syl33anc 1253	1 |- ( ph -> ( F u. G ) Struct <. A , D >. )

Syntax hints:   -> wi 4   /\ w3a 978   = wceq 1353   e. wcel 2148   _Vcvv 2739   \ cdif 3128   u. cun 3129   i^i cin 3130   C_ wss 3131   (/)c0 3424   {csn 3594   <.cop 3597   class class class wbr 4005   dom cdm 4628   Fun wfun 5212   ` cfv 5218  (class class class)co 5878   < clt 7995   <_ cle 7996   NNcn 8922   ZZcz 9256   ZZ>=cuz 9531   ...cfz 10011   Struct cstr 12461

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-nul 3425  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  df-fz 10012  df-struct 12467

This theorem is referenced by:  strle2g  12569  strle3g  12570  srngstrd  12607  lmodstrd  12625  ipsstrd  12637