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 6690 | . . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹 Fn 𝐴) | |
2 | fofn 6690 | . . . 4 ⊢ (𝐺:𝐶–onto→𝐷 → 𝐺 Fn 𝐶) | |
3 | 1, 2 | anim12i 613 | . . 3 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) → (𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶)) |
4 | fnun 6545 | . . 3 ⊢ (((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐶) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶)) | |
5 | 3, 4 | sylan 580 | . 2 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → (𝐹 ∪ 𝐺) Fn (𝐴 ∪ 𝐶)) |
6 | rnun 6049 | . . 3 ⊢ ran (𝐹 ∪ 𝐺) = (ran 𝐹 ∪ ran 𝐺) | |
7 | forn 6691 | . . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 → ran 𝐹 = 𝐵) | |
8 | 7 | ad2antrr 723 | . . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → ran 𝐹 = 𝐵) |
9 | forn 6691 | . . . . 5 ⊢ (𝐺:𝐶–onto→𝐷 → ran 𝐺 = 𝐷) | |
10 | 9 | ad2antlr 724 | . . . 4 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → ran 𝐺 = 𝐷) |
11 | 8, 10 | uneq12d 4098 | . . 3 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → (ran 𝐹 ∪ ran 𝐺) = (𝐵 ∪ 𝐷)) |
12 | 6, 11 | eqtrid 2790 | . 2 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝐺:𝐶–onto→𝐷) ∧ (𝐴 ∩ 𝐶) = ∅) → ran (𝐹 ∪ 𝐺) = (𝐵 ∪ 𝐷)) |
13 | df-fo 6439 | . 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 396 = wceq 1539 ∪ cun 3885 ∩ cin 3886 ∅c0 4256 ran crn 5590 Fn wfn 6428 –onto→wfo 6431 |
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-fo 6439 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |