![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fnunres2 | Structured version Visualization version GIF version |
Description: Restriction of a disjoint union to the domain of the second function. (Contributed by Thierry Arnoux, 12-Oct-2023.) |
Ref | Expression |
---|---|
fnunres2 | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uncom 4153 | . . 3 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹) | |
2 | 1 | reseq1i 5977 | . 2 ⊢ ((𝐹 ∪ 𝐺) ↾ 𝐵) = ((𝐺 ∪ 𝐹) ↾ 𝐵) |
3 | ineqcom 4202 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅) | |
4 | fnunres1 6661 | . . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐵 ∩ 𝐴) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺) | |
5 | 3, 4 | syl3an3b 1404 | . . 3 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺) |
6 | 5 | 3com12 1122 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺) |
7 | 2, 6 | eqtrid 2783 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∪ cun 3946 ∩ cin 3947 ∅c0 4322 ↾ cres 5678 Fn wfn 6538 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-ext 2702 ax-sep 5299 ax-nul 5306 ax-pr 5427 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2723 df-clel 2809 df-ral 3061 df-rex 3070 df-rab 3432 df-v 3475 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-sn 4629 df-pr 4631 df-op 4635 df-br 5149 df-opab 5211 df-xp 5682 df-rel 5683 df-dm 5686 df-res 5688 df-fun 6545 df-fn 6546 |
This theorem is referenced by: tocycfvres1 32540 cycpmconjslem2 32585 evlselvlem 41461 evlselv 41462 |
Copyright terms: Public domain | W3C validator |