Theorem strleund 13204

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 13114	. . . . 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 1035	. . 3 |- ( ph -> ( A e. NN /\ B e. NN /\ A <_ B ) )
5	4	simp1d 1035	. 2 |- ( ph -> A e. NN )
6		strleund.g	. . . . 5 |- ( ph -> G Struct <. C , D >. )
7		isstructim 13114	. . . . 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 1035	. . 3 |- ( ph -> ( C e. NN /\ D e. NN /\ C <_ D ) )
10	9	simp2d 1036	. 2 |- ( ph -> D e. NN )
11	5	nnred 9156	. . 3 |- ( ph -> A e. RR )
12	9	simp1d 1035	. . . 4 |- ( ph -> C e. NN )
13	12	nnred 9156	. . 3 |- ( ph -> C e. RR )
14	10	nnred 9156	. . 3 |- ( ph -> D e. RR )
15	4	simp2d 1036	. . . . 5 |- ( ph -> B e. NN )
16	15	nnred 9156	. . . 4 |- ( ph -> B e. RR )
17	4	simp3d 1037	. . . 4 |- ( ph -> A <_ B )
18		strleund.l	. . . . 5 |- ( ph -> B < C )
19	16, 13, 18	ltled 8298	. . . 4 |- ( ph -> B <_ C )
20	11, 16, 13, 17, 19	letrd 8303	. . 3 |- ( ph -> A <_ C )
21	9	simp3d 1037	. . 3 |- ( ph -> C <_ D )
22	11, 13, 14, 20, 21	letrd 8303	. 2 |- ( ph -> A <_ D )
23	3	simp2d 1036	. . . 4 |- ( ph -> Fun ( F \ { (/) } ) )
24	8	simp2d 1036	. . . 4 |- ( ph -> Fun ( G \ { (/) } ) )
25		difss 3333	. . . . . . . 8 |- ( F \ { (/) } ) C_ F
26		dmss 4930	. . . . . . . 8 |- ( ( F \ { (/) } ) C_ F -> dom ( F \ { (/) } ) C_ dom F )
27	25, 26	mp1i 10	. . . . . . 7 |- ( ph -> dom ( F \ { (/) } ) C_ dom F )
28	3	simp3d 1037	. . . . . . 7 |- ( ph -> dom F C_ ( A ... B ) )
29	27, 28	sstrd 3237	. . . . . 6 |- ( ph -> dom ( F \ { (/) } ) C_ ( A ... B ) )
30		difss 3333	. . . . . . . 8 |- ( G \ { (/) } ) C_ G
31		dmss 4930	. . . . . . . 8 |- ( ( G \ { (/) } ) C_ G -> dom ( G \ { (/) } ) C_ dom G )
32	30, 31	mp1i 10	. . . . . . 7 |- ( ph -> dom ( G \ { (/) } ) C_ dom G )
33	8	simp3d 1037	. . . . . . 7 |- ( ph -> dom G C_ ( C ... D ) )
34	32, 33	sstrd 3237	. . . . . 6 |- ( ph -> dom ( G \ { (/) } ) C_ ( C ... D ) )
35		ss2in 3435	. . . . . 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 10287	. . . . . 6 |- ( B < C -> ( ( A ... B ) i^i ( C ... D ) ) = (/) )
38	18, 37	syl 14	. . . . 5 |- ( ph -> ( ( A ... B ) i^i ( C ... D ) ) = (/) )
39		sseq0 3536	. . . . 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 5371	. . . 4 |- ( ( ( Fun ( F \ { (/) } ) /\ Fun ( G \ { (/) } ) ) /\ ( dom ( F \ { (/) } ) i^i dom ( G \ { (/) } ) ) = (/) ) -> Fun ( ( F \ { (/) } ) u. ( G \ { (/) } ) ) )
42	23, 24, 40, 41	syl21anc 1272	. . 3 |- ( ph -> Fun ( ( F \ { (/) } ) u. ( G \ { (/) } ) ) )
43		difundir 3460	. . . 4 |- ( ( F u. G ) \ { (/) } ) = ( ( F \ { (/) } ) u. ( G \ { (/) } ) )
44	43	funeqi 5347	. . 3 |- ( Fun ( ( F u. G ) \ { (/) } ) <-> Fun ( ( F \ { (/) } ) u. ( G \ { (/) } ) ) )
45	42, 44	sylibr 134	. 2 |- ( ph -> Fun ( ( F u. G ) \ { (/) } ) )
46		structex 13112	. . . 4 |- ( F Struct <. A , B >. -> F e. _V )
47	1, 46	syl 14	. . 3 |- ( ph -> F e. _V )
48		structex 13112	. . . 4 |- ( G Struct <. C , D >. -> G e. _V )
49	6, 48	syl 14	. . 3 |- ( ph -> G e. _V )
50		unexg 4540	. . 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 4938	. . 3 |- dom ( F u. G ) = ( dom F u. dom G )
53	15	nnzd 9601	. . . . . . 7 |- ( ph -> B e. ZZ )
54	10	nnzd 9601	. . . . . . 7 |- ( ph -> D e. ZZ )
55	16, 13, 14, 19, 21	letrd 8303	. . . . . . 7 |- ( ph -> B <_ D )
56		eluz2 9761	. . . . . . 7 |- ( D e. ( ZZ>= ` B ) <-> ( B e. ZZ /\ D e. ZZ /\ B <_ D ) )
57	53, 54, 55, 56	syl3anbrc 1207	. . . . . 6 |- ( ph -> D e. ( ZZ>= ` B ) )
58		fzss2 10299	. . . . . 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 3237	. . . 4 |- ( ph -> dom F C_ ( A ... D ) )
61	5	nnzd 9601	. . . . . . 7 |- ( ph -> A e. ZZ )
62	12	nnzd 9601	. . . . . . 7 |- ( ph -> C e. ZZ )
63		eluz2 9761	. . . . . . 7 |- ( C e. ( ZZ>= ` A ) <-> ( A e. ZZ /\ C e. ZZ /\ A <_ C ) )
64	61, 62, 20, 63	syl3anbrc 1207	. . . . . 6 |- ( ph -> C e. ( ZZ>= ` A ) )
65		fzss1 10298	. . . . . 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 3237	. . . 4 |- ( ph -> dom G C_ ( A ... D ) )
68	60, 67	unssd 3383	. . 3 |- ( ph -> ( dom F u. dom G ) C_ ( A ... D ) )
69	52, 68	eqsstrid 3273	. 2 |- ( ph -> dom ( F u. G ) C_ ( A ... D ) )
70		isstructr 13115	. 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 1288	1 |- ( ph -> ( F u. G ) Struct <. A , D >. )

Syntax hints:   -> wi 4   /\ w3a 1004   = wceq 1397   e. wcel 2202   _Vcvv 2802   \ cdif 3197   u. cun 3198   i^i cin 3199   C_ wss 3200   (/)c0 3494   {csn 3669   <.cop 3672   class class class wbr 4088   dom cdm 4725   Fun wfun 5320   ` cfv 5326  (class class class)co 6018   < clt 8214   <_ cle 8215   NNcn 9143   ZZcz 9479   ZZ>=cuz 9755   ...cfz 10243   Struct cstr 13096

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-distr 8136  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-cnre 8143  ax-pre-ltirr 8144  ax-pre-ltwlin 8145  ax-pre-lttrn 8146  ax-pre-ltadd 8148

This theorem depends on definitions:  df-bi 117  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-xr 8218  df-ltxr 8219  df-le 8220  df-sub 8352  df-neg 8353  df-inn 9144  df-n0 9403  df-z 9480  df-uz 9756  df-fz 10244  df-struct 13102

This theorem is referenced by:  strle2g  13208  strle3g  13209  srngstrd  13247  lmodstrd  13265  ipsstrd  13277  imasvalstrd  13371  prdsvalstrd  13372  psrvalstrd  14701