Theorem ofun 43257

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 6646	. . 3 ⊢ (𝜑 → (𝐴 ∪ 𝐶) Fn (𝑀 ∪ 𝑁))
5		ofun.b	. . . 4 ⊢ (𝜑 → 𝐵 Fn 𝑀)
6		ofun.d	. . . 4 ⊢ (𝜑 → 𝐷 Fn 𝑁)
7	5, 6, 3	fnund 6646	. . 3 ⊢ (𝜑 → (𝐵 ∪ 𝐷) Fn (𝑀 ∪ 𝑁))
8		ofun.m	. . . 4 ⊢ (𝜑 → 𝑀 ∈ 𝑉)
9		ofun.n	. . . 4 ⊢ (𝜑 → 𝑁 ∈ 𝑊)
10	8, 9	unexd 7757	. . 3 ⊢ (𝜑 → (𝑀 ∪ 𝑁) ∈ V)
11		inidm 4172	. . 3 ⊢ ((𝑀 ∪ 𝑁) ∩ (𝑀 ∪ 𝑁)) = (𝑀 ∪ 𝑁)
12	4, 7, 10, 10, 11	offn 7695	. 2 ⊢ (𝜑 → ((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷)) Fn (𝑀 ∪ 𝑁))
13		inidm 4172	. . . 4 ⊢ (𝑀 ∩ 𝑀) = 𝑀
14	1, 5, 8, 8, 13	offn 7695	. . 3 ⊢ (𝜑 → (𝐴 ∘f 𝑅𝐵) Fn 𝑀)
15		inidm 4172	. . . 4 ⊢ (𝑁 ∩ 𝑁) = 𝑁
16	2, 6, 9, 9, 15	offn 7695	. . 3 ⊢ (𝜑 → (𝐶 ∘f 𝑅𝐷) Fn 𝑁)
17	14, 16, 3	fnund 6646	. 2 ⊢ (𝜑 → ((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷)) Fn (𝑀 ∪ 𝑁))
18		eqidd 2762	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → ((𝐴 ∪ 𝐶)‘𝑥) = ((𝐴 ∪ 𝐶)‘𝑥))
19		eqidd 2762	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → ((𝐵 ∪ 𝐷)‘𝑥) = ((𝐵 ∪ 𝐷)‘𝑥))
20	4, 7, 10, 10, 11, 18, 19	ofval 7693	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → (((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷))‘𝑥) = (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)))
21		elun 4100	. . . 4 ⊢ (𝑥 ∈ (𝑀 ∪ 𝑁) ↔ (𝑥 ∈ 𝑀 ∨ 𝑥 ∈ 𝑁))
22		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐴‘𝑥) = (𝐴‘𝑥))
23		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐵‘𝑥) = (𝐵‘𝑥))
24	1, 5, 8, 8, 13, 22, 23	ofval 7693	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → ((𝐴 ∘f 𝑅𝐵)‘𝑥) = ((𝐴‘𝑥)𝑅(𝐵‘𝑥)))
25	14	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐴 ∘f 𝑅𝐵) Fn 𝑀)
26	16	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝐶 ∘f 𝑅𝐷) Fn 𝑁)
27	3	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (𝑀 ∩ 𝑁) = ∅)
28		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝑥 ∈ 𝑀)
29	25, 26, 27, 28	fvun1d 6970	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥) = ((𝐴 ∘f 𝑅𝐵)‘𝑥))
30	1	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐴 Fn 𝑀)
31	2	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐶 Fn 𝑁)
32	30, 31, 27, 28	fvun1d 6970	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → ((𝐴 ∪ 𝐶)‘𝑥) = (𝐴‘𝑥))
33	5	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐵 Fn 𝑀)
34	6	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → 𝐷 Fn 𝑁)
35	33, 34, 27, 28	fvun1d 6970	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → ((𝐵 ∪ 𝐷)‘𝑥) = (𝐵‘𝑥))
36	32, 35	oveq12d 7430	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = ((𝐴‘𝑥)𝑅(𝐵‘𝑥)))
37	24, 29, 36	3eqtr4rd 2807	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑀) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
38		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐶‘𝑥) = (𝐶‘𝑥))
39		eqidd 2762	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐷‘𝑥) = (𝐷‘𝑥))
40	2, 6, 9, 9, 15, 38, 39	ofval 7693	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → ((𝐶 ∘f 𝑅𝐷)‘𝑥) = ((𝐶‘𝑥)𝑅(𝐷‘𝑥)))
41	14	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐴 ∘f 𝑅𝐵) Fn 𝑀)
42	16	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝐶 ∘f 𝑅𝐷) Fn 𝑁)
43	3	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (𝑀 ∩ 𝑁) = ∅)
44		simpr 490	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝑥 ∈ 𝑁)
45	41, 42, 43, 44	fvun2d 6971	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥) = ((𝐶 ∘f 𝑅𝐷)‘𝑥))
46	1	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐴 Fn 𝑀)
47	2	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐶 Fn 𝑁)
48	46, 47, 43, 44	fvun2d 6971	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → ((𝐴 ∪ 𝐶)‘𝑥) = (𝐶‘𝑥))
49	5	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐵 Fn 𝑀)
50	6	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → 𝐷 Fn 𝑁)
51	49, 50, 43, 44	fvun2d 6971	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → ((𝐵 ∪ 𝐷)‘𝑥) = (𝐷‘𝑥))
52	48, 51	oveq12d 7430	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = ((𝐶‘𝑥)𝑅(𝐷‘𝑥)))
53	40, 45, 52	3eqtr4rd 2807	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑁) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
54	37, 53	jaodan 972	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑀 ∨ 𝑥 ∈ 𝑁)) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
55	21, 54	sylan2b 606	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → (((𝐴 ∪ 𝐶)‘𝑥)𝑅((𝐵 ∪ 𝐷)‘𝑥)) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
56	20, 55	eqtrd 2796	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (𝑀 ∪ 𝑁)) → (((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷))‘𝑥) = (((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷))‘𝑥))
57	12, 17, 56	eqfnfvd 7024	1 ⊢ (𝜑 → ((𝐴 ∪ 𝐶) ∘f 𝑅(𝐵 ∪ 𝐷)) = ((𝐴 ∘f 𝑅𝐵) ∪ (𝐶 ∘f 𝑅𝐷)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145  Vcvv 3451   ∪ cun 3897   ∩ cin 3898  ∅c0 4279   Fn wfn 6526  ‘cfv 6531  (class class class)co 7412   ∘_f cof 7680

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7682

This theorem is used by:  fsuppssind  43583