| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvsnun1 | Structured version Visualization version GIF version | ||
| Description: The value of a function with one of its ordered pairs replaced, at the replaced ordered pair. See also fvsnun2 7167. (Contributed by NM, 23-Sep-2007.) Put in deduction form. (Revised by BJ, 25-Feb-2023.) |
| Ref | Expression |
|---|---|
| fvsnun.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| fvsnun.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
| fvsnun.3 | ⊢ 𝐺 = ({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) |
| Ref | Expression |
|---|---|
| fvsnun1 | ⊢ (𝜑 → (𝐺‘𝐴) = 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvsnun.3 | . . . . 5 ⊢ 𝐺 = ({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) | |
| 2 | 1 | reseq1i 5961 | . . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) |
| 3 | resundir 5980 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) | |
| 4 | disjdifr 4427 | . . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ | |
| 5 | resdisj 6155 | . . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅ |
| 7 | 6 | uneq2i 4118 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) |
| 8 | un0 4348 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) | |
| 9 | 7, 8 | eqtri 2785 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 10 | 3, 9 | eqtri 2785 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 11 | 2, 10 | eqtri 2785 | . . 3 ⊢ (𝐺 ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 12 | 11 | fveq1i 6868 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) |
| 13 | fvsnun.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 14 | snidg 4619 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴}) | |
| 15 | 13, 14 | syl 17 | . . 3 ⊢ (𝜑 → 𝐴 ∈ {𝐴}) |
| 16 | 15 | fvresd 6887 | . 2 ⊢ (𝜑 → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴)) |
| 17 | 15 | fvresd 6887 | . . 3 ⊢ (𝜑 → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴)) |
| 18 | fvsnun.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 19 | fvsng 7164 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵) | |
| 20 | 13, 18, 19 | syl2anc 593 | . . 3 ⊢ (𝜑 → ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵) |
| 21 | 17, 20 | eqtrd 2797 | . 2 ⊢ (𝜑 → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = 𝐵) |
| 22 | 12, 16, 21 | 3eqtr3a 2821 | 1 ⊢ (𝜑 → (𝐺‘𝐴) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1560 ∈ wcel 2142 ∖ cdif 3901 ∪ cun 3902 ∩ cin 3903 ∅c0 4285 {csn 4582 〈cop 4588 ↾ cres 5649 ‘cfv 6521 |
| 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-10 2175 ax-12 2212 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-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 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-uni 4866 df-br 5101 df-opab 5163 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-res 5659 df-iota 6477 df-fun 6523 df-fv 6529 |
| This theorem is referenced by: fac0 14289 ruclem4 16266 satfv1lem 35712 |
| Copyright terms: Public domain | W3C validator |