Theorem djuinj 7447

Description: The "domain-disjoint-union" of two injective relations with disjoint ranges is an injective relation. (Contributed by BJ, 10-Jul-2022.)

Hypotheses

Ref	Expression
djuinj.r	⊢ (𝜑 → Fun ◡𝑅)
djuinj.s	⊢ (𝜑 → Fun ◡𝑆)
djuinj.disj	⊢ (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)

Assertion

Ref	Expression
djuinj	⊢ (𝜑 → Fun ◡(𝑅 ⊔d 𝑆))

Proof of Theorem djuinj

Step	Hyp	Ref	Expression
1		inlresf1 7402	. . . . . . 7 ⊢ (inl ↾ dom 𝑅):dom 𝑅–1-1→(dom 𝑅 ⊔ 𝐴)
2		f1fun 5601	. . . . . . 7 ⊢ ((inl ↾ dom 𝑅):dom 𝑅–1-1→(dom 𝑅 ⊔ 𝐴) → Fun (inl ↾ dom 𝑅))
3	1, 2	ax-mp 5	. . . . . 6 ⊢ Fun (inl ↾ dom 𝑅)
4		funcnvcnv 5440	. . . . . 6 ⊢ (Fun (inl ↾ dom 𝑅) → Fun ◡◡(inl ↾ dom 𝑅))
5	3, 4	ax-mp 5	. . . . 5 ⊢ Fun ◡◡(inl ↾ dom 𝑅)
6		djuinj.r	. . . . 5 ⊢ (𝜑 → Fun ◡𝑅)
7		funco 5417	. . . . 5 ⊢ ((Fun ◡◡(inl ↾ dom 𝑅) ∧ Fun ◡𝑅) → Fun (◡◡(inl ↾ dom 𝑅) ∘ ◡𝑅))
8	5, 6, 7	sylancr 418	. . . 4 ⊢ (𝜑 → Fun (◡◡(inl ↾ dom 𝑅) ∘ ◡𝑅))
9		cnvco 4965	. . . . 5 ⊢ ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) = (◡◡(inl ↾ dom 𝑅) ∘ ◡𝑅)
10	9	funeqi 5398	. . . 4 ⊢ (Fun ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ↔ Fun (◡◡(inl ↾ dom 𝑅) ∘ ◡𝑅))
11	8, 10	sylibr 134	. . 3 ⊢ (𝜑 → Fun ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)))
12		inrresf1 7403	. . . . . . 7 ⊢ (inr ↾ dom 𝑆):dom 𝑆–1-1→(𝐴 ⊔ dom 𝑆)
13		f1fun 5601	. . . . . . 7 ⊢ ((inr ↾ dom 𝑆):dom 𝑆–1-1→(𝐴 ⊔ dom 𝑆) → Fun (inr ↾ dom 𝑆))
14	12, 13	ax-mp 5	. . . . . 6 ⊢ Fun (inr ↾ dom 𝑆)
15		funcnvcnv 5440	. . . . . 6 ⊢ (Fun (inr ↾ dom 𝑆) → Fun ◡◡(inr ↾ dom 𝑆))
16	14, 15	ax-mp 5	. . . . 5 ⊢ Fun ◡◡(inr ↾ dom 𝑆)
17		djuinj.s	. . . . 5 ⊢ (𝜑 → Fun ◡𝑆)
18		funco 5417	. . . . 5 ⊢ ((Fun ◡◡(inr ↾ dom 𝑆) ∧ Fun ◡𝑆) → Fun (◡◡(inr ↾ dom 𝑆) ∘ ◡𝑆))
19	16, 17, 18	sylancr 418	. . . 4 ⊢ (𝜑 → Fun (◡◡(inr ↾ dom 𝑆) ∘ ◡𝑆))
20		cnvco 4965	. . . . 5 ⊢ ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)) = (◡◡(inr ↾ dom 𝑆) ∘ ◡𝑆)
21	20	funeqi 5398	. . . 4 ⊢ (Fun ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)) ↔ Fun (◡◡(inr ↾ dom 𝑆) ∘ ◡𝑆))
22	19, 21	sylibr 134	. . 3 ⊢ (𝜑 → Fun ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)))
23		df-rn 4785	. . . . . . 7 ⊢ ran (𝑅 ∘ ◡(inl ↾ dom 𝑅)) = dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅))
24		rncoss 5053	. . . . . . 7 ⊢ ran (𝑅 ∘ ◡(inl ↾ dom 𝑅)) ⊆ ran 𝑅
25	23, 24	eqsstrri 3281	. . . . . 6 ⊢ dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ⊆ ran 𝑅
26		df-rn 4785	. . . . . . 7 ⊢ ran (𝑆 ∘ ◡(inr ↾ dom 𝑆)) = dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))
27		rncoss 5053	. . . . . . 7 ⊢ ran (𝑆 ∘ ◡(inr ↾ dom 𝑆)) ⊆ ran 𝑆
28	26, 27	eqsstrri 3281	. . . . . 6 ⊢ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)) ⊆ ran 𝑆
29		ss2in 3459	. . . . . 6 ⊢ ((dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ⊆ ran 𝑅 ∧ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)) ⊆ ran 𝑆) → (dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆))
30	25, 28, 29	mp2an 430	. . . . 5 ⊢ (dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) ⊆ (ran 𝑅 ∩ ran 𝑆)
31		djuinj.disj	. . . . 5 ⊢ (𝜑 → (ran 𝑅 ∩ ran 𝑆) = ∅)
32	30, 31	sseqtrid 3298	. . . 4 ⊢ (𝜑 → (dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) ⊆ ∅)
33		ss0 3563	. . . 4 ⊢ ((dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) ⊆ ∅ → (dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) = ∅)
34	32, 33	syl 14	. . 3 ⊢ (𝜑 → (dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) = ∅)
35		funun 5422	. . 3 ⊢ (((Fun ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∧ Fun ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) ∧ (dom ◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∩ dom ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))) = ∅) → Fun (◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))))
36	11, 22, 34, 35	syl21anc 1277	. 2 ⊢ (𝜑 → Fun (◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))))
37		df-djud 7444	. . . . 5 ⊢ (𝑅 ⊔d 𝑆) = ((𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ (𝑆 ∘ ◡(inr ↾ dom 𝑆)))
38	37	cnveqi 4955	. . . 4 ⊢ ◡(𝑅 ⊔d 𝑆) = ◡((𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ (𝑆 ∘ ◡(inr ↾ dom 𝑆)))
39		cnvun 5193	. . . 4 ⊢ ◡((𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ (𝑆 ∘ ◡(inr ↾ dom 𝑆))) = (◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)))
40	38, 39	eqtri 2259	. . 3 ⊢ ◡(𝑅 ⊔d 𝑆) = (◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆)))
41	40	funeqi 5398	. 2 ⊢ (Fun ◡(𝑅 ⊔d 𝑆) ↔ Fun (◡(𝑅 ∘ ◡(inl ↾ dom 𝑅)) ∪ ◡(𝑆 ∘ ◡(inr ↾ dom 𝑆))))
42	36, 41	sylibr 134	1 ⊢ (𝜑 → Fun ◡(𝑅 ⊔d 𝑆))

This proof depends on syntax axioms:   → wi 4   = wceq 1402   ∪ cun 3218   ∩ cin 3219   ⊆ wss 3220  ∅c0 3520  ^◡ccnv 4773  dom cdm 4774  ran crn 4775   ↾ cres 4776   ∘ ccom 4778  Fun wfun 5371  –1-1→wf1 5374   ⊔ cdju 7378  inlcinl 7386  inrcinr 7387   ⊔_d cdjud 7443

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-iord 4511  df-on 4513  df-suc 4516  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-1st 6374  df-2nd 6375  df-1o 6687  df-dju 7379  df-inl 7388  df-inr 7389  df-djud 7444

This theorem is used by: (None)