Theorem caserel 7391

Description: The "case" construction of two relations is a relation, with bounds on its domain and codomain. Typically, the "case" construction is used when both relations have a common codomain. (Contributed by BJ, 10-Jul-2022.)

Assertion

Ref	Expression
caserel	⊢ case(𝑅, 𝑆) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))

Proof of Theorem caserel

Step	Hyp	Ref	Expression
1		df-case 7388	. 2 ⊢ case(𝑅, 𝑆) = ((𝑅 ∘ ◡inl) ∪ (𝑆 ∘ ◡inr))
2		cocnvss 5293	. . . 4 ⊢ (𝑅 ∘ ◡inl) ⊆ (ran (inl ↾ dom 𝑅) × ran (𝑅 ↾ dom inl))
3		inlresf1 7365	. . . . . 6 ⊢ (inl ↾ dom 𝑅):dom 𝑅–1-1→(dom 𝑅 ⊔ dom 𝑆)
4		f1rn 5579	. . . . . 6 ⊢ ((inl ↾ dom 𝑅):dom 𝑅–1-1→(dom 𝑅 ⊔ dom 𝑆) → ran (inl ↾ dom 𝑅) ⊆ (dom 𝑅 ⊔ dom 𝑆))
5	3, 4	ax-mp 5	. . . . 5 ⊢ ran (inl ↾ dom 𝑅) ⊆ (dom 𝑅 ⊔ dom 𝑆)
6		resss 5067	. . . . . . 7 ⊢ (𝑅 ↾ dom inl) ⊆ 𝑅
7		rnss 4992	. . . . . . 7 ⊢ ((𝑅 ↾ dom inl) ⊆ 𝑅 → ran (𝑅 ↾ dom inl) ⊆ ran 𝑅)
8	6, 7	ax-mp 5	. . . . . 6 ⊢ ran (𝑅 ↾ dom inl) ⊆ ran 𝑅
9		ssun1 3386	. . . . . 6 ⊢ ran 𝑅 ⊆ (ran 𝑅 ∪ ran 𝑆)
10	8, 9	sstri 3251	. . . . 5 ⊢ ran (𝑅 ↾ dom inl) ⊆ (ran 𝑅 ∪ ran 𝑆)
11		xpss12 4862	. . . . 5 ⊢ ((ran (inl ↾ dom 𝑅) ⊆ (dom 𝑅 ⊔ dom 𝑆) ∧ ran (𝑅 ↾ dom inl) ⊆ (ran 𝑅 ∪ ran 𝑆)) → (ran (inl ↾ dom 𝑅) × ran (𝑅 ↾ dom inl)) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆)))
12	5, 10, 11	mp2an 426	. . . 4 ⊢ (ran (inl ↾ dom 𝑅) × ran (𝑅 ↾ dom inl)) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))
13	2, 12	sstri 3251	. . 3 ⊢ (𝑅 ∘ ◡inl) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))
14		cocnvss 5293	. . . 4 ⊢ (𝑆 ∘ ◡inr) ⊆ (ran (inr ↾ dom 𝑆) × ran (𝑆 ↾ dom inr))
15		inrresf1 7366	. . . . . 6 ⊢ (inr ↾ dom 𝑆):dom 𝑆–1-1→(dom 𝑅 ⊔ dom 𝑆)
16		f1rn 5579	. . . . . 6 ⊢ ((inr ↾ dom 𝑆):dom 𝑆–1-1→(dom 𝑅 ⊔ dom 𝑆) → ran (inr ↾ dom 𝑆) ⊆ (dom 𝑅 ⊔ dom 𝑆))
17	15, 16	ax-mp 5	. . . . 5 ⊢ ran (inr ↾ dom 𝑆) ⊆ (dom 𝑅 ⊔ dom 𝑆)
18		resss 5067	. . . . . . 7 ⊢ (𝑆 ↾ dom inr) ⊆ 𝑆
19		rnss 4992	. . . . . . 7 ⊢ ((𝑆 ↾ dom inr) ⊆ 𝑆 → ran (𝑆 ↾ dom inr) ⊆ ran 𝑆)
20	18, 19	ax-mp 5	. . . . . 6 ⊢ ran (𝑆 ↾ dom inr) ⊆ ran 𝑆
21		ssun2 3387	. . . . . 6 ⊢ ran 𝑆 ⊆ (ran 𝑅 ∪ ran 𝑆)
22	20, 21	sstri 3251	. . . . 5 ⊢ ran (𝑆 ↾ dom inr) ⊆ (ran 𝑅 ∪ ran 𝑆)
23		xpss12 4862	. . . . 5 ⊢ ((ran (inr ↾ dom 𝑆) ⊆ (dom 𝑅 ⊔ dom 𝑆) ∧ ran (𝑆 ↾ dom inr) ⊆ (ran 𝑅 ∪ ran 𝑆)) → (ran (inr ↾ dom 𝑆) × ran (𝑆 ↾ dom inr)) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆)))
24	17, 22, 23	mp2an 426	. . . 4 ⊢ (ran (inr ↾ dom 𝑆) × ran (𝑆 ↾ dom inr)) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))
25	14, 24	sstri 3251	. . 3 ⊢ (𝑆 ∘ ◡inr) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))
26	13, 25	unssi 3398	. 2 ⊢ ((𝑅 ∘ ◡inl) ∪ (𝑆 ∘ ◡inr)) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))
27	1, 26	eqsstri 3274	1 ⊢ case(𝑅, 𝑆) ⊆ ((dom 𝑅 ⊔ dom 𝑆) × (ran 𝑅 ∪ ran 𝑆))

Syntax hints:   ∪ cun 3212   ⊆ wss 3214   × cxp 4752  ^◡ccnv 4753  dom cdm 4754  ran crn 4755   ↾ cres 4756   ∘ ccom 4758  –1-1→wf1 5354   ⊔ cdju 7341  inlcinl 7349  inrcinr 7350  casecdjucase 7387

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-v 2817  df-sbc 3046  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-iord 4492  df-on 4494  df-suc 4497  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-1st 6347  df-2nd 6348  df-1o 6660  df-dju 7342  df-inl 7351  df-inr 7352  df-case 7388

This theorem is referenced by:  casef  7392