| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > foun | Structured version Visualization version GIF version | ||
| Description: The union of two onto functions with disjoint domains is an onto function. (Contributed by Mario Carneiro, 22-Jun-2016.) |
| Ref | Expression |
|---|---|
| foun | ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–onto→(𝐵 ∪ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fofn 6774 | . . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹 Fn 𝐴) | |
| 2 | fofn 6774 | . . . 4 ⊢ (𝐺:𝐶–onto→𝐷 → 𝐺 Fn 𝐶) | |
| 3 | 1, 2 | anim12i 613 | . . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) → (𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶)) |
| 4 | fnun 6632 | . . 3 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶)) | |
| 5 | 3, 4 | sylan 580 | . 2 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶)) |
| 6 | rnun 6118 | . . 3 ⊢ ran (𝐹 ∪ 𝐺) = (ran 𝐹 ∪ ran 𝐺) | |
| 7 | forn 6775 | . . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵) | |
| 8 | 7 | ad2antrr 726 | . . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → ran 𝐹 = 𝐵) |
| 9 | forn 6775 | . . . . 5 ⊢ (𝐺:𝐶–onto→𝐷 → ran 𝐺 = 𝐷) | |
| 10 | 9 | ad2antlr 727 | . . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → ran 𝐺 = 𝐷) |
| 11 | 8, 10 | uneq12d 4132 | . . 3 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → (ran 𝐹 ∪ ran 𝐺) = (𝐵 ∪ 𝐷)) |
| 12 | 6, 11 | eqtrid 2776 | . 2 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → ran (𝐹 ∪ 𝐺) = (𝐵 ∪ 𝐷)) |
| 13 | df-fo 6517 | . 2 ⊢ ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–onto→(𝐵 ∪ 𝐷) ↔ ((𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶) ∧ ran (𝐹 ∪ 𝐺) = (𝐵 ∪ 𝐷))) | |
| 14 | 5, 12, 13 | sylanbrc 583 | 1 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐶)–onto→(𝐵 ∪ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∪ cun 3912 ∩ cin 3913 ∅c0 4296 ran crn 5639 Fn wfn 6506 –onto→wfo 6509 |
| 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 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| 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 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-br 5108 df-opab 5170 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-fun 6513 df-fn 6514 df-f 6515 df-fo 6517 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |