Theorem metakunt17 40141

Description: The union of three disjoint bijections is a bijection. (Contributed by metakunt, 28-May-2024.)

Hypotheses

Ref	Expression
metakunt17.1	⊢ (𝜑 → 𝐺:𝐴–1-1-onto→𝑋)
metakunt17.2	⊢ (𝜑 → 𝐻:𝐵–1-1-onto→𝑌)
metakunt17.3	⊢ (𝜑 → 𝐼:𝐶–1-1-onto→𝑍)
metakunt17.4	⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)
metakunt17.5	⊢ (𝜑 → (𝐴 ∩ 𝐶) = ∅)
metakunt17.6	⊢ (𝜑 → (𝐵 ∩ 𝐶) = ∅)
metakunt17.7	⊢ (𝜑 → (𝑋 ∩ 𝑌) = ∅)
metakunt17.8	⊢ (𝜑 → (𝑋 ∩ 𝑍) = ∅)
metakunt17.9	⊢ (𝜑 → (𝑌 ∩ 𝑍) = ∅)
metakunt17.10	⊢ (𝜑 → 𝐹 = ((𝐺 ∪ 𝐻) ∪ 𝐼))
metakunt17.11	⊢ (𝜑 → 𝐷 = ((𝐴 ∪ 𝐵) ∪ 𝐶))
metakunt17.12	⊢ (𝜑 → 𝑊 = ((𝑋 ∪ 𝑌) ∪ 𝑍))

Assertion

Ref	Expression
metakunt17	⊢ (𝜑 → 𝐹:𝐷–1-1-onto→𝑊)

Proof of Theorem metakunt17

Step	Hyp	Ref	Expression
1		metakunt17.1	. . . . . 6 ⊢ (𝜑 → 𝐺:𝐴–1-1-onto→𝑋)
2		metakunt17.2	. . . . . 6 ⊢ (𝜑 → 𝐻:𝐵–1-1-onto→𝑌)
3		metakunt17.4	. . . . . . 7 ⊢ (𝜑 → (𝐴 ∩ 𝐵) = ∅)
4		metakunt17.7	. . . . . . 7 ⊢ (𝜑 → (𝑋 ∩ 𝑌) = ∅)
5	3, 4	jca 512	. . . . . 6 ⊢ (𝜑 → ((𝐴 ∩ 𝐵) = ∅ ∧ (𝑋 ∩ 𝑌) = ∅))
6	1, 2, 5	jca31 515	. . . . 5 ⊢ (𝜑 → ((𝐺:𝐴–1-1-onto→𝑋 ∧ 𝐻:𝐵–1-1-onto→𝑌) ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ (𝑋 ∩ 𝑌) = ∅)))
7		f1oun 6735	. . . . 5 ⊢ (((𝐺:𝐴–1-1-onto→𝑋 ∧ 𝐻:𝐵–1-1-onto→𝑌) ∧ ((𝐴 ∩ 𝐵) = ∅ ∧ (𝑋 ∩ 𝑌) = ∅)) → (𝐺 ∪ 𝐻):(𝐴 ∪ 𝐵)–1-1-onto→(𝑋 ∪ 𝑌))
8	6, 7	syl 17	. . . 4 ⊢ (𝜑 → (𝐺 ∪ 𝐻):(𝐴 ∪ 𝐵)–1-1-onto→(𝑋 ∪ 𝑌))
9		metakunt17.3	. . . 4 ⊢ (𝜑 → 𝐼:𝐶–1-1-onto→𝑍)
10		indir 4209	. . . . . 6 ⊢ ((𝐴 ∪ 𝐵) ∩ 𝐶) = ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶))
11		metakunt17.5	. . . . . . . 8 ⊢ (𝜑 → (𝐴 ∩ 𝐶) = ∅)
12		metakunt17.6	. . . . . . . 8 ⊢ (𝜑 → (𝐵 ∩ 𝐶) = ∅)
13	11, 12	uneq12d 4098	. . . . . . 7 ⊢ (𝜑 → ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = (∅ ∪ ∅))
14		0un 4326	. . . . . . . 8 ⊢ (∅ ∪ ∅) = ∅
15	14	a1i 11	. . . . . . 7 ⊢ (𝜑 → (∅ ∪ ∅) = ∅)
16	13, 15	eqtrd 2778	. . . . . 6 ⊢ (𝜑 → ((𝐴 ∩ 𝐶) ∪ (𝐵 ∩ 𝐶)) = ∅)
17	10, 16	eqtrid 2790	. . . . 5 ⊢ (𝜑 → ((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅)
18		indir 4209	. . . . . 6 ⊢ ((𝑋 ∪ 𝑌) ∩ 𝑍) = ((𝑋 ∩ 𝑍) ∪ (𝑌 ∩ 𝑍))
19		metakunt17.8	. . . . . . . 8 ⊢ (𝜑 → (𝑋 ∩ 𝑍) = ∅)
20		metakunt17.9	. . . . . . . 8 ⊢ (𝜑 → (𝑌 ∩ 𝑍) = ∅)
21	19, 20	uneq12d 4098	. . . . . . 7 ⊢ (𝜑 → ((𝑋 ∩ 𝑍) ∪ (𝑌 ∩ 𝑍)) = (∅ ∪ ∅))
22	21, 15	eqtrd 2778	. . . . . 6 ⊢ (𝜑 → ((𝑋 ∩ 𝑍) ∪ (𝑌 ∩ 𝑍)) = ∅)
23	18, 22	eqtrid 2790	. . . . 5 ⊢ (𝜑 → ((𝑋 ∪ 𝑌) ∩ 𝑍) = ∅)
24	17, 23	jca 512	. . . 4 ⊢ (𝜑 → (((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅ ∧ ((𝑋 ∪ 𝑌) ∩ 𝑍) = ∅))
25	8, 9, 24	jca31 515	. . 3 ⊢ (𝜑 → (((𝐺 ∪ 𝐻):(𝐴 ∪ 𝐵)–1-1-onto→(𝑋 ∪ 𝑌) ∧ 𝐼:𝐶–1-1-onto→𝑍) ∧ (((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅ ∧ ((𝑋 ∪ 𝑌) ∩ 𝑍) = ∅)))
26		f1oun 6735	. . 3 ⊢ ((((𝐺 ∪ 𝐻):(𝐴 ∪ 𝐵)–1-1-onto→(𝑋 ∪ 𝑌) ∧ 𝐼:𝐶–1-1-onto→𝑍) ∧ (((𝐴 ∪ 𝐵) ∩ 𝐶) = ∅ ∧ ((𝑋 ∪ 𝑌) ∩ 𝑍) = ∅)) → ((𝐺 ∪ 𝐻) ∪ 𝐼):((𝐴 ∪ 𝐵) ∪ 𝐶)–1-1-onto→((𝑋 ∪ 𝑌) ∪ 𝑍))
27	25, 26	syl 17	. 2 ⊢ (𝜑 → ((𝐺 ∪ 𝐻) ∪ 𝐼):((𝐴 ∪ 𝐵) ∪ 𝐶)–1-1-onto→((𝑋 ∪ 𝑌) ∪ 𝑍))
28		metakunt17.10	. . 3 ⊢ (𝜑 → 𝐹 = ((𝐺 ∪ 𝐻) ∪ 𝐼))
29		metakunt17.11	. . 3 ⊢ (𝜑 → 𝐷 = ((𝐴 ∪ 𝐵) ∪ 𝐶))
30		metakunt17.12	. . 3 ⊢ (𝜑 → 𝑊 = ((𝑋 ∪ 𝑌) ∪ 𝑍))
31	28, 29, 30	f1oeq123d 6710	. 2 ⊢ (𝜑 → (𝐹:𝐷–1-1-onto→𝑊 ↔ ((𝐺 ∪ 𝐻) ∪ 𝐼):((𝐴 ∪ 𝐵) ∪ 𝐶)–1-1-onto→((𝑋 ∪ 𝑌) ∪ 𝑍)))
32	27, 31	mpbird 256	1 ⊢ (𝜑 → 𝐹:𝐷–1-1-onto→𝑊)

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539   ∪ cun 3885   ∩ cin 3886  ∅c0 4256  –1-1-onto→wf1o 6432

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440

This theorem is referenced by:  metakunt25  40149