Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fun2 | Structured version Visualization version GIF version |
Description: The union of two functions with disjoint domains. (Contributed by Mario Carneiro, 12-Mar-2015.) |
Ref | Expression |
---|---|
fun2 | ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fun 6066 | . 2 ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐶)) | |
2 | unidm 3756 | . . 3 ⊢ (𝐶 ∪ 𝐶) = 𝐶 | |
3 | feq3 6028 | . . 3 ⊢ ((𝐶 ∪ 𝐶) = 𝐶 → ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐶) ↔ (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶)) | |
4 | 2, 3 | ax-mp 5 | . 2 ⊢ ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐶) ↔ (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
5 | 1, 4 | sylib 208 | 1 ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∪ cun 3572 ∩ cin 3573 ∅c0 3915 ⟶wf 5884 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-br 4654 df-opab 4713 df-id 5024 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-fun 5890 df-fn 5891 df-f 5892 |
This theorem is referenced by: fun2d 6068 fresaun 6075 mapunen 8129 ac6sfi 8204 axdc3lem4 9275 fseq1p1m1 12414 axlowdimlem5 25826 axlowdimlem7 25828 resf1o 29505 locfinref 29908 breprexplema 30708 |
Copyright terms: Public domain | W3C validator |