Theorem djufun 7081

Description: The "domain-disjoint-union" of two functions is a function. (Contributed by BJ, 10-Jul-2022.)

Hypotheses

Ref	Expression
djufun.f	⊢ (𝜑 → Fun 𝐹)
djufun.g	⊢ (𝜑 → Fun 𝐺)

Assertion

Ref	Expression
djufun	⊢ (𝜑 → Fun (𝐹 ⊔d 𝐺))

Proof of Theorem djufun

Step	Hyp	Ref	Expression
1		djufun.f	. . . 4 ⊢ (𝜑 → Fun 𝐹)
2		inlresf1 7038	. . . . 5 ⊢ (inl ↾ dom 𝐹):dom 𝐹–1-1→(dom 𝐹 ⊔ dom 𝐺)
3		df-f1 5203	. . . . . 6 ⊢ ((inl ↾ dom 𝐹):dom 𝐹–1-1→(dom 𝐹 ⊔ dom 𝐺) ↔ ((inl ↾ dom 𝐹):dom 𝐹⟶(dom 𝐹 ⊔ dom 𝐺) ∧ Fun ◡(inl ↾ dom 𝐹)))
4	3	simprbi 273	. . . . 5 ⊢ ((inl ↾ dom 𝐹):dom 𝐹–1-1→(dom 𝐹 ⊔ dom 𝐺) → Fun ◡(inl ↾ dom 𝐹))
5	2, 4	mp1i 10	. . . 4 ⊢ (𝜑 → Fun ◡(inl ↾ dom 𝐹))
6		funco 5238	. . . 4 ⊢ ((Fun 𝐹 ∧ Fun ◡(inl ↾ dom 𝐹)) → Fun (𝐹 ∘ ◡(inl ↾ dom 𝐹)))
7	1, 5, 6	syl2anc 409	. . 3 ⊢ (𝜑 → Fun (𝐹 ∘ ◡(inl ↾ dom 𝐹)))
8		djufun.g	. . . 4 ⊢ (𝜑 → Fun 𝐺)
9		inrresf1 7039	. . . . 5 ⊢ (inr ↾ dom 𝐺):dom 𝐺–1-1→(dom 𝐹 ⊔ dom 𝐺)
10		df-f1 5203	. . . . . 6 ⊢ ((inr ↾ dom 𝐺):dom 𝐺–1-1→(dom 𝐹 ⊔ dom 𝐺) ↔ ((inr ↾ dom 𝐺):dom 𝐺⟶(dom 𝐹 ⊔ dom 𝐺) ∧ Fun ◡(inr ↾ dom 𝐺)))
11	10	simprbi 273	. . . . 5 ⊢ ((inr ↾ dom 𝐺):dom 𝐺–1-1→(dom 𝐹 ⊔ dom 𝐺) → Fun ◡(inr ↾ dom 𝐺))
12	9, 11	mp1i 10	. . . 4 ⊢ (𝜑 → Fun ◡(inr ↾ dom 𝐺))
13		funco 5238	. . . 4 ⊢ ((Fun 𝐺 ∧ Fun ◡(inr ↾ dom 𝐺)) → Fun (𝐺 ∘ ◡(inr ↾ dom 𝐺)))
14	8, 12, 13	syl2anc 409	. . 3 ⊢ (𝜑 → Fun (𝐺 ∘ ◡(inr ↾ dom 𝐺)))
15		dmcoss 4880	. . . . . . 7 ⊢ dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ⊆ dom ◡(inl ↾ dom 𝐹)
16		df-rn 4622	. . . . . . 7 ⊢ ran (inl ↾ dom 𝐹) = dom ◡(inl ↾ dom 𝐹)
17	15, 16	sseqtrri 3182	. . . . . 6 ⊢ dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ⊆ ran (inl ↾ dom 𝐹)
18		dmcoss 4880	. . . . . . 7 ⊢ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺)) ⊆ dom ◡(inr ↾ dom 𝐺)
19		df-rn 4622	. . . . . . 7 ⊢ ran (inr ↾ dom 𝐺) = dom ◡(inr ↾ dom 𝐺)
20	18, 19	sseqtrri 3182	. . . . . 6 ⊢ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺)) ⊆ ran (inr ↾ dom 𝐺)
21		ss2in 3355	. . . . . 6 ⊢ ((dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ⊆ ran (inl ↾ dom 𝐹) ∧ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺)) ⊆ ran (inr ↾ dom 𝐺)) → (dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) ⊆ (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)))
22	17, 20, 21	mp2an 424	. . . . 5 ⊢ (dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) ⊆ (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺))
23		djuinr 7040	. . . . . 6 ⊢ (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)) = ∅
24	23	a1i 9	. . . . 5 ⊢ (𝜑 → (ran (inl ↾ dom 𝐹) ∩ ran (inr ↾ dom 𝐺)) = ∅)
25	22, 24	sseqtrid 3197	. . . 4 ⊢ (𝜑 → (dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) ⊆ ∅)
26		ss0 3455	. . . 4 ⊢ ((dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) ⊆ ∅ → (dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) = ∅)
27	25, 26	syl 14	. . 3 ⊢ (𝜑 → (dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) = ∅)
28		funun 5242	. . 3 ⊢ (((Fun (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∧ Fun (𝐺 ∘ ◡(inr ↾ dom 𝐺))) ∧ (dom (𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∩ dom (𝐺 ∘ ◡(inr ↾ dom 𝐺))) = ∅) → Fun ((𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∪ (𝐺 ∘ ◡(inr ↾ dom 𝐺))))
29	7, 14, 27, 28	syl21anc 1232	. 2 ⊢ (𝜑 → Fun ((𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∪ (𝐺 ∘ ◡(inr ↾ dom 𝐺))))
30		df-djud 7080	. . 3 ⊢ (𝐹 ⊔d 𝐺) = ((𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∪ (𝐺 ∘ ◡(inr ↾ dom 𝐺)))
31	30	funeqi 5219	. 2 ⊢ (Fun (𝐹 ⊔d 𝐺) ↔ Fun ((𝐹 ∘ ◡(inl ↾ dom 𝐹)) ∪ (𝐺 ∘ ◡(inr ↾ dom 𝐺))))
32	29, 31	sylibr 133	1 ⊢ (𝜑 → Fun (𝐹 ⊔d 𝐺))

Syntax hints:   → wi 4   = wceq 1348   ∪ cun 3119   ∩ cin 3120   ⊆ wss 3121  ∅c0 3414  ^◡ccnv 4610  dom cdm 4611  ran crn 4612   ↾ cres 4613   ∘ ccom 4615  Fun wfun 5192  ⟶wf 5194  –1-1→wf1 5195   ⊔ cdju 7014  inlcinl 7022  inrcinr 7023   ⊔_d cdjud 7079

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-v 2732  df-sbc 2956  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-id 4278  df-iord 4351  df-on 4353  df-suc 4356  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-1st 6119  df-2nd 6120  df-1o 6395  df-dju 7015  df-inl 7024  df-inr 7025  df-djud 7080

This theorem is referenced by: (None)