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 7055. (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 5887 | . . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) |
3 | resundir 5906 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) | |
4 | disjdifr 4406 | . . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ | |
5 | resdisj 6072 | . . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅) | |
6 | 4, 5 | ax-mp 5 | . . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅ |
7 | 6 | uneq2i 4094 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) |
8 | un0 4324 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) | |
9 | 7, 8 | eqtri 2766 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
10 | 3, 9 | eqtri 2766 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
11 | 2, 10 | eqtri 2766 | . . 3 ⊢ (𝐺 ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
12 | 11 | fveq1i 6775 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) |
13 | fvsnun.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
14 | snidg 4595 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ {𝐴}) | |
15 | 13, 14 | syl 17 | . . 3 ⊢ (𝜑 → 𝐴 ∈ {𝐴}) |
16 | 15 | fvresd 6794 | . 2 ⊢ (𝜑 → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴)) |
17 | 15 | fvresd 6794 | . . 3 ⊢ (𝜑 → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴)) |
18 | fvsnun.2 | . . . 4 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
19 | fvsng 7052 | . . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵) | |
20 | 13, 18, 19 | syl2anc 584 | . . 3 ⊢ (𝜑 → ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵) |
21 | 17, 20 | eqtrd 2778 | . 2 ⊢ (𝜑 → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = 𝐵) |
22 | 12, 16, 21 | 3eqtr3a 2802 | 1 ⊢ (𝜑 → (𝐺‘𝐴) = 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 ∖ cdif 3884 ∪ cun 3885 ∩ cin 3886 ∅c0 4256 {csn 4561 〈cop 4567 ↾ cres 5591 ‘cfv 6433 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-opab 5137 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-res 5601 df-iota 6391 df-fun 6435 df-fv 6441 |
This theorem is referenced by: fac0 13990 ruclem4 15943 satfv1lem 33324 |
Copyright terms: Public domain | W3C validator |