![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fun2 | 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 5183 | . 2 ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐶)) | |
2 | unidm 3143 | . . 3 ⊢ (𝐶 ∪ 𝐶) = 𝐶 | |
3 | feq3 5147 | . . 3 ⊢ ((𝐶 ∪ 𝐶) = 𝐶 → ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐶) ↔ (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶)) | |
4 | 2, 3 | ax-mp 7 | . 2 ⊢ ((𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶(𝐶 ∪ 𝐶) ↔ (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
5 | 1, 4 | sylib 120 | 1 ⊢ (((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶) ∧ (𝐴 ∩ 𝐵) = ∅) → (𝐹 ∪ 𝐺):(𝐴 ∪ 𝐵)⟶𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1289 ∪ cun 2997 ∩ cin 2998 ∅c0 3286 ⟶wf 5011 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 579 ax-in2 580 ax-io 665 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-10 1441 ax-11 1442 ax-i12 1443 ax-bndl 1444 ax-4 1445 ax-14 1450 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 ax-sep 3957 ax-pow 4009 ax-pr 4036 |
This theorem depends on definitions: df-bi 115 df-3an 926 df-tru 1292 df-nf 1395 df-sb 1693 df-eu 1951 df-mo 1952 df-clab 2075 df-cleq 2081 df-clel 2084 df-nfc 2217 df-ral 2364 df-v 2621 df-dif 3001 df-un 3003 df-in 3005 df-ss 3012 df-nul 3287 df-pw 3431 df-sn 3452 df-pr 3453 df-op 3455 df-br 3846 df-opab 3900 df-id 4120 df-rel 4445 df-cnv 4446 df-co 4447 df-dm 4448 df-rn 4449 df-fun 5017 df-fn 5018 df-f 5019 |
This theorem is referenced by: ac6sfi 6612 fseq1p1m1 9504 fxnn0nninf 9840 |
Copyright terms: Public domain | W3C validator |