| 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 4111 | . . 3 ⊢ (𝐹 ∪ 𝐺) = (𝐺 ∪ 𝐹) | |
| 2 | 1 | reseq1i 5961 | . 2 ⊢ ((𝐹 ∪ 𝐺) ↾ 𝐵) = ((𝐺 ∪ 𝐹) ↾ 𝐵) |
| 3 | ineqcom 4162 | . . . 4 ⊢ ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐵 ∩ 𝐴) = ∅) | |
| 4 | fnunres1 6633 | . . . 4 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐵 ∩ 𝐴) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺) | |
| 5 | 3, 4 | syl3an3b 1424 | . . 3 ⊢ ((𝐺 Fn 𝐵 ∧ 𝐹 Fn 𝐴 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺) |
| 6 | 5 | 3com12 1136 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐺 ∪ 𝐹) ↾ 𝐵) = 𝐺) |
| 7 | 2, 6 | eqtrid 2809 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐵 ∧ (𝐴 ∩ 𝐵) = ∅) → ((𝐹 ∪ 𝐺) ↾ 𝐵) = 𝐺) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1098 = wceq 1560 ∪ cun 3902 ∩ cin 3903 ∅c0 4285 ↾ cres 5649 Fn wfn 6516 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5246 ax-pr 5390 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3077 df-rex 3087 df-rab 3415 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-sn 4583 df-pr 4585 df-op 4589 df-br 5101 df-opab 5163 df-xp 5653 df-rel 5654 df-dm 5657 df-res 5659 df-fun 6523 df-fn 6524 |
| This theorem is referenced by: tocycfvres1 33290 cycpmconjslem2 33335 dvun 42968 evlselvlem 43170 evlselv 43171 |
| Copyright terms: Public domain | W3C validator |