Theorem ofun 40659

Description: A function operation of unions of disjoint functions is a union of function operations. (Contributed by SN, 16-Jun-2024.)

Hypotheses

Ref	Expression
ofun.a	⊢ (𝜑 → 𝐴 Fn 𝑀)
ofun.b	⊢ (𝜑 → 𝐵 Fn 𝑀)
ofun.c	⊢ (𝜑 → 𝐶 Fn 𝑁)
ofun.d	⊢ (𝜑 → 𝐷 Fn 𝑁)
ofun.m	⊢ (𝜑 → 𝑀 ∈ 𝑉)
ofun.n	⊢ (𝜑 → 𝑁 ∈ 𝑊)
ofun.1	⊢ (𝜑 → (𝑀 ∩ 𝑁) = ∅)

Assertion

Ref	Expression
ofun	⊢ (𝜑 → ((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷)) = ((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷)))

Proof of Theorem ofun

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ofun.a	. . . 4 ⊢ (𝜑 → 𝐴 Fn 𝑀)
2		ofun.c	. . . 4 ⊢ (𝜑 → 𝐶 Fn 𝑁)
3		ofun.1	. . . 4 ⊢ (𝜑 → (𝑀 ∩ 𝑁) = ∅)
4	1, 2, 3	fnund 6615	. . 3 ⊢ (𝜑 → (𝐴 ∪ 𝐶) Fn (𝑀 ∪ 𝑁))
5		ofun.b	. . . 4 ⊢ (𝜑 → 𝐵 Fn 𝑀)
6		ofun.d	. . . 4 ⊢ (𝜑 → 𝐷 Fn 𝑁)
7	5, 6, 3	fnund 6615	. . 3 ⊢ (𝜑 → (𝐵 ∪ 𝐷) Fn (𝑀 ∪ 𝑁))
8		ofun.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉)
9		ofun.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑊)
10	8, 9	unexd 7688	. . 3 ⊢ (𝜑 → (𝑀 ∪ 𝑁) ∈ V)
11		inidm 4178	. . 3 ⊢ ((𝑀 ∪ 𝑁) ∩ (𝑀 ∪ 𝑁)) = (𝑀 ∪ 𝑁)
12	4, 7, 10, 10, 11	offn 7630	. 2 ⊢ (𝜑 → ((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷)) Fn (𝑀 ∪ 𝑁))
13		inidm 4178	. . . 4 ⊢ (𝑀 ∩ 𝑀) = 𝑀
14	1, 5, 8, 8, 13	offn 7630	. . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑅𝐵) Fn 𝑀)
15		inidm 4178	. . . 4 ⊢ (𝑁 ∩ 𝑁) = 𝑁
16	2, 6, 9, 9, 15	offn 7630	. . 3 ⊢ (𝜑 → (𝐶 ∘f 𝑅𝐷) Fn 𝑁)
17	14, 16, 3	fnund 6615	. 2 ⊢ (𝜑 → ((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷)) Fn (𝑀 ∪ 𝑁))
18		eqidd 2737	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → ((𝐴 ∪ 𝐶)‘𝑥) = ((𝐴 ∪ 𝐶)‘𝑥))
19		eqidd 2737	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → ((𝐵 ∪ 𝐷)‘𝑥) = ((𝐵 ∪ 𝐷)‘𝑥))
20	4, 7, 10, 10, 11, 18, 19	ofval 7628	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → (((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷))‘𝑥) = (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)))
21		elun 4108	. . . 4 ⊢ (𝑥 ∈ (𝑀 ∪ 𝑁) ↔ (𝑥 ∈ 𝑀 ∨ 𝑥 ∈ 𝑁))
22		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐴‘𝑥) = (𝐴‘𝑥))
23		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐵‘𝑥) = (𝐵‘𝑥))
24	1, 5, 8, 8, 13, 22, 23	ofval 7628	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → ((𝐴 ∘f 𝑅𝐵)‘𝑥) = ((𝐴‘𝑥)𝑅(𝐵‘𝑥)))
25	14	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐴 ∘f 𝑅𝐵) Fn 𝑀)
26	16	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐶 ∘f 𝑅𝐷) Fn 𝑁)
27	3	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝑀 ∩ 𝑁) = ∅)
28		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝑥 ∈ 𝑀)
29	25, 26, 27, 28	fvun1d 6934	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥) = ((𝐴 ∘f 𝑅𝐵)‘𝑥))
30	1	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐴 Fn 𝑀)
31	2	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐶 Fn 𝑁)
32	30, 31, 27, 28	fvun1d 6934	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → ((𝐴 ∪ 𝐶)‘𝑥) = (𝐴‘𝑥))
33	5	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐵 Fn 𝑀)
34	6	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐷 Fn 𝑁)
35	33, 34, 27, 28	fvun1d 6934	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → ((𝐵 ∪ 𝐷)‘𝑥) = (𝐵‘𝑥))
36	32, 35	oveq12d 7375	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = ((𝐴‘𝑥)𝑅(𝐵‘𝑥)))
37	24, 29, 36	3eqtr4rd 2787	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
38		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐶‘𝑥) = (𝐶‘𝑥))
39		eqidd 2737	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐷‘𝑥) = (𝐷‘𝑥))
40	2, 6, 9, 9, 15, 38, 39	ofval 7628	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → ((𝐶 ∘f 𝑅𝐷)‘𝑥) = ((𝐶‘𝑥)𝑅(𝐷‘𝑥)))
41	14	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐴 ∘f 𝑅𝐵) Fn 𝑀)
42	16	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐶 ∘f 𝑅𝐷) Fn 𝑁)
43	3	adantr 481	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝑀 ∩ 𝑁) = ∅)
44		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑥 ∈ 𝑁)
45	41, 42, 43, 44	fvun2d 6935	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥) = ((𝐶 ∘f 𝑅𝐷)‘𝑥))
46	1	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐴 Fn 𝑀)
47	2	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐶 Fn 𝑁)
48	46, 47, 43, 44	fvun2d 6935	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → ((𝐴 ∪ 𝐶)‘𝑥) = (𝐶‘𝑥))
49	5	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐵 Fn 𝑀)
50	6	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐷 Fn 𝑁)
51	49, 50, 43, 44	fvun2d 6935	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → ((𝐵 ∪ 𝐷)‘𝑥) = (𝐷‘𝑥))
52	48, 51	oveq12d 7375	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = ((𝐶‘𝑥)𝑅(𝐷‘𝑥)))
53	40, 45, 52	3eqtr4rd 2787	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
54	37, 53	jaodan 956	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑀 ∨ 𝑥 ∈ 𝑁)) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
55	21, 54	sylan2b 594	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
56	20, 55	eqtrd 2776	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → (((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷))‘𝑥) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
57	12, 17, 56	eqfnfvd 6985	1 ⊢ (𝜑 → ((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷)) = ((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷)))

Syntax hints:   → wi 4   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  Vcvv 3445   ∪ cun 3908   ∩ cin 3909  ∅c0 4282   Fn wfn 6491  ‘cfv 6496  (class class class)co 7357   ∘_f cof 7615

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pr 5384  ax-un 7672

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-ral 3065  df-rex 3074  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-nul 4283  df-if 4487  df-sn 4587  df-pr 4589  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-id 5531  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-ov 7360  df-oprab 7361  df-mpo 7362  df-of 7617

This theorem is referenced by:  fsuppssind  40754