MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fresaunres1 Structured version   Visualization version   GIF version

Theorem fresaunres1 6774
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.)
Assertion
Ref Expression
fresaunres1 ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹)

Proof of Theorem fresaunres1
StepHypRef Expression
1 uncom 4160 . . 3 (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹)
21reseq1i 5976 . 2 ((𝐹 ∪ 𝐺) ↾ 𝐴) = ((𝐺 ∪ 𝐹) ↾ 𝐴)
3 incom 4109 . . . . . 6 (𝐴 ∩ 𝐵) = (𝐵 ∩ 𝐴)
43reseq2i 5977 . . . . 5 (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐹 ↾ (𝐵 ∩ 𝐴))
53reseq2i 5977 . . . . 5 (𝐺 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐵 ∩ 𝐴))
64, 5eqeq12i 2781 . . . 4 ((𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵)) ↔ (𝐹 ↾ (𝐵 ∩ 𝐴)) = (𝐺 ↾ (𝐵 ∩ 𝐴)))
7 eqcom 2770 . . . 4 ((𝐹 ↾ (𝐵 ∩ 𝐴)) = (𝐺 ↾ (𝐵 ∩ 𝐴)) ↔ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴)))
86, 7bitri 278 . . 3 ((𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵)) ↔ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴)))
9 fresaunres2 6773 . . . 4 ((𝐺:𝐵⟶𝐶 ∧ 𝐹:𝐴⟶𝐶 ∧ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴))) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹)
1093com12 1141 . . 3 ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐺 ↾ (𝐵 ∩ 𝐴)) = (𝐹 ↾ (𝐵 ∩ 𝐴))) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹)
118, 10syl3an3b 1433 . 2 ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐺 ∪ 𝐹) ↾ 𝐴) = 𝐹)
122, 11eqtrid 2810 1 ((𝐹:𝐴⟶𝐶 ∧ 𝐺:𝐵⟶𝐶 ∧ (𝐹 ↾ (𝐴 ∩ 𝐵)) = (𝐺 ↾ (𝐴 ∩ 𝐵))) → ((𝐹 ∪ 𝐺) ↾ 𝐴) = 𝐹)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∩ cin 4092   ∪ cun 4152   ↾ cres 5657  ⟶wf 6551
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5171  df-xp 5661  df-rel 5662  df-dm 5665  df-res 5667  df-fun 6557  df-fn 6558  df-f 6559
This theorem is used by:  mapunen  9190  hashf1lem1  14624  ptuncnv  24153  resf1o  33389  cvmliftlem10  36225  aacllem  51217
  Copyright terms: Public domain W3C validator