| 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 5760. (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 4942 | . . . 4 ⊢ (𝐺 ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) |
| 3 | resundir 4960 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) | |
| 4 | incom 3355 | . . . . . . . . 9 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ({𝐴} ∩ (𝐶 ∖ {𝐴})) | |
| 5 | disjdif 3523 | . . . . . . . . 9 ⊢ ({𝐴} ∩ (𝐶 ∖ {𝐴})) = ∅ | |
| 6 | 4, 5 | eqtri 2217 | . . . . . . . 8 ⊢ ((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ |
| 7 | resdisj 5098 | . . . . . . . 8 ⊢ (((𝐶 ∖ {𝐴}) ∩ {𝐴}) = ∅ → ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅) | |
| 8 | 6, 7 | ax-mp 5 | . . . . . . 7 ⊢ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴}) = ∅ |
| 9 | 8 | uneq2i 3314 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) |
| 10 | un0 3484 | . . . . . 6 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ∅) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) | |
| 11 | 9, 10 | eqtri 2217 | . . . . 5 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴}) ∪ ((𝐹 ↾ (𝐶 ∖ {𝐴})) ↾ {𝐴})) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 12 | 3, 11 | eqtri 2217 | . . . 4 ⊢ (({〈𝐴, 𝐵〉} ∪ (𝐹 ↾ (𝐶 ∖ {𝐴}))) ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 13 | 2, 12 | eqtri 2217 | . . 3 ⊢ (𝐺 ↾ {𝐴}) = ({〈𝐴, 𝐵〉} ↾ {𝐴}) |
| 14 | 13 | fveq1i 5559 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) |
| 15 | fvsnun.1 | . . . 4 ⊢ 𝐴 ∈ V | |
| 16 | 15 | snid 3653 | . . 3 ⊢ 𝐴 ∈ {𝐴} |
| 17 | fvres 5582 | . . 3 ⊢ (𝐴 ∈ {𝐴} → ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴)) | |
| 18 | 16, 17 | ax-mp 5 | . 2 ⊢ ((𝐺 ↾ {𝐴})‘𝐴) = (𝐺‘𝐴) |
| 19 | fvres 5582 | . . . 4 ⊢ (𝐴 ∈ {𝐴} → (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴)) | |
| 20 | 16, 19 | ax-mp 5 | . . 3 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = ({〈𝐴, 𝐵〉}‘𝐴) |
| 21 | fvsnun.2 | . . . 4 ⊢ 𝐵 ∈ V | |
| 22 | 15, 21 | fvsn 5757 | . . 3 ⊢ ({〈𝐴, 𝐵〉}‘𝐴) = 𝐵 |
| 23 | 20, 22 | eqtri 2217 | . 2 ⊢ (({〈𝐴, 𝐵〉} ↾ {𝐴})‘𝐴) = 𝐵 |
| 24 | 14, 18, 23 | 3eqtr3i 2225 | 1 ⊢ (𝐺‘𝐴) = 𝐵 |
| Colors of variables: wff set class |
| Syntax hints: = wceq 1364 ∈ wcel 2167 Vcvv 2763 ∖ cdif 3154 ∪ cun 3155 ∩ cin 3156 ∅c0 3450 {csn 3622 〈cop 3625 ↾ cres 4665 ‘cfv 5258 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-14 2170 ax-ext 2178 ax-sep 4151 ax-pow 4207 ax-pr 4242 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ral 2480 df-rex 2481 df-v 2765 df-sbc 2990 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3451 df-pw 3607 df-sn 3628 df-pr 3629 df-op 3631 df-uni 3840 df-br 4034 df-opab 4095 df-id 4328 df-xp 4669 df-rel 4670 df-cnv 4671 df-co 4672 df-dm 4673 df-res 4675 df-iota 5219 df-fun 5260 df-fv 5266 |
| This theorem is referenced by: fac0 10820 |
| Copyright terms: Public domain | W3C validator |