Theorem f1un 6823

Description: The union of two one-to-one functions with disjoint domains and codomains. (Contributed by BTernaryTau, 3-Dec-2024.)

Assertion

Ref	Expression
f1un	⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(𝐵 ∪ 𝐷))

Proof of Theorem f1un

Step	Hyp	Ref	Expression
1		f1f 6759	. . . 4 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴⟶𝐵)
2	1	frnd 6699	. . 3 ⊢ (𝐹:𝐴–1-1→𝐵 → ran 𝐹 ⊆ 𝐵)
3		f1f 6759	. . . 4 ⊢ (𝐺:𝐶–1-1→𝐷 → 𝐺:𝐶⟶𝐷)
4	3	frnd 6699	. . 3 ⊢ (𝐺:𝐶–1-1→𝐷 → ran 𝐺 ⊆ 𝐷)
5		unss12 4154	. . 3 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ ran 𝐺 ⊆ 𝐷) → (ran 𝐹 ∪ ran 𝐺) ⊆ (𝐵 ∪ 𝐷))
6	2, 4, 5	syl2an 596	. 2 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) → (ran 𝐹 ∪ ran 𝐺) ⊆ (𝐵 ∪ 𝐷))
7		f1f1orn 6814	. . . . 5 ⊢ (𝐹:𝐴–1-1→𝐵 → 𝐹:𝐴–1-1-onto→ran 𝐹)
8		f1f1orn 6814	. . . . 5 ⊢ (𝐺:𝐶–1-1→𝐷 → 𝐺:𝐶–1-1-onto→ran 𝐺)
9	7, 8	anim12i 613	. . . 4 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) → (𝐹:𝐴–1-1-onto→ran 𝐹 ∧ 𝐺:𝐶–1-1-onto→ran 𝐺))
10		simprl 770	. . . . 5 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐴 ∩ 𝐶) = ∅)
11		ss2in 4211	. . . . . . . 8 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ ran 𝐺 ⊆ 𝐷) → (ran 𝐹 ∩ ran 𝐺) ⊆ (𝐵 ∩ 𝐷))
12	2, 4, 11	syl2an 596	. . . . . . 7 ⊢ ((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) → (ran 𝐹 ∩ ran 𝐺) ⊆ (𝐵 ∩ 𝐷))
13		sseq0 4369	. . . . . . 7 ⊢ (((ran 𝐹 ∩ ran 𝐺) ⊆ (𝐵 ∩ 𝐷) ∧ (𝐵 ∩ 𝐷) = ∅) → (ran 𝐹 ∩ ran 𝐺) = ∅)
14	12, 13	sylan 580	. . . . . 6 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ (𝐵 ∩ 𝐷) = ∅) → (ran 𝐹 ∩ ran 𝐺) = ∅)
15	14	adantrl 716	. . . . 5 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (ran 𝐹 ∩ ran 𝐺) = ∅)
16	10, 15	jca 511	. . . 4 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → ((𝐴 ∩ 𝐶) = ∅ ∧ (ran 𝐹 ∩ ran 𝐺) = ∅))
17		f1oun 6822	. . . 4 ⊢ (((𝐹:𝐴–1-1-onto→ran 𝐹 ∧ 𝐺:𝐶–1-1-onto→ran 𝐺) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (ran 𝐹 ∩ ran 𝐺) = ∅)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1-onto→(ran 𝐹 ∪ ran 𝐺))
18	9, 16, 17	syl2an2r 685	. . 3 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1-onto→(ran 𝐹 ∪ ran 𝐺))
19		f1of1 6802	. . 3 ⊢ ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1-onto→(ran 𝐹 ∪ ran 𝐺) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(ran 𝐹 ∪ ran 𝐺))
20	18, 19	syl 17	. 2 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(ran 𝐹 ∪ ran 𝐺))
21		f1ss 6764	. . 3 ⊢ (((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(ran 𝐹 ∪ ran 𝐺) ∧ (ran 𝐹 ∪ ran 𝐺) ⊆ (𝐵 ∪ 𝐷)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(𝐵 ∪ 𝐷))
22	21	ancoms 458	. 2 ⊢ (((ran 𝐹 ∪ ran 𝐺) ⊆ (𝐵 ∪ 𝐷) ∧ (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(ran 𝐹 ∪ ran 𝐺)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(𝐵 ∪ 𝐷))
23	6, 20, 22	syl2an2r 685	1 ⊢ (((𝐹:𝐴–1-1→𝐵 ∧ 𝐺:𝐶–1-1→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1→(𝐵 ∪ 𝐷))

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1540   ∪ cun 3915   ∩ cin 3916   ⊆ wss 3917  ∅c0 4299  ran crn 5642  –1-1→wf1 6511  –1-1-onto→wf1o 6513

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521

This theorem is referenced by:  undom  9033