Theorem f1oun 6853

Description: The union of two one-to-one onto functions with disjoint domains and ranges. (Contributed by NM, 26-Mar-1998.)

Assertion

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

Proof of Theorem f1oun

Step	Hyp	Ref	Expression
1		dff1o4 6842	. . . 4 ⊢ (𝐹:𝐴–1-1-onto→𝐵 ↔ (𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵))
2		dff1o4 6842	. . . 4 ⊢ (𝐺:𝐶–1-1-onto→𝐷 ↔ (𝐺 Fn 𝐶 ∧ ◡𝐺 Fn 𝐷))
3		fnun 6664	. . . . . . 7 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶))
4	3	ex 414	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶) → ((𝐴 ∩ 𝐶) = ∅ → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶)))
5		fnun 6664	. . . . . . . 8 ⊢ (((◡𝐹 Fn 𝐵 ∧ ◡𝐺 Fn 𝐷) ∧ (𝐵 ∩ 𝐷) = ∅) → (◡𝐹 ∪ ◡𝐺) Fn (𝐵 ∪ 𝐷))
6		cnvun 6143	. . . . . . . . 9 ⊢ ◡(𝐹 ∪ 𝐺) = (◡𝐹 ∪ ◡𝐺)
7	6	fneq1i 6647	. . . . . . . 8 ⊢ (◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷) ↔ (◡𝐹 ∪ ◡𝐺) Fn (𝐵 ∪ 𝐷))
8	5, 7	sylibr 233	. . . . . . 7 ⊢ (((◡𝐹 Fn 𝐵 ∧ ◡𝐺 Fn 𝐷) ∧ (𝐵 ∩ 𝐷) = ∅) → ◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷))
9	8	ex 414	. . . . . 6 ⊢ ((◡𝐹 Fn 𝐵 ∧ ◡𝐺 Fn 𝐷) → ((𝐵 ∩ 𝐷) = ∅ → ◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷)))
10	4, 9	im2anan9 621	. . . . 5 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶) ∧ (◡𝐹 Fn 𝐵 ∧ ◡𝐺 Fn 𝐷)) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶) ∧ ◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷))))
11	10	an4s 659	. . . 4 ⊢ (((𝐹 Fn 𝐴 ∧ ◡𝐹 Fn 𝐵) ∧ (𝐺 Fn 𝐶 ∧ ◡𝐺 Fn 𝐷)) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶) ∧ ◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷))))
12	1, 2, 11	syl2anb 599	. . 3 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶) ∧ ◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷))))
13		dff1o4 6842	. . 3 ⊢ ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷) ↔ ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶) ∧ ◡(𝐹 ∪ 𝐺) Fn (𝐵 ∪ 𝐷)))
14	12, 13	imbitrrdi 251	. 2 ⊢ ((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷) → (((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷)))
15	14	imp 408	1 ⊢ (((𝐹:𝐴–1-1-onto→𝐵 ∧ 𝐺:𝐶–1-1-onto→𝐷) ∧ ((𝐴 ∩ 𝐶) = ∅ ∧ (𝐵 ∩ 𝐷) = ∅)) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–1-1-onto→(𝐵 ∪ 𝐷))

Syntax hints:   → wi 4   ∧ wa 397   = wceq 1542   ∪ cun 3947   ∩ cin 3948  ∅c0 4323  ^◡ccnv 5676   Fn wfn 6539  –1-1-onto→wf1o 6543

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 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-12 2172  ax-ext 2704  ax-sep 5300  ax-nul 5307  ax-pr 5428

This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-rex 3072  df-rab 3434  df-v 3477  df-dif 3952  df-un 3954  df-in 3956  df-ss 3966  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-br 5150  df-opab 5212  df-id 5575  df-xp 5683  df-rel 5684  df-cnv 5685  df-co 5686  df-dm 5687  df-rn 5688  df-fun 6546  df-fn 6547  df-f 6548  df-f1 6549  df-fo 6550  df-f1o 6551

This theorem is referenced by:  f1un  6854  f1oprg  6879  fveqf1o  7301  f1ofvswap  7304  oacomf1o  8565  unen  9046  enfixsn  9081  domss2  9136  isinf  9260  isinfOLD  9261  marypha1lem  9428  hashf1lem1  14415  hashf1lem1OLD  14416  f1oun2prg  14868  eupthp1  29469  isoun  31923  cycpmcl  32275  cycpmconjslem2  32314  subfacp1lem2a  34171  subfacp1lem5  34175  poimirlem3  36491  poimirlem15  36503  poimirlem16  36504  poimirlem17  36505  poimirlem19  36507  poimirlem20  36508  metakunt17  41001  eldioph2lem1  41498  eldioph2lem2  41499