| 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 7129. (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 5934 | . . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) |
| 3 | resundir 5953 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) | |
| 4 | disjdifr 4425 | . . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ | |
| 5 | resdisj 6127 | . . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅) | |
| 6 | 4, 5 | ax-mp 5 | . . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅ |
| 7 | 6 | uneq2i 4117 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) |
| 8 | un0 4346 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) | |
| 9 | 7, 8 | eqtri 2759 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 10 | 3, 9 | eqtri 2759 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 11 | 2, 10 | eqtri 2759 | . . 3 ⊢ (𝐺 ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 12 | 11 | fveq1i 6835 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) |
| 13 | fvsnun.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 14 | snidg 4617 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴}) | |
| 15 | 13, 14 | syl 17 | . . 3 ⊢ (𝜑 → 𝐴 ∈ {𝐴}) |
| 16 | 15 | fvresd 6854 | . 2 ⊢ (𝜑 → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴)) |
| 17 | 15 | fvresd 6854 | . . 3 ⊢ (𝜑 → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴)) |
| 18 | fvsnun.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
| 19 | fvsng 7126 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵) | |
| 20 | 13, 18, 19 | syl2anc 584 | . . 3 ⊢ (𝜑 → ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵) |
| 21 | 17, 20 | eqtrd 2771 | . 2 ⊢ (𝜑 → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = 𝐵) |
| 22 | 12, 16, 21 | 3eqtr3a 2795 | 1 ⊢ (𝜑 → (𝐺‘𝐴) = 𝐵) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ∖ cdif 3898 ∪ cun 3899 ∩ cin 3900 ∅c0 4285 {csn 4580 〈cop 4586 ↾ cres 5626 ‘cfv 6492 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-res 5636 df-iota 6448 df-fun 6494 df-fv 6500 |
| This theorem is referenced by: fac0 14199 ruclem4 16159 satfv1lem 35556 |
| Copyright terms: Public domain | W3C validator |