| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvsnun1 | GIF version | ||
| Description: The value of a function with one of its ordered pairs replaced, at the replaced ordered pair. See also fvsnun2 5805. (Contributed by NM, 23-Sep-2007.) |
| Ref | Expression |
|---|---|
| fvsnun.1 | ⊢ 𝐴 ∈ V |
| fvsnun.2 | ⊢ 𝐵 ∈ V |
| fvsnun.3 | ⊢ 𝐺 = ({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) |
| Ref | Expression |
|---|---|
| fvsnun1 | ⊢ (𝐺‘𝐴) = 𝐵 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvsnun.3 | . . . . 5 ⊢ 𝐺 = ({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) | |
| 2 | 1 | reseq1i 4974 | . . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) |
| 3 | resundir 4992 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) | |
| 4 | incom 3373 | . . . . . . . . 9 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ({𝐴} ∩ (𝐶 ∖ {𝐴})) | |
| 5 | disjdif 3541 | . . . . . . . . 9 ⊢ ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ | |
| 6 | 4, 5 | eqtri 2228 | . . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ |
| 7 | resdisj 5130 | . . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅) | |
| 8 | 6, 7 | ax-mp 5 | . . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅ |
| 9 | 8 | uneq2i 3332 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) |
| 10 | un0 3502 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) | |
| 11 | 9, 10 | eqtri 2228 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 12 | 3, 11 | eqtri 2228 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 13 | 2, 12 | eqtri 2228 | . . 3 ⊢ (𝐺 ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 14 | 13 | fveq1i 5600 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) |
| 15 | fvsnun.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 16 | 15 | snid 3674 | . . 3 ⊢ 𝐴 ∈ {𝐴} |
| 17 | fvres 5623 | . . 3 ⊢ (𝐴 ∈ {𝐴} → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴)) | |
| 18 | 16, 17 | ax-mp 5 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴) |
| 19 | fvres 5623 | . . . 4 ⊢ (𝐴 ∈ {𝐴} → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴)) | |
| 20 | 16, 19 | ax-mp 5 | . . 3 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴) |
| 21 | fvsnun.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 22 | 15, 21 | fvsn 5802 | . . 3 ⊢ ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵 |
| 23 | 20, 22 | eqtri 2228 | . 2 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = 𝐵 |
| 24 | 14, 18, 23 | 3eqtr3i 2236 | 1 ⊢ (𝐺‘𝐴) = 𝐵 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1373 ∈ wcel 2178 Vcvv 2776 ∖ cdif 3171 ∪ cun 3172 ∩ cin 3173 ∅c0 3468 {csn 3643 〈cop 3646 ↾ cres 4695 ‘cfv 5290 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2181 ax-ext 2189 ax-sep 4178 ax-pow 4234 ax-pr 4269 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2194 df-cleq 2200 df-clel 2203 df-nfc 2339 df-ral 2491 df-rex 2492 df-v 2778 df-sbc 3006 df-dif 3176 df-un 3178 df-in 3180 df-ss 3187 df-nul 3469 df-pw 3628 df-sn 3649 df-pr 3650 df-op 3652 df-uni 3865 df-br 4060 df-opab 4122 df-id 4358 df-xp 4699 df-rel 4700 df-cnv 4701 df-co 4702 df-dm 4703 df-res 4705 df-iota 5251 df-fun 5292 df-fv 5298 |
| This theorem is referenced by: fac0 10910 |
| Copyright terms: Public domain | W3C validator |