![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fresaunres1 | Structured version Visualization version GIF version |
Description: From the union of two functions that agree on the domain overlap, either component can be recovered by restriction. (Contributed by Mario Carneiro, 16-Feb-2015.) |
Ref | Expression |
---|---|
fresaunres1 | ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uncom 4168 | . . 3 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹) | |
2 | 1 | reseq1i 5996 | . 2 ⊢ ((𝐹 ∪ 𝐺) ↾ 𝐴) = ((𝐺 ∪ 𝐹) ↾ 𝐴) |
3 | incom 4217 | . . . . . 6 ⊢ (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴) | |
4 | 3 | reseq2i 5997 | . . . . 5 ⊢ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐹 ↾ (𝐵 ∩ 𝐴)) |
5 | 3 | reseq2i 5997 | . . . . 5 ⊢ (𝐺 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐵 ∩ 𝐴)) |
6 | 4, 5 | eqeq12i 2753 | . . . 4 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵)) ↔ (𝐹 ↾ (𝐵 ∩ 𝐴)) = (𝐺 ↾ (𝐵 ∩ 𝐴))) |
7 | eqcom 2742 | . . . 4 ⊢ ((𝐹 ↾ (𝐵 ∩ 𝐴)) = (𝐺 ↾ (𝐵 ∩ 𝐴)) ↔ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴))) | |
8 | 6, 7 | bitri 275 | . . 3 ⊢ ((𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵)) ↔ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴))) |
9 | fresaunres2 6781 | . . . 4 ⊢ ((𝐺:𝐵⟶𝐶 ∧ 𝐹:𝐴⟶𝐶 ∧ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴))) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹) | |
10 | 9 | 3com12 1122 | . . 3 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴))) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹) |
11 | 8, 10 | syl3an3b 1404 | . 2 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹) |
12 | 2, 11 | eqtrid 2787 | 1 ⊢ ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1537 ∪ cun 3961 ∩ cin 3962 ↾ cres 5691 ⟶wf 6559 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-ext 2706 ax-sep 5302 ax-nul 5312 ax-pr 5438 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-sb 2063 df-clab 2713 df-cleq 2727 df-clel 2814 df-ral 3060 df-rex 3069 df-rab 3434 df-v 3480 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-nul 4340 df-if 4532 df-sn 4632 df-pr 4634 df-op 4638 df-br 5149 df-opab 5211 df-xp 5695 df-rel 5696 df-dm 5699 df-res 5701 df-fun 6565 df-fn 6566 df-f 6567 |
This theorem is referenced by: mapunen 9185 hashf1lem1 14491 ptuncnv 23831 resf1o 32748 cvmliftlem10 35279 aacllem 49032 |
Copyright terms: Public domain | W3C validator |