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

Theorem fnunres2 6657
Description: Restriction of a disjoint union to the domain of the second function. (Contributed by Thierry Arnoux, 12-Oct-2023.)
Assertion
Ref Expression
fnunres2 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺)

Proof of Theorem fnunres2
StepHypRef Expression
1 uncom 4156 . . 3 (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹)
21reseq1i 5967 . 2 ((𝐹 ∪ 𝐺) ↾ 𝐵) = ((𝐺 ∪ 𝐹) ↾ 𝐵)
3 ineqcom 4106 . . . 4 ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅)
4 fnunres1 6656 . . . 4 ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐵 ∩ 𝐴) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺)
53, 4syl3an3b 1432 . . 3 ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺)
653com12 1141 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺)
72, 6eqtrid 2807 1 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1569   ∩ cin 4088   ∪ cun 4148  ∅c0 4277   ↾ cres 5653   Fn wfn 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5657  df-rel 5658  df-dm 5661  df-res 5663  df-fun 6545  df-fn 6546
This theorem is used by:  tocycfvres1  33721  cycpmconjslem2  33766  dvun  43547  evlselvlem  43753  evlselv  43754
  Copyright terms: Public domain W3C validator